Cod sursa(job #1717476)
Utilizator | Data | 14 iunie 2016 22:11:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int prim = 0, n, t = 0;
f >> n;
for (int i = 2; i <= n; ++i){
for (int j = 2; j < i; ++j){
if (i%j == 0)
t++;
}
if (t==0)
prim++;
t = 0;
}
g << prim;
f.close();
g.close();
return 0;
}