Cod sursa(job #2356353)
| Utilizator | Data | 26 februarie 2019 17:11:53 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool p[2000001];
int n ,i ,j ,nr;
int main()
{
nr = 1;
f >> n;
for (i = 3; i <= n; i = i + 2)
{
if (p[i] == 0)
{
nr++;
for (j = i + i; j <= n; j = j + i)
p[j] = 1;
}
}
g << nr;
return 0;
}
