Cod sursa(job #1179472)
Utilizator | Data | 28 aprilie 2014 19:12:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n;
bool ciur[2000005];
int main()
{
int i,j,cnt=0;
ifstream fin("ciur.in");
fin>>n;
fin.close();
for(i=2;i*i<=n;++i)
if(ciur[i]==false)
for(j=2;j*i<n;++j)
ciur[j*i]=true;
ofstream fout("ciur.out");
for(i=2;i<n;++i)
if(ciur[i]==false)
cnt++;
fout<<cnt<<"\n";
fout.close();
return 0;
}