Cod sursa(job #2678022)
Utilizator | Data | 27 noiembrie 2020 22:40:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool ciur[2000005];
long long i,j,n,sum;
int main()
{
f>>n;
ciur[1]=1;
for (i=2;i*i<=n;i++)
{
if (ciur[i]==0)
{
for (j=1LL*i*i;j<=n;j+=i)
{
ciur[j]=1;
}
}
}
for (i=1;i<=n;i++)
{
sum=sum+1-ciur[i];
}
g<<sum;
return 0;
}