一、题目描述
二、算法分析说明
要求输出A’和B’,且A’、B’ ≤ L,1 ≤ L ≤ 100,可见枚举次数不超过 10000,可以暴力枚举。
三、AC 代码(1 ms)
#include<cstdio>
#pragma warning(disable:4996)
unsigned a, b, c, d, l; double m, n, p = 1e+12; const double e = 1e-12;
template<class _Ty> _Ty gcd(const _Ty& a, const _Ty& b) {//a, b > 0
return b == 0 ? a : gcd(b, a % b);
}
int main() {
scanf("%u%u%u", &a, &b, &l); m = (double)a / b;
for (unsigned i = 1; i <= l; ++i) {
for (unsigned j = 1; j <= l; ++j) {
if (gcd(i, j) != 1)continue;
n = (double)i / j; if (m > n)break;
if (n - m < p) { c = i, d = j; p = n - m; }
}
}
printf("%u %u\n", c, d);
return 0;
}