Cod sursa(job #2603286)
Utilizator | Data | 19 aprilie 2020 00:41:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i, j, n, nr;
bool w[2000005];
int main()
{
f >> n;
for(i = 2; i <= n; ++ i)
{
if(!w[i])
{
nr ++;
for(j = i + i; j <= n; j += i)
w[j] = 1;
}
}
g << nr;
return 0;
}