Cod sursa(job #2844120)
Utilizator | Data | 3 februarie 2022 19:51:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin ("ciur.in");
ofstream cout ("ciur.out");
int v[2000002];
int n;
int main()
{
cin>>n;
int cnt=0;
v[0]=1;
v[1]=1;
for(int i=2;i<=sqrt(n);i++)
{
if(v[i]==0)
{
for(int j=2;j<=n/i;j++)
{
v[i*j]=1;
}
}
}
for(int i=1;i<=n;i++)
{
if(v[i]==0)
cnt++;
}
cout<<cnt;
return 0;
}