Cod sursa(job #2585168)
Utilizator | Data | 18 martie 2020 18:27:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int MAX=2000005;
int n,i,j,cnt;
char p[MAX];
int main()
{
fin >> n;
if(n<=1)
{
fout << 0;
return 0;
}
for(i=2;i<=n;i++)
if(p[i]==0)
{
cnt++;
for(j=2*i;j<=n;j+=i)
p[j]=1;
}
fout << cnt;
return 0;
}