UVA10673 - Play with Floor and Ceil

题意：找到p，q符合式子的成立

思路：分别向上取整和向下取整，然后使用扩展欧几里德算法

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>

using namespace std;

int x, y, d;

void gcd(int a, int b, int &d, int &x, int &y) {
    if (!b) {
        d = a;
        x = 1; 
        y = 0;
    }
    else {
        gcd(b, a % b, d, y, x); 
        y -= x * (a / b);
    }
}

int main() {
    int cas;
    scanf("%d", &cas);
    while (cas--) {
        int n, m, a, b;
        scanf("%d %d", &n, &m);
        a = (int)floor(n / (m * 1.0)); 
        b = (int)ceil(n / (m * 1.0)); 
        gcd(a, b, d, x, y);
        int tx = x * (n / d);
        int ty = y * (n / d);
        printf("%d %d\n", tx, ty);
    }
    return 0;
}