Cod sursa(job #2437151)
| Utilizator | Data | 8 iulie 2019 17:15:03 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,cnt;
bool A[2000015];
int main()
{
int i,j;
fin>>n;
fill(A+2,A+n+10,1);
for(i = 2;i<=n;i++)
{
if(A[i])
{
cnt++;
for(j = i+i;j<=n;j+=i)
A[j]=0;
}
}
fout<<cnt;
return 0;
}
