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