Cod sursa(job #2541898)
Utilizator | Data | 9 februarie 2020 09:13:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[1999994];
int main()
{
int n, nr;
f >> n;
if(n == 1)
g << 0;
else
{
nr = 1;
for(int i = 3; i <= n; i += 2)
if(v[i] == 0)
{
nr = 0;
for(int j = 2 * i; j <= n; j += i)
v[j] = 1;
}
g << nr;
}
return 0;
}