Cod sursa(job #390653)
Utilizator | Data | 4 februarie 2010 12:02:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
using namespace std;
int n;
int prim(int x)
{
if(x != 2)
if(x>2 && x%2 == 0)
return 0;
for(int i=3;i*i<=x;i+=2)
if(x%i == 0)
return 0;
return 1;
}
int main()
{
int nr = 0;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for(int i=2;i<=n;i++)
if(prim(i) == 1 )
{
nr++;
}
printf("%d", nr);
return 0;
}