Cod sursa(job #2100255)
Utilizator | Data | 5 ianuarie 2018 14:13:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nr;
bool p[2000005];
int main(){
fin>> n ;
for(int i = 2; i <=n; i++)
if(!p[i]){
nr++;
for(int j = i + 1; j<=n; j+=i)
p[i] = 1;
}
fout<< nr ;
return 0;
}