Cod sursa(job #2291629)
| Utilizator | Data | 28 noiembrie 2018 12:58:07 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<iostream>
using namespace std;
int cmmdc(int a, int b) {
if (b == 0)
return a;
return cmmdc(b, a%b);
}
int max(int i, int j) {
return i > j ? i : j;
}
int min(int i, int j) {
return i > j ? j : i;
}
int main() {
FILE *i, *o;
int n, count = 0;
i=fopen("fractii.in", "r");
fscanf(i, "%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (cmmdc(max(i,j), min(i,j)) == 1) {
count++;
}
o = fopen("fractii.out", "w");
fprintf(o, "%d\n", count);
fclose(i);
fclose(o);
}