Cod sursa(job #3131456)
Utilizator | Data | 20 mai 2023 11:57:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool ciur[2000005];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n, cnt = 0;
fin>>n;
ciur[0]=1;
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]=true;
}
}
}
fout<<cnt;
return 0;
}