python/TangDou/AcWing/SegmentTree/Gorgeous/Test.cpp

#include <iostream>

using namespace std;
int main() {
    int n;
    cin >> n;
    for (int i = 0;; i++)
        for (int j = 0; j <= i; j++) {
            if (i - j == n && i == 4 * j - 30) {
                printf("%d %d\n", i, j);
                exit(0);
            }
        }
    return 0;
}