NOI库7650 不定方程求解

题目：http://noi.openjudge.cn/math/7650/
分析：扩展欧几里得，详见上一篇博文
代码：

#include <cstdio>
#include <algorithm>
using namespace std;
int ans;
int gcd(int a,int b)
{
    return b==0?a:gcd(b,a%b);
}
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 t=x;
    x=y;
    y=t-(a/b)*y;
    return;
}
int main()
{
    int a,b,c,d,x=1,y=1,x2,y2;
    scanf("%d%d%d",&a,&b,&c);
    d=gcd(a,b);
    if(c%d!=0)
    {
        printf("0");
        return 0;
    }
    exgcd(a,b,x,y);
    //printf("%d %d",x,y);
    x*=c/d;
    y*=c/d;
    if(x<0)
      while(x<0)
      {
        x+=b/d;
        y-=a/d;
      }
    else if(y<0)
      while(y<0)
      {
        x-=b/d;
        y+=a/d;
      }
    x2=x;y2=y;
    while(x2>=0&&y2>=0)
    {
        ans++;
        x2+=b/d;
        y2-=a/d;
    }
    x-=b/d;
    y+=a/d;
    while(x>=0&&y>=0)
    {
        ans++;
        x-=b/d;
        y+=a/d;
    }   
    printf("%d",ans);
    return 0;
}