Cod sursa(job #2127533)
Utilizator | Data | 10 februarie 2018 18:51:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char a[2000001];
int main()
{
int n, k, j, i;
f >> n;
k = 0;
for (i = 2; i <= n; i++)
if (a[i] == 0)
{
k++;
for (j = 2; i*j <= n; j++)
a[i*j] = 1;
}
g << k;
}