Cod sursa(job #2280078)
Utilizator | Data | 10 noiembrie 2018 11:18:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#define N 2000001
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int v[N];
int main ()
{
int c;
int cont=0;
fin >> c;
for (int i=2; i<=c; i++)
{
if (v[i]==0)
{
for (int j=i+i; j<=c; j=j+i)
v[i]=1;
}
}
for (int i=2; i<=c; i++)
if (v[i]==0)
cont++;
fout << cont-1;
}