Cod sursa(job #2375330)
Utilizator | Data | 8 martie 2019 01:04:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,k;
unsigned short frecv[2000001];
int main()
{
f>>n;
for(int i=2; i<=sqrt(n); i++)
if(!frecv[i])
for(int j=i; j<=n/i; j++)
frecv[i*j] = 1;
for(int i=2; i<=n; i++)
if(!frecv[i]) k++;
g<<k;
f.close();
g.close();
return 0;
}