玩转Floor 和 Ceil (Play with Floor and Ceil,UVa 10673)

#include <iostream>
#include <string.h>
#include <string>
#include <fstream>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
using namespace std;
const double eps = 1e-8;
const double pi=acos(-1.0);
const int INF=0x7fffffff;
unsigned long long uINF = ~0LL;
#define MAXN 1007
#define mod 1000000007
typedef long long LL;
//ax+by=d;
void gcd(LL a,LL b,LL& d,LL& x,LL& y)
{
    if(!b){d=a;x=1;y=0;}
    else {gcd(b,a%b,d,y,x);y-=x*(a/b);}
}
int main()
{
    int T;
    LL x,k;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%lld%lld",&x,&k);
        if(x%k==0)
        printf("0 %lld
",k);
        else printf("%lld %lld
",-x,x);
    }

    return 0;
}

说是扩展gcd 但是实际上任一组整数解即可……也就两种情况……