WEBSITE RETURNED, HOWEVER SUBMIT QUANTITY IS RESTRICTED PER DAY TO VERY LITTLE (UNDER JUDGE0 NEW POLICY, API PROVIDER). Therefore it is very much for you to pay attention TEST CAREFULLY CODE BEFORE SUBMIT.

Smaller prime numbers k

Threads: Enter an integer k, print out a list of prime numbers less than k.
Input: An integer k.
Output: A line of smaller prime numbers k, each number separated by spaces. Without any prime number less than k, then print out “NOT FOUND”.
For example:

input:
5
output:
2 3

You are not logged in? Log in to Submit Now!

5 Comments

Add a Comment