Cod sursa(job #2470625)
Utilizator | Data | 9 octombrie 2019 16:51:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, nr=0;
bool prime[2000005];
f >> n;
for(int i=2; i<=n; i++)
prime[i] = 1;
for(int i=2; i<=n; i++)
if(prime[i]) {
nr++;
for(int j=2; i*j<=n; j++)
prime[i*j] = 0;
}
g << nr;
f.close();
g.close();
return 0;
}