Cod sursa(job #2311477)
| Utilizator | Data | 3 ianuarie 2019 12:13:49 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fi ("ciur.in");
ofstream fo ("ciur.out");
int n,m=1,s;
bool v[1005];
int main()
{
fi >> n;
v[0] = 1;
v[1] = 1;
for (int i = 1 ; i <= n ; ++i)
{
if (v[i] == 0)
for (int j = i+i ; j <= n ; j += i)
v[j] = 1;
}
for (int i = 1 ; i <= n ; ++i)
{
if (v[m] == 0)
++s;
++m;
}
fo << s;
return 0;
}
