Hard Number Theory Problemo

Revision en1, by SirirNicheBirirDokan, 2018-06-11 15:02:42

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.

Tags hard, #number theory, problemo

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English SirirNicheBirirDokan 2018-06-11 20:16:10 9 Tiny change: '5 seconds.' -> '5 seconds. Wut do? '
en1 English SirirNicheBirirDokan 2018-06-11 15:02:42 320 Initial revision (published)