Cod sursa(job #2516094)
Utilizator | Data | 30 decembrie 2019 12:57:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in"); ofstream fout("ciur.out");
int n;
bool a[2000010];
int main() {
fin>>n;
int m;
for(int i=2; i<=sqrt(n); i++){
if(!a[i]){
m=i*i;
while(m<=n){a[m]=true; m+=i;}
}
}
int c=0;
for(int i=2; i<=n; i++){
if(!a[i]){c++;}
}
fout<<c;
}