Cod sursa(job #460276)
Utilizator | Data | 1 iunie 2010 19:54:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream.h>
#include <stdio.h>
int i,j,n;
int ciur[11111];
int main()
{ freopen("ciur.in", "rt", stdin);
freopen("ciur.out", "wt", stdout);
cin>>n;
for(i=2;i<=(n/2);i++)
for(j=2;(j*i)<=n;j++)
ciur[j*i]=1;
for(i=2;i<n;i++)
if(ciur[i]==0)
cout<<i<<" "<<endl;;
return 0;
}