Cod sursa(job #1442285)
Utilizator | Data | 24 mai 2015 22:31:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
const int MAX_N = 2000006;
int i,j,nr,n;
bool a[MAX_N];
int main(){
fi>>n;
for(i=2;i<=n;i++) a[i]=1;
for(i=2;i<=n;i++)
if(a[i]){
++nr;
for(j=i*i;j<=n;j+=i) a[j]=0;
}
fo<<nr;
fi.close();
fo.close();
return 0;
}