Cod sursa(job #1364727)
Utilizator | Data | 27 februarie 2015 19:56:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#define N 2000000
using namespace std;
int main()
{
long n,i,j;
bool ciur [200001];
for (i=1;i<=n;++i) ciur[i]=true;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int cnt=0;
fin>>n;
for (i=2;i<=n;++i)
if(ciur[i]==true){
cnt++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=false;
}
fout<<cnt;
fin.close();
fout.close();
return 0;
}