Cod sursa(job #2383815)
Utilizator | Data | 19 martie 2019 20:04:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long n,x,y,pr[2000005],nr;
int main()
{
f>>n;
for(int i=2;i*i<=n;i++)
if(pr[i]==0)
for(int j=2*i;j<=n;j+=i)
pr[j]=1;
for(int i=1;i<=n;i++)
if(pr[i]==0)
nr++;
g<<nr;
return 0;
}