Nyoj-integer property (Extended Euclidean)

Integer Nature Time Limit: 500 MS | memory limit: 65535 kb difficulty: 1

Description

We know that in mathematics, for any two positive integers A and B, there must be a pair of integers S and T so that SA + TB = gcd (A, B ).

Input

Multiple groups of test data.
Enter two non-negative integers A and B in each group, and a + B> 0 and A is not equal to B.
0 <= A, B <100000.

Output

Output S and T that meet the conditions.

Sample Input

2 43 8737 635

Sample output

1 03 -1193 -224

Code:

#include<stdio.h>void EXGCD(int a,int b,int &x,int &y){if(b==0){x=1;y=0;return ;}    EXGCD(b,a%b,x,y);int tem;tem=x;x=y;y=tem-a/b*y;}int main(){int a,b,x,y;while(~scanf("%d%d",&a,&b)){EXGCD(a,b,x,y);printf("%d %d\n",x,y);}return 0;}

Nyoj-integer property (Extended Euclidean)