Cod sursa(job #2163217)
Utilizator | Data | 12 martie 2018 17:15:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr,viz[2000000];
int main()
{
f>>n;
for(int i=2;i<=n;++i){
if(!viz[i]){
nr++;
for(int j=2;i*j<=n;++j)
viz[i*j]=1;
}
}
g<<nr;
}