Cod sursa(job #2119454)
| Utilizator | Data | 1 februarie 2018 11:27:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000001];
int n,i,d,ct;
void ciur(bool v[],int n)
{
for(i=4;i<n;i+=2)
v[i]=true;
v[0]=true;
v[1]=true;
for(d=3;d*d<n;d+=2)
{
if(v[d]==false)
{
for(i=d*d;i<n;i+=d)
v[i]=true;
}
}
}
int main()
{
fin >> n;
n++;
ciur(v,n);
for(i=0;i<n;i++)
{
if(v[i]==false)
ct++;
}
fout <<ct;
return 0;
}
