Cod sursa(job #342914)
Utilizator | Data | 24 august 2009 13:23:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <stdio.h>
char a[2000003];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i,n,sol;
scanf("%d",&n);
for (i=2;i<=n;i*i)
if (!a[i])
{
sol++;
for (int j=2*i; j<=n; j+=i)
a[j]=i;
}
printf("%d",sol);
return 0;
}