poj1061青蛙的约会

启蒙网站

http://www.cnblogs.com/comeon4mydream/archive/2011/07/18/2109060.html

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL e_gcd(LL a,LL b,LL& x, LL& y)
{
	if(!b)
	{
		x=1;
		y=0;
		return a;
	}
	LL ans=e_gcd(b,a%b,x,y);
	LL temp=x;
	x=y;
	y=temp-a/b*y;
	return ans;
}
LL cal(LL a,LL b,LL c)
{
	LL x,y;
	LL gcd=e_gcd(a,b,x,y);
	if(c%gcd!=0)return -1;
	x*=c/gcd;
	b/=gcd;
	if(b<0)b=-b;
	LL ans=x%b;
	if(ans<=0)ans+=b;
	//printf(" %d ",gcb);
	return ans;
}
int main(){
	LL x,y,m,n,L;
	while(scanf("%lld%lld%lld%lld%lld",&x,&y,&m,&n,&L)!=EOF)
	{
		LL ans=cal(m-n,L,y-x);
		if(ans==-1)printf("Impossible\n") ;
		else printf("%lld\n",ans);
	}
	return 0;
} 

#include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
usingnamespace std;

__int64 x,y,a,b,c,d;
__int64 n,m,X,Y,L;

__int64 gcd(__int64 a,__int64 b)
{
    __int64 t,d;
    if(b==0)
    {
        x=1;
        y=0;
        return a;
    }
    d=gcd(b,a%b);
    t=x;
    x=y;
    y=t-(a/b)*y;
    return d;
}

int main()
{
    while(scanf("%I64d%I64d%I64d%I64d%I64d",&X,&Y,&m,&n,&L)==5)
    {
        a=n-m;
        b=L;
        c=X-Y;
        d=gcd(a,b);
        if(c%d!=0)
        {
            printf("Impossible\n");
            continue;
        }
        x=x*(c/d);
        y=y*(c/d);

        /*通解：
        x1=x+b/d*t;
        y1=y-a/d*t;
        t为任意整数
        */
        //找最小的x1，即求x+b/d*t最小，那么只有t为某一个数时才最小
        //显然t必须与x正负相反才有最小，那么就看做x-b/d*t,这个式子的最小值便是t=x/(b/d)时，注意这是整型除法
        __int64 k=x*d/b;
        k=x-k*b/d;
        if(k<0)
            k+=b/d;
        printf("%I64d\n",k);
    }
    return0;
}