Cod sursa(job #2919838)
Utilizator | Data | 20 august 2022 00:21:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n,cnt;
bool v[2000002];
int main()
{
cin>>n;
v[1]=v[0]=1;
for(int i=3; i<=n; i++)
{
if(i%2==0)
v[i]=1;
if(v[i]==0)
{
cnt++;
for(int j=3; j*i<=n; j+=2)
v[i*j]=1;
}
}
cout<<cnt+1;
}