C Looooops poj2115 (扩展欧几里得+模线性方程)

C Looooops

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 25104		Accepted: 7105

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

3 3 2 16
3 7 2 16
7 3 2 16
3 4 2 16
0 0 0 0

Sample Output

0
2
32766
FOREVER

这就是这个题的公式。。。。裸的板子。。。虽然不是很懂数学证明过程。。。
(A+Cx)%2^k=B

(a-b)/c 求得是一个整数 则等价记为 a≡b(mod c)

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

#define LL unsigned long long
///(A+Cx)%2^k=B
///设y
///A+Cx=B+(2^k)y
///Cx-(2^k)y=B-A
///ax-by=c;
///a=C;b=2^k;c=B-A;

///"返回值"为 d x y  扩展欧几里得   先除后乘防止爆炸
LL extend_gcd(LL a,LL b,LL &d, LL &x,LL &y)  
{
	if(b==0)
	{
		d=a;
		x=1;
		y=0;
	}
	else
	{
		extend_gcd(b,a%b,d,y,x);
		y-=a/b*x;
	}
}

int main()
{
	LL A,B,C,k;
	while(cin>>A>>B>>C>>k&&(A+B+C+k))
	{
		LL a,b,c,d,x,y;
		if(B == C)
		{
			cout<<"0"<<endl;
		}
		else
		{
			a=C;
			b=(LL)1<<k;
			c=B-A;
			extend_gcd(a,b,d,x,y);
			if(c%d==0) ///如果c%d == 0则有解
			{
				LL dm=b/d;
				x=(((x*c/d)%dm)+dm)%dm;
				cout<<x<<endl;
			}
			else
			{
				cout<<"FOREVER"<<endl;
			}
		}
	}
	return 0;
}