Cod sursa(job #2705572)
Utilizator | Data | 12 februarie 2021 21:19:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
long long n, a[2000001], i, j, k;
int main()
{
f >> n;
a[1] = 1;
for (i=4; i<=n; i=i+2)
a[i] = 1;
for (i=2; i*i<=n; i++)
if (a[i]==0)
for (j=2; j*i<=n; j++)
a[j*i] = 1;
for (i=1; i<=n; i++)
if (a[i]==0)
k++;
g << k;
}