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