Cod sursa(job #3143890)
Utilizator | Data | 2 august 2023 20:20:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
#define cin fin
#define cout fout
int n , k;
bool v[2000005];
int main()
{
cin>>n;
v[0]=1; v[1]=1;
for(int i=2 ; i*i<=n ; i++)
{
if(v[i] == 0)
{
for(int j=i*i ; j<=n ; j+=i) v[j]=1;
}
}
for(int i=2 ; i<=n ; i++)
if(v[i] == 0) k++;
cout<<k;
return 0;
}