Cod sursa(job #1340060)
Utilizator | Data | 11 februarie 2015 15:00:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | 9neplace | Marime | 0.48 kb |
#include <fstream>
#define N 2000000
using namespace std;
int main()
{
bool ciur[2000001];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long n,i,j;
for(i=2;i<=N;i++) ciur[i]=true;
fin>>n;
int cnt=0;
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;
}