Cod sursa(job #657813)
| Utilizator |  Stefan Teodorescu Stefex09 |
Data | 7 ianuarie 2012 14:32:14 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include<stdio.h>
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,nrp=-1,i,j;
char ciur[2000000];
scanf("%d",&n);
for(i=2;i<=n/2;i++)
for(j=i;j<=n/2;j++)
ciur[i*j]=1;
for(int a=1;a<=n;a++)
if(!ciur[a]) nrp++;
printf("%d",nrp);
return 0;
}