Cod sursa(job #3360059)
| Utilizator | Data | 8 iulie 2026 14:03:41 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int N = 2000001;
int n,i,cnt;
short int p[N];
int main()
{
f>>n;
for(i=2;i*i<=n;i++)
if(p[i]==0)
{
cnt++;
for(int j=i*i;j<=n;j+=i)
p[j]=1;
}
for(;i<=n;i++)
if(p[i]==0)
cnt++;
g<<cnt<<'\n';
return 0;
}
