Cod sursa(job #2329744)
Utilizator | Data | 27 ianuarie 2019 13:14:24 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int euclid(int a, int b)
{
if (b == 0)
return a;
else
euclid(b, a % b);
}
int main()
{
int n, count = 0;
in >> n;
for (int p = 1; p <= n; p++)
{
for (int q = 1; q <= n; q++)
{
if (euclid(p, q) == 1)
count++;
}
}
out << count;
return 0;
}