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