Cod sursa(job #223499)
Utilizator | Data | 28 noiembrie 2008 18:15:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<stdio.h>
int main()
{
int n,i,j;
bool v[1000];
scanf("%d",&n);
for(i=2;i<=n;++i) v[i]=true;
v[0]=v[1]=false;
for(i=2;i*i<=n;++i)
if(v[i])
for(j=i*i;j<=n;j*=i)
v[j]=false;
for(i=2;i<=n;++i)
if(v[i]) printf("%d",i);
return 0;
}