0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-10 04:58:48 +00:00

P2118 比例简化

R40130533
This commit is contained in:
Baoshuo Ren 2020-10-19 22:34:31 +08:00 committed by Baoshuo Ren
parent 51a98ba4b7
commit fe44b6f366
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

26
problem/P2118/P2118.cpp Normal file
View File

@ -0,0 +1,26 @@
#include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
int main() {
int a, b, l;
cin >> a >> b >> l;
int ansa = l, ansb = 1;
for (int i = 1; i <= l; i++) {
for (int j = 1; j <= l; j++) {
if (gcd(i, j) == 1 && i * b >= j * a && i * ansb < j * ansa) {
ansa = i;
ansb = j;
}
}
}
cout << ansa << ' ' << ansb << endl;
return 0;
}