C Looooops
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 30121 Accepted: 8698
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
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+xC≡B(mod2k)
A
+
x
C
≡
B
(
mod
2
k
)
,
变一变式子,就可以得到
A+xC−y2k=B
A
+
x
C
−
y
2
k
=
B
再移项得
xC−y2k=B−A
x
C
−
y
2
k
=
B
−
A
然后就可以用扩展欧几里得来求解
x
x
<script type="math/tex" id="MathJax-Element-169">x</script>了
扩展欧几里得详解
代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#define ll long long
ll A,B,C,K,k;
using namespace std;
ll Gcd(ll a,ll b)
{
if(!b) return a;
else return Gcd(b,a%b);
}
void Ex_gcd(ll a,ll b,ll &x,ll &y)
{
if(b==0)
{
x=1;
y=0;
return ;
}
Ex_gcd(b,a%b,y,x);
y-=x*(a/b);
return ;
}
void solve()
{
ll c=B-A;
ll a=C;
ll b=k;
ll x,y;
ll gcd=Gcd(a,b);
if(c%gcd!=0) printf("FOREVER\n");
else
{
a/=gcd,b/=gcd,c/=gcd;
Ex_gcd(a,b,x,y);
// cout<<x<<" ";
x=((x%b*c%b+b)%b);
printf("%lld\n",x);
}
}
int main()
{
// freopen("data.in","r",stdin);
// freopen("B.out","w",stdout);
while(scanf("%lld%lld%lld%lld",&A,&B,&C,&K))
{
k=1LL<<K;
if(A==0&&B==0&&C==0&&K==0) break;
if(A==B) printf("0\n");
else solve();
}
return 0;
}
/*
356 130 290 16
910 754 498 16
3615
7106
*/