Cod sursa(job #2510451)
Utilizator | Data | 16 decembrie 2019 18:42:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n, x=0;
bool v[2000000];
cin>>n;
for(int i=1;i<=n;++i)
v[i]=true;
for(int i=2; i<=(int)sqrt(n);++i)
if(v[i]==true)
for(int j=i*i;j<=n;j+=i)
v[j]=false;
for(int i=2;i<=n;++i)
if(v[i]==true) ++x;
cout<<x;
return 0;
}