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