Cod sursa(job #731191)
Utilizator | Data | 7 aprilie 2012 17:50:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
using namespace std;
#include <stdio.h>
int n, c;
char a[2000001];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int i,j;
scanf("%d",&n);
for(i=2; i<=n; i++)
if (!a[i])
{ ++c;
for (j = i+i; j<=n; j+=i)
a[j]=1;
}
printf("%d\n", c);
return 0;
}