SirirNicheBirirDokan's blog

Hard Number Theory Problemo
By SirirNicheBirirDokan, history, 6 years ago, In English

Link: https://toph.co/p/breaking-math

The task is simple. Given n, k you gotta print

where ω(j) is the number of distinct prime factors of j.

Constraints: 1 ≤ k ≤ 10,  1 ≤ n ≤ 1011.

TL is fuckin' big, 15 seconds. Wut do?

  • Vote: I like it
  • +50
  • Vote: I do not like it

»
6 years ago, # |
  Vote: I like it +12 Vote: I do not like it

Really interesting problem. Min_25, please give hint! Not to forget another math masters, Endagorion, rng_58, zimpha, yutaka1999, Golovanov399 (sorry if I forgot anyone ^^). Mamedov

→ Reply