Cod sursa(job #2642395)
Utilizator | Data | 15 august 2020 02:52:12 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include<iostream>
#include<fstream>
using namespace std;
int divizori(int a, int b) {
int cmmdc_a, cmmdc_b, max;
if (a > b) {
max = a;
}
else {
max = b;
}
do{
cmmdc_a = a % max;
cmmdc_b = b % max;
max--;
} while (cmmdc_a != 0 || cmmdc_b != 0);
max++;
return max;
}
int main() {
int numar=0;
int N;
cin >> N;
for (int p = 1; p <= N; p++) {
for (int q = 1; q <= N; q++) {
if (divizori(p, q) == 1) {
numar++;
}
}
}
cout << numar;
cin.get();
return 0;
}