Cod sursa(job #151649)
Utilizator | Data | 8 martie 2008 14:46:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
int n,i,j,nr;
char a[2000001];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
a[1]=1;
for(i=2;i<=n;i++)
if(a[i]==0){nr++;
for(j=i*2;j<=n;j+=i)
a[j]=1;}
g<<nr<<endl;
for(i=2;i<=n;i++)
if(a[i]==0){
nr--;
if(nr<1000) g<<i<<" ";}
g.close();
}