Cod sursa(job #1009433)
Utilizator | Data | 13 octombrie 2013 09:19:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#include<cstdio>
using namespace std;
int prim[2000005];
int n,i,j,x;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for (i=2; i<=n; i++)
prim[i]=1;
for (i=2; i<=n; i++)
{
if (prim[i])
{
x++;
for (j=i+i; j<=n; j+=i)
prim[j]=0;
}
}
printf("%d", x);
return 0;
}