Cod sursa(job #2969312)
Utilizator | Data | 22 ianuarie 2023 20:53:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int a[2000005];
int ciur(int n)
{
for(int i=2;i*i<=n;i++)
{
if(!a[i])
for(int j=i*i;j<=n;j+=i)
{
a[j]=1;
}
}
int nr=0;
for(int i=2;i<=n;i++)
if(!a[i])
nr++;
return nr;
}
int main()
{
int n;
fin>>n;
fout<<ciur(n);
return 0;
}