A：模数的世界 | 2021牛客寒假算法基础集训营3

题目描述
模数的世界：https://ac.nowcoder.com/acm/contest/9983/A

思路

代码

#include 
using namespace std;
#define LL long long
LL a, b, p;
LL gcd(LL x, LL y){
     
    return y == 0 ? x : gcd(y, x % y);
}
int main(){
     
    LL T, x, y, r;
    scanf("%lld", &T);
    while(T--){
     
        scanf("%lld %lld %lld", &a, &b, &p);
        if(a == 0 && b == 0)  x = 0, y = 0, r = 0; 
        else {
     
            x = p - a, y = p - b, r = p -1;
            while(gcd(x, y) != 1) y += p;
            x *= r, y *= r;
        }
        printf("%lld %lld %lld\n", r, x, y);
    }    
    return 0;
}