Cod sursa(job #2100266)
Utilizator | Data | 5 ianuarie 2018 14:23:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 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;
p[0] = 1;
p[1] = 1;
for(int i = 2; i <=n; i++)
if(!p[i]){
nr++;
for(int j = i + i; j <= n; j += i)
p[j] = 1;
}
fout << nr;
return 0;
}