Cod sursa(job #244835)
Utilizator | Data | 16 ianuarie 2009 06:43:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
char a[2000001];
int main(){
int N, cates,i,j;
ifstream f("ciur.in");
f>>N;
f.close();
a[0]=1;
a[1]=1;
for(i=3; i*i<=N;i++)
if(a[i]==0){
for(j=i*i;j<=N;j+=(i<<1))
a[j]=1;
}
ofstream g("ciur.out");
cates=1;
for(i=3;i<=N;i+=2)
if(!a[i])
cates++;
g<<cates<<'\n';
g.close();
return 0;
}