HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Kovrov IT > problem:


2010.B. 50281 - Primes

Guest
• Discussion of problem (2)

Volume problems

• 2009.C. 50285 - Meat store
• 2009.D. 50259 - Many-coloured roads
• 2009.E. 50266 - Kovrov
• 2009.F. 50267 - Interesting permutat...
• 2009.G. 50260 - What about judges?
• 2009.H. 50268 - Triangles
• 2009.I. 50278 - ATM
• 2010.A. 50287 - Providers
• 2010.B. 50281 - Primes
• 2010.C. 50255 - Bishops
• 2010.D. 50277 - Unusual Lottery
• 2010.E. 50664 - Polygons
• 2010.F. 50265 - Liars and Knights
• 2010.G. 50256 - Sequence
• 2010.H. 50282 - Coins
• 2010.I. 50257 - Galls village
• 2010.J. 50258 - 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