Lucky Numbers Again
|
All submissions for this problem are available.
A lucky number N is defined as a number which has only two factors, both of them distinct and prime and the absolute difference between the two factors is not more than 50.
Given two integers, a and b, find the total lucky numbers in the range a to b (inclusive).
Input
1.The first input will be T, the number of test-cases. T <= 2000. T lines follow, one for each test case.
2.For each test case there are two integers a and b on each line. 1 <= a <= b <= 100000
Output
For every test case, print the number of lucky numbers from a to b (inclusive).
Example
Input: 1 1 20
Output: 4
Explanation From 1 to 20, there are four lucky numbers, 6,10, 14, and 15.
| Author: | csirubix |
| Tags | csirubix |
| Date Added: | 13-02-2010 |
| Time Limit: | 0.241463 sec |
| Source Limit: | 50000 Bytes |
| Languages: | C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS |
Comments
- Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
|
If you are still having problems, see a sample solution here. |
Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark.
Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach.
Your program compiled and ran succesfully but the output did not match the expected output.
Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section.
Your code was unable to compile. When you see this icon, click on it for more information.
