Cod sursa(job #1937115)
| Utilizator | Data | 23 martie 2017 18:48:31 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#define NMax 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int N,ciur[NMax+1],i,j,cnt=0;
fin>>N;
fin.close();
for(i=2;i<=N;i++)
ciur[i]=1;
for(i=2;i*i<=N;i++)
if(ciur[i]==1)
for(j=2;j*i<=N;j++)
ciur[j*i]=0;
for(i=2;i<=N;i++)
if(ciur[i]==1)
cnt++;
fout<<cnt;
fout.close();
return 0;
}
