青蛙的约会 POJ - 1061

最新推荐文章于 2022-04-14 00:39:57 发布

klchen0112

最新推荐文章于 2022-04-14 00:39:57 发布

阅读量86

点赞数

分类专栏： number theory

本文链接：https://blog.csdn.net/weixin_40959045/article/details/88382257

版权

number theory 专栏收录该内容

24 篇文章 0 订阅

订阅专栏

$\mod L = (y+kn) \mod L$

$(x - y) = k (n - m) + * t L$

即是用拓展欧几里得解

    #include<cstdio>
    #include <algorithm>
    using namespace std;
    #define fst first
    #define sec second
    #define sci(num) scanf("%d",&num)
    #define scl(num) scanf("%lld",&num)
    #define mem(a,b) memset(a,b,sizeof a)
    #define cpy(a,b) memcopy(a,b,sizeof b)
    typedef long long LL;
    typedef pair<int,int> P;
    const int MAX_N = 510;
    const int MAX_M = 10000;
    
    LL exgcd(LL a,LL b,LL& X,LL& Y) {
    LL q,temp;
    if (b == 0) {
    X = 1; Y= 0;
    return a;
    } else {
    q = exgcd(b,a % b,X,Y);
    temp = X;
    X = Y;
    Y = temp - (a / b) * Y;
    return q;
    }
    }
    int main() {
    LL x,y,m,n,L;
    scanf("%lld%lld%lld%lld%lld",&x,&y,&m,&n,&L);
    LL a,b;
    if (n < m) {
    swap(n,m);
    swap(x,y);
    }
    LL t = exgcd(n-m,L,a,b);
    if ((x - y) % t != 0) {
    printf("Impossible\n");
    } else {
    a = a * (x - y) / t;
    a = (a % L + L) % L;
    printf("%lld\n",a);
    }
    
    return 0;
    }