Cod sursa(job #2191914)
Utilizator | Data | 4 aprilie 2018 08:41:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#define NMAX 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N;
char V[NMAX];
int K;
void ciur()
{
for(int i=2;i<=N;i++)
{
if (V[i] == 0)
{
K++;
for(int j=i+i;j<=N;j+=i)
V[j] = 1;
}
}
}
int main()
{
fin>>N;
ciur();
fout<<K;
return 0;
}