Cod sursa(job #2513881)
Utilizator | Data | 23 decembrie 2019 23:14:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool a[2000005];
int main()
{
long long int n, i, j, p=0;
fin>>n;
if(n>=2)
for(i=2;i<=n;i++)
{
if(a[i]==0)
{p++;
for(j=2*i;j<=n;j=j+i)
a[j]=true;
}
}
fout<<p;
return 0;
}