Cod sursa(job #2170685)
Utilizator | Data | 15 martie 2018 09:22:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,nr;
bool v[2000010];
int main()
{
fin>>n;
v[1]=1;
nr=0;
for(i=2; i<=n/2; i++)
{
if(v[i]==0)
{
nr++;
for(j=i+i; j<=n; j=j+i)
{
v[j]=1;
}
}
}
for(i=n/2+1;i<=n;i++)
{
if(v[i]==0)
{
nr++;
}
}
fout<<nr;
}