Cod sursa(job #2141541)
Utilizator | Data | 24 februarie 2018 13:35:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define NMax 2000005
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
bool prim[2000005];
int main()
{
int contor = 0;
fin >> n;
for(int i = 2; i <= n; i++)
{
prim[i] = 1;
}
for(int i = 2; i <= n; i++)
{
if(prim[i])
{
contor++;
for(int j = i + i; j <= n; j += i)
prim[j] = 0;
}
}
fout << contor;
}