题目链接:
https://pintia.cn/problem-sets/994805260223102976/problems/994805268334886912
思路:
使用辗转相除法gcd计算a和b的最大公约数,因为要列出n1/m1和n2/m2之间的最简分数,但是n1/m1不一定小于n2/m2,所以如果n1 * m2 > n2 * m1,说明n1/m1比n2/m2大,则调换n1和n2、m1和m2的位置~假设所求的分数分母为k、分子num,先令num=1,当n1 * k >= m1 * num时,num不断++,直到num符合n1/m1 < num/k为止~然后在n1/m1和n2/m2之间找符合条件的num的值,用gcd(num, k)是否等于1判断num和k是否有最大公约数,如果等于1表示没有最大公约数,就输出num/k,然后num不断++直到退出循环.
原文:https://blog.csdn.net/liuchuo/article/details/53563122
AC代码:
#include <iostream>
using namespace std;
int gcd(int a, int b){
return b == 0 ? a : gcd(b, a % b);
}
int main() {
int n1, m1, n2, m2, k;
scanf("%d/%d %d/%d %d", &n1, &m1, &n2, &m2, &k);
if(n1 * m2 > n2 * m1) {
swap(n1, n2);
swap(m1, m2);
}
int num = 1;
bool flag = false;
while(n1 * k >= m1 * num) num++;
while(n1 * k < m1 * num && m2 * num < n2 * k) {
if(gcd(num, k) == 1) {
printf("%s%d/%d", flag == true ? " " : "", num, k);
flag = true;
}
num++;
}
return 0;
}
二刷:
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
double n1, m1, n2, m2;
int k;
cin >> n1 >> m1 >> n2 >> m2 >> k;
double a, b,c,temp;
a = n1 / m1, b = n2 / m2;
while (a > b) {
temp = a;
a = b;
b = temp;
}
c = 1.0 / k;
int i, j, t = 0;
int flag;
for (i = 1; i*1.0 / k; i++) {
c = i * 1.0 / k;
flag = 0;
if (c > a&&c < b) {
for (j = 2; j <= i; j++) {
if (i%j == 0&&k%j==0 ) {//
//如果不是最简flag=1
flag = 1;
break;
}
}
if (flag == 0) {
if (t == 1)
printf(" ");
printf("%d/%d", i, k);
t = 1;
}
}
}
return 0;
}
三刷:
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
double a, b, c, d, e;
double a1, a2, a3;
int gcd(int a, int b) {
return a % b == 0 ? b : gcd(b, a%b);
}
int main() {
scanf("%lf/%lf", &a, &b); a1 = a / b;
scanf("%lf/%lf", &c, &d); a2 = c / d;
if (a1 > a2) {
double temp = a1;
a1 = a2;
a2 = temp;
}
scanf("%lf", &e);
int flag = 1;
for (double i = 1; i < e; i++) {
a3 = i / e;
if (a1 < a3&&a3 < a2) {
if (gcd(i, e) == 1) {
if (flag) {
flag = 0;
printf("%.0f/%.0f", i, e);
}
else {
printf(" %.0f/%.0f", i, e);
}
}
}
}
printf("\n");
return 0;
}