Cod sursa(job #2863954)
Utilizator | Data | 7 martie 2022 14:05:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int v[2000000];
int main()
{
int n, nr=0;
cin>>n;
for(int i=2;i*i<=n;i++)
{
if(v[i]){
for(int j=2*i;j<=n;j+=i)
v[j]=1;
}
}
for(int i=2;i<=n;i++)
if(v[i]==0) nr++;
cout<<nr;
cin.close();
cout.close();
return 0;
}