Cod sursa(job #1743115)
Utilizator | Data | 17 august 2016 16:44:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, a[2000005], i, k;
int main()
{
fin >> n;
for (i = 2; i <= n; i++) a[i] = 0;
for (i = 2; i <= n / 2; i++){
k = 2;
while( i*k <= n )
{
a[i*k] = 1;
k++;
}
}
k = 0;
for (i = 2; i <= n; i++) if (a[i] == 0) k++;
fout << k;
return 0;
}