HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Kovrov IT 2010 > problem:


B. Primes

Volume problems

• A. Providers
• B. Primes
• C. Bishops
• D. Unusual Lottery
• E. Polygons
• F. Liars and Knights
• G. Sequence
• H. Coins
• I. Galls village
• J. String manipulations

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 3000/4000/4000/4000 ms. Memory limit 65000/80000/80000/80000 Kb.
Автор: Игорь Андрианов, ВоГТУ.

Your task is simply to find the quantity of prime numbers in the range from a to b.

Input
The first line contains two integers a and b, separated by a space
(2 ≤ ab ≤ 1012; (b - a) ≤ 107).

Output
Output the quantity.

Input 1 Output 1
10 20
4

Для отправки решений необходимо выполнить вход.

www.contester.ru