Cod sursa(job #3322706)
| Utilizator | Data | 15 noiembrie 2025 11:55:57 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
#define cin in
#define cout out
int x[2000001];
int main()
{
int n;
cin>>n;
x[0]=x[1]=0;
for (int i=2; i<=sqrt(n); ++i)
{
if (x[i]==0)
{
for (int j=2; j*i<=n; ++j)
{
x[i*j]=1;
}
}
}
int nr=0, a;
for (int i=1; i<=n; ++i)
{
if (x[i]==0) nr++;
}
cout<<nr-1;
return 0;
}
