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