Cod sursa(job #3358763)
| Utilizator | Data | 20 iunie 2026 00:34:33 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include<iostream>
using namespace std;
int main()
{
int n,cnt=0;
cin>>n;
bool p[1000001];
for(int i=2; i<=n; i++)
p[i]=true;
for(int i=2; i*i<=n; i++)
if(p[i])
for(int j=i*i; j<=n; j+=i)
p[j]=false;
for(int i=2; i<=n; i++)
if(p[i])cnt++;
cout<<cnt;
return 0;
}
