Cod sursa(job #2498643)
Utilizator | Data | 24 noiembrie 2019 09:59:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, r, v[2000000];
int main()
{
f >> n;
for(int i = 2; i < n; i++)
v[i] = 1;
for(int i = 2; i <= n; i++){
if(v[i] == 1)
for(int d = i*i; d <= n; d += i)
v[d] = 0;
}
for(int i = 0; i < n; i++)
r += v[i];
g << r;
return 0;
}