POJ 2215 扩展欧几里得

最新推荐文章于 2022-06-19 19:02:02 发布

原创最新推荐文章于 2022-06-19 19:02:02 发布 · 509 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

——————数学—————— 同时被 2 个专栏收录

13 篇文章

订阅专栏

>欧几里德&&扩展欧几里德<

7 篇文章

订阅专栏

本文介绍了一种计算特定C语言循环执行次数的方法，该循环基于给定的起始值、终止条件和步长进行迭代，同时考虑了k位无符号整数运算的特点。

POJ 2115

E - E

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu

Submit Status

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 < 2 ^k) modulo 2 ^k.

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 < 2 ^k) 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

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
using namespace std;

const long long mod=9973;
long long gcd(long long a,long long b){
    if(!b) return a;
    return gcd(b,a%b);
}

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