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