10673 - Play with Floor and Ceil

描述：欧几里得扩张算法
#include <cstdio>
#include <cmath>
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()
{
//freopen("a.txt","r",stdin);
int n,m,t,a,b,x,y;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
a=floor(n*1.0/m),b=ceil(n*1.0/m);
gcd(a,b,m,x,y);
printf("%d %d\n",x*(n/m),y*(n/m));
}
return 0;
}