NOIP 2012 D2T1 同余方程

#include<cstdio>
using namespace std;
int x,y;
int gcd(int a,int b){
    if(!b){
        x=1;
        y=0;
        return a;
    }
    int r=gcd(b,a%b);
    int t=x;
    x=y;
    y=t-a/b*y;
    return r;
} 
int main()
{
    int a,b;
    scanf("%d%d",&a,&b);
    gcd(a,b);
    printf("%d",(x+b)%b);
}