Cod sursa(job #970659)
Utilizator | Data | 7 iulie 2013 15:16:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
bool ok[2000001]={};
int nr=1,n;
f>>n;
for(int i=3;i<=n;i+=2)
if(!ok[i]){
nr++;
for(int j=2;j*i<=n;j++) ok[i*j]=1;
}
g<<nr;
return 0;
}