joj2359

2359: Prime Before 2007

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	1292	682	Standard

A prime number is a positve integer that is divided evenly only by 1 and itself. There are infinitely prime number. The Greek mathematician Euclid proved this more than 2,000 years ago. If a number has factors other than 1 and itself, it's called composite.

Is this year 2007 is a prime? Of course, it is not a prime. 2007 can be divided by 3 and other factors. Your task is to find all primes between 1000 and 2007.

Input

No input in this problem.

Output

Output all prime between 1000 and 2007 ascending. One prime in one line.

Sample Output

Output is just as below.

1009
1013
...
...
...
2003

Problem Source: 1st Jilin Province Contest, skywind

---

This problem is used for contest: 63  145  164 

---

Submit / Problem List / Status / Discuss

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

 

 

 

 

#include<cstdio>
#include<cmath>
bool is_prime(int n)
{
    int m=sqrt(n);
    for(int i=2;i<=m;i++)
    {
        if(n%i==0)return false;
    }
    return true;
}
int main()
{
   for(int i=1000;i<=2007;i++)
   {
       if(is_prime(i))printf("%d\n",i);
   }
   return 0;
}