Cod sursa(job #1250578)
Utilizator | irina oglinzanu irina202 | Data | 28 octombrie 2014 12:48:16 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char p[2000001];//p[i]==0 daca i este prim
long long n,i,j,nr=0;
int main()
{ f>>n;
for(i=2;i<=n;i++)
if(p[i]==0)
{ nr++;g<<i<<" ";
for(j=i+i;j<=n;j=j+i)p[i]=1;
}
g<<nr;
g.close();
return 0;
}