Cod sursa(job #223500)
Utilizator | Data | 28 noiembrie 2008 18:17:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout)
int n,i,j,nr=0;
bool a[1000];
scanf("%d",&n);
for(i=2;i<=n;i++)
a[i]=true;
v[0]=false;v[1]=false;
for(i=2;i*i<=n;i++)
if(v[i])
for(j=i*i;j<=n;j=j+i)
a[j]=false;
for(i=2;i<=n;i++)
if(a[i]) nr++;
printf("%d",n);
}