Hard Number Theory Problemo

→ Pay attention

*has extra registration

→ Top rated

→ Top contributors

View all →

→ Find user

→ Recent actions

Detailed →

Hard Number Theory Problemo

Revision en2, by SirirNicheBirirDokan, 2018-06-11 20:16:10

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

$\text{[math]}$

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

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

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

hard, #number theory, problemo

Revisions

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