Cod sursa(job #2382293)
Utilizator | Data | 18 martie 2019 07:48:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
bool a[2000000];
void ciur()
{
int i,j;
for (i=2;i*i<=n;i++)
if (a[i]==0)
for (j=i*i;j<=n;j+=i)
a[j]=1;
}
int contor()
{
int ct=0,i;
for (i=2;i<=n;i++)
if (a[i]==0)
ct++;
return ct;
}
int main()
{
fin>>n;
ciur();
fout<<contor();
return 0;
}