AcWing 5010. 分寝室
原题链接
简单
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
typedef long long ll;
using namespace std;
const int N = 5e4 + 10;
const int Mod = 998244353;
int main() {
int n0, n1, n;
cin >> n0 >> n1 >> n;
int ans1 = 0, ans2 = 0;
int mi = 100010;
for (int i = 1; i <= n / 2; i++) {
if (n0 % i == 0 && n1 % (n - i) == 0 && n0 != i && n1 != n - i) {
int num = abs(n0 / i - n1 / (n - i));
if (num < mi) {
mi = num;
ans1 = i;
ans2 = n - i;
}
}
else if (n1 % i == 0 && n0 % (n - i) == 0 && n1 != i && n0 != n - i) {
int num = abs(n1 / i - n0 / (n - i));
if (num < mi) {
mi = num;
ans1 = i;
ans2 = n - i;
}
}
}
if (mi == 100010) cout << "No Solution";
else cout << ans1 << " " << ans2;
return 0;
}