Cod sursa(job #2512761)
Utilizator | Data | 21 decembrie 2019 16:08:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, ciur[2000005], cnt;
int main(){
fin>>n;
for(int i=2;i<=n;i++){
if(ciur[i]==0){
cnt++;
for(int j=i+i;j<=n;j+=i){
ciur[j] = 1;
}
}
}
fout<<cnt;
return 0;
}