Cod sursa(job #2521397)
| Utilizator | Data | 10 ianuarie 2020 20:09:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int CMAX = 2000015;
bool v[CMAX];
int n , k = 0;
int main()
{
fin >> n;
for(int i=2;i<=n;i++)
{
if(v[i]==0)
{
k++;
for(int j=i+i;j<=n;j=j+i)
{
v[j] = 1;
}
}
}
fout << k;
return 0;
}
