Cod sursa(job #2866983)
Utilizator | Data | 10 martie 2022 09:36:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");ofstream g("ciur.out");
int n,nr,prim[2000005];
int main()
{
f>>n;
prim[0]=prim[1]=1;
for(int i=2;i<=n;i++)
{
if(!prim[i] && i*i<=n)
{
for(int j=i+i;j<=n;j+=i)
{
prim[j]=1;
}
}
}
for(int i=2;i<=n;i++)
{
if(!prim[i])
{
nr++;
}
}
g<<nr;
return 0;
}