2009 Mock Dwite by A.J.: Problem 1
Super Special Awesome Numbers =DA 'super' number is a number whose digital sum (i.e., the sum of its digits) is even!
A 'special' number is a number with strictly increasing digits!
An 'awesome' number is a number that is not divisible by any perfect square other than 1!
Given a range, determine how many Super Special Awesome numbers lie within it.
InputThe input will contain five lines. Each line will contain two integers L and U (1 ≤ L ≤ U ≤ 1 000 000).
OutputFor each line given in input, in the order given, output one line containing a single integer: the number of Super Special Awesome numbers between L and U (inclusive).
2 10 30 300 6666 66666 12345 67890 100000 1000000
2 23 51 50 32
Point Value: 10 (partial)
Time Limit: 60.00s
Memory Limit: 256M
Added: Sep 26, 2009
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3