Cod sursa(job #1692651)
Utilizator | Feraru Mihail LittleWho | Data | 21 aprilie 2016 13:10:31 |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
void euclid(int a, int b, int *d)
{
if (!b) {
*d = a;
} else {
euclid(b, a % b, d);
}
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
int n;
in >> n;
int nf = 0;
for (int a = 1; a <= n; a++) {
for (int b = 1; b <= n; b++) {
int d;
euclid(a, b, &d);
if (d == 1) {
nf++;
}
}
}
out << nf << "\n";
in.close();
out.close();
return 0;
}