Pagini recente » Cod sursa (job #1534015) | Cod sursa (job #1590390) | Cod sursa (job #2377638) | Cod sursa (job #761233) | Cod sursa (job #2642396)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
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;
fin >> N;
for (int p = 1; p <= N; p++) {
for (int q = 1; q <= N; q++) {
if (divizori(p, q) == 1) {
numar++;
}
}
}
fout << numar;
cin.get();
return 0;
}