Cod sursa(job #2923725)
Utilizator | Data | 18 septembrie 2022 14:53:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;\
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000000];
int main()
{
int cnt=0;
long long int n;
fin>>n;
for(int i=2;i*i<=n;i++)
if(v[i]==0)
for(int j=i*i;j<=n;j+=i)
v[j]=1;
for(int i=2;i<=n;i++)
if(v[i]==0) cnt++;
fout<<cnt;
return 0;
}