extended euclidean algorithm 双六问题 2018-2-10

using namespace std;  
int ex_Gcd(int a,int b,int &x,int &y){  
    if(b == 0){  
        x = 1;  
        y = 0;  
        return a;  
    }  
    else{  
        int r = ex_Gcd(b,a%b,x,y);  
        int t = x;  
        x = y;  
        y = t - (a/b)*y;  
        return r;  
    }  
}  
int main(){  
    int a,b,x,y;  
    while(scanf("%d%d",&a,&b)!=EOF){  
        if(ex_Gcd(a,b,x,y)!=1)  
            printf("0\n");  
        else  
            printf("%d\n",abs(x)+abs(y));  
    }  
    return 0;  
}