Cod sursa(job #3037462)
Utilizator | Data | 25 martie 2023 15:45:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
const int VMAX = 2e6+2;
bool ciur[VMAX];
int n,cnt;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
fin >> n;
ciur[0] = ciur[1] = 1;
for(int i = 2; i <= n; i++){
if(ciur[i] == 0){
cnt++;
for(int j = 2*i; j <= n; j += i){
ciur[j] = 1;
}
}
}
fout << cnt;
return 0;
}