Public submissions
Source code of every submission to this problem in this contest
will be visible for everyone since 2014-03-30 20:30:00.
| All submissions | Best solutions | Back to list |
SANP - Shashank And The Non-prime |
Given q queries , each query consist of two integer a and b . Count the number of non-prime number between a and b .(a and b inclusive).
Input
First line contain q quries , (1<=q<=100000). Each query contain two integer a and b, 1<=a,b<=1000000.
Output
For each query print the number of non-prime number between a and b,(a and b inclusive)
Example
Input: 3
1 3
2 5
2 7
Output: 1
1
2
| Added by: | shashank |
| Date: | 2014-03-04 |
| Time limit: | 1s-1.5s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM32-GCC ASM64 MAWK BC C-CLANG NCSHARP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY JULIA KTLN NIM OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET |
| Public source code since: | 2014-03-30 20:30:00 |
RSS