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