Cod sursa(job #2923745)
Utilizator | Data | 18 septembrie 2022 17:31:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.24 kb |
#include <iostream>
using namespace std;
int v[2000001];
int main()
{int n,k=0;
cin>>n;
for(int i=2;i<=n;i++)
if(v[i]==0)
for(int j=2*i;j<=n;j+=i)
v[j]=1;
for(int i=2;i<=n;i++)
if(!v[i])k++;
cout<<k;
return 0;
}