Cod sursa(job #1806098)
Utilizator | Data | 14 noiembrie 2016 20:33:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int p[2000000];
int main (){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int nr,n;
fin>>n;
for (int i=2; i<=n; ++i){
if (p[i]==0)
++nr;
for (int j=i+i; j<=n; j+=i){
p[j] = 1;
}
}
fout<<nr;
return 0;
}