Cod sursa(job #2354213)
| Utilizator | Data | 25 februarie 2019 00:37:20 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
bool freq[2000005];
int Ciur(int n)
{
int ans = 1;
for(int i = 3; i <= n; i += 2) {
if(!freq[i]) {
++ans;
for(int j = 3; j * i <= n; j += 2) freq[i * j] = 1;
}
}
return ans;
}
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciru.out", "w", stdout);
int n;
scanf("%d", &n);
printf("%d", Ciur(n));
return 0;
}
