You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

36 lines
821 B

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

#include <bits/stdc++.h>
using namespace std;
/*
由于 L 在100以内因此可以枚举 A,B 的所有组合,然后判断:
(1)、A,B 是否互质;
(2)、AB 是否大于等于 AB并且最小
时间复杂度O(L^2 LogL)
*/
int gcd(int a, int b) {
return b ? gcd(b, a % b) : a;
}
int main() {
int A, B, L;
cin >> A >> B >> L;
int a, b;
double mi = 1e9;
for (int i = 1; i <= L; i++)
for (int j = 1; j <= L; j++)
if (gcd(i, j) == 1) {
double x = i * 1.0 / j;
double X = A * 1.0 / B;
if (x >= X && x - X < mi) {
mi = x - X;
a = i, b = j;
}
}
cout << a << ' ' << b << endl;
return 0;
}