Cod sursa(job #2607159)
Utilizator | Data | 29 aprilie 2020 13:38:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int const nmax=2000005;
int n,pr=0;
bool a[nmax];
int main(){
in >>n;
for(int i=2;i<=n;i++){
if(!a[i]){
pr++;
for(int j=i*i;j<=n;j++){
if(j % i==0){
a[j]=1;
}
}
}
}
out << pr;
}