Cod sursa(job #2396553)
Utilizator | Data | 3 aprilie 2019 16:52:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <iostream>
using namespace std;
bool x[2000005];
int n;
int ciur()
{
int i,j;
x[1]=true;
for(i=2; i<=n; i++)
{
if(!x[i])
for(j=i+i; j<=n; j+=i)
x[j]=true;
}
j=0;
for(i=2; i<=n; i++)
if(!x[i])
j++;
return j;
}
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
fout << ciur();
return 0;
}