C++ 矩形大小计算 - 算法题解

#include using namespace std;

int main() { int R, B; cin >> R >> B;

int L = 1;
int W = 1;
int sum = R + B;

for (int i = 2; i <= sum; i++) {
    if (sum % i == 0) {
        int j = sum / i;
        if ((i - 2) * (j - 2) == B) {
            L = max(i, j);
            W = min(i, j);
            break;
        }
    }
}

cout << L << ' ' << W << endl;

return 0;

}