Problem E:C Looooops（扩展欧几里德）

最新推荐文章于 2021-05-25 14:20:18 发布

sdau20171989

最新推荐文章于 2021-05-25 14:20:18 发布

阅读量232

点赞数

分类专栏：数学——数论例题

本文链接：https://blog.csdn.net/sdau20171989/article/details/81587758

版权

数学——数论例题专栏收录该内容

11 篇文章 0 订阅

订阅专栏

POJ2115http://poj.org/problem?id=2115

扩展欧几里德+根据题意写方程

Description

A Compiler Mystery: We are given a C-language style for loop of type

for (variable = A; variable != B; variable += C)

  statement;

I.e., a loop which starts by setting variable to value A and while variable is not equal to B, repeats statement followed by increasing the variable by C. We want to know how many times does the statement get executed for particular values of A, B and C, assuming that all arithmetics is calculated in a k-bit unsigned integer type (with values 0 <= x < 2k) modulo 2k.

Input

The input consists of several instances. Each instance is described by a single line with four integers A, B, C, k separated by a single space. The integer k (1 <= k <= 32) is the number of bits of the control variable of the loop and A, B, C (0 <= A, B, C < 2k) are the parameters of the loop.

The input is finished by a line containing four zeros.

Output

The output consists of several lines corresponding to the instances on the input. The i-th line contains either the number of executions of the statement in the i-th instance (a single integer number) or the word FOREVER if the loop does not terminate.

Sample Input

Sample Output

0
2
32766
FOREVER

Source Code

#include<iostream>
#include<cmath>
#define ll long long
using namespace std;

ll exgcd(ll a,ll b,ll &x,ll &y)
{
    if(!b)
    {
        x=1;
        y=0;
        return a;
    }
    ll temp;
    ll gcd=exgcd(b,a%b,x,y);
    temp=x;
    x=y;
    y=temp-a/b*y;
    return gcd;
}
int main()
{
    ll A,B,C,k;
    while(cin>>A>>B>>C>>k)
    {
        ll a,b,c;
        if(A==0&&B==0&&C==0&&k==0)break;
        if(B==A){cout<<0<<endl;continue;}
        ll x,y;
        //if(a==0&&b==0&&c==0&&d==0)return 0;
        a=C;
        b=pow(2,k);
        c=B-A;
        ll gcd=exgcd(a,b,x,y);
        if(c%gcd!=0)cout<<"FOREVER"<<endl;
        else
        {
            x*=c/gcd;
            //y*=(b/gcd);
            x=(x%(b/gcd)+b/gcd)%(b/gcd);
            cout<<x<<endl;
        }
    }
    return 0;
}