Time limit: 1.0s
Memory limit: 64M
Maniacal Midsummer Marathon 2014 by AL, TL, JJ
"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 and , determine the number of distinct prime factors for each integer between and , inclusive.
The input consists of two lines. The first line will contain the integer , and the second line will contain the integer .
The output should contain lines. Each line should contain a single integer, the number of distinct prime factors of .
2 2 2 1 2 1 2 1 2 1 3