Cod sursa(job #526380)
Utilizator | Data | 28 ianuarie 2011 10:37:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<stdio.h>
int n,i,k,nr;
char a[2000005];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
a[0]='1';
a[1]='1';
for(i=2;i<=n;i++)
{
for(k=2;k*i<=n;k++)
{
a[k*i]='1';
}
if(a[i]!='1')
{
nr=nr+1;
}
}
printf("%d",nr);
return 0;
}