Cod sursa(job #2430090)
Utilizator | Data | 12 iunie 2019 18:00:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char A[2000005];
int main()
{
int N, i, j, nr = 0;
f >> N;
f.close();
for (i = 2; i <= N; i++)
if (A[i] == 0)
{
nr++;
for (j = i + i; j <= N; j = j + i)
A[j] = 1;
}
g << nr;
g.close();
}