Cod sursa(job #2280146)
Utilizator | Data | 10 noiembrie 2018 11:59:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n , v[2000000];
int main() {
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
int i , j , nr=0;
for(i=2 ; i<n ; i++){
if(v[i]==0){
for(j=i*i ; j<n ;j+=i){
v[j]=1;
nr++;
}
}
}
fout<<nr;
return 0;
}