Cod sursa(job #2060117)
Utilizator | Data | 7 noiembrie 2017 21:08:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool v[2000000];
void civ()
{
for(int i=2;i<2000000;i++)
{
if(v[i]==0)
{
for(int j=i+i;j<2000000;j+=i)
v[j]=1;
}
}
}
int main()
{civ();
int n,cnt=0;
cin>>n;
for(int i=2;i<n;i++)
if(v[i]==0)
cnt++;
cout<<cnt;
return 0;
}