## COCI '08 Contest 2 #2 Reseto

View as PDF

Points: 5
Time limit: 1.0s
Memory limit: 32M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

The sieve of Eratosthenes is a famous algorithm to find all prime numbers up to . The algorithm is:

1. Write down all integers between and , inclusive.
2. Find the smallest number not already crossed out and call it ; is prime.
3. Cross out and all its multiples that aren't already crossed out.
4. If not all numbers have been crossed out, go to step .

Write a program that, given and , find the integer to be crossed out.

#### Input Specification

The integers and .

#### Output Specification

Output the number to be crossed out.

#### Sample Input 1

7 3

#### Sample Output 1

6

#### Sample Input 2

15 12

#### Sample Output 2

7

#### Sample Input 3

10 7

#### Sample Output 3

9

In the third example, we cross out, in order, the numbers and . The seventh number is .