Cod sursa(job #1976456)
| Utilizator | Data | 3 mai 2017 15:00:32 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool prim(int n)
{
int i;
if(n<2)
return 0;
if(n<4)
return 1;
if(n%2==0 || n%3==0)
return 0;
i=5;
while(i*i<=n)
{
if(n%i==0 || n%(i+2)==0)
return 0;
i+=6;
}
return 1;
}
int main()
{
int n,i,cnt=0;
in>>n;
for(i=2; i<=n; i++)
{
if(prim(i))
cnt++;
}
out<<cnt;
return 0;
}
