Maniacal Midsummer Marathon 2014 by AL, TL, JJ
Problem A: Distinct Prime Factors
"What do we make them do for problem A?"
"Uh… make them prime factorize a number."
"Isn't that a bit too easy?"
"Fine, make them prime factorize a BIG number."
"Like with GNFS? Isn't that a bit too hard?"
"Fine, let's make them prime factorize a lot of numbers."
"Just how many are you thinking?"
"All of them."
"k screw this, let's slap on some bounds and call it a day."
Given two integers A and B (2 ≤ A ≤ B ≤ 1000000), determine the number of distinct prime factors for each integer between A and B, inclusive.
The input consists of two lines. The first line will contain the integer A, and the second line will contain the integer B.
The output should contain B − A + 1 lines. Each line should contain a single integer, the number of distinct prime factors of A, A+1, …, B.
2 2 2 1 2 1 2 1 2 1 3
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3