Cod sursa(job #1989427)
Utilizator | Data | 7 iunie 2017 12:09:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int p[1000001];
int main()
{
int n, i, m = 0, j, nr = 0;
f >>n;
for(i = 2; i<= n; i++)
if(p[i] == 0)
{
nr++;
for(j = i + i; j <= n; j += i)
p[j] = 1;
}
g<<nr<<'\n';
return 0;
}