Cod sursa(job #2072328)
Utilizator | Data | 21 noiembrie 2017 18:59:19 | |
---|---|---|---|
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");
bool v[2000003];
int main()
{
int n,nr;
fin>>n;
for(int i=1;i<=n;i++)
v[i]=1;
nr=n-1;
for(int i=2;i<=n/2;i++)
{
if(v[i]!=0)
{
for(int j=i+i;j<=n;j+=i)
{
if(v[j]!=0)
{
v[j]=0;
nr--;
}
}
}
}
fout<<nr;
return 0;
}