Cod sursa(job #3339581)
| Utilizator | Data | 8 februarie 2026 22:55:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,a[2000005];
void ciur()
{
int k=0;
for(int i=2;i<=2000000;i++)
{
if(a[i]==0)
{
for(int j=2*i;j<=2000000;j+=i)
{
a[j]=1;
}
a[i]=++k;
}
a[i]=k;
}
}
int main()
{
fin>>n;
ciur();
fout<<a[n];
}
