C Looooops
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 24339 | Accepted: 6782 |
Description
A Compiler Mystery: We are given a C-language style for loop of type
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.
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.
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
Source
题意:在无符号k进制数下,计算该循环中的+C要执行多少次,或者输出无限次。
for (variable = A; variable != B; variable += C) statement;
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define for0(a, n) for (int (a) = 0; (a) < (n); (a)++)
#define for1(a, n) for (int (a) = 1; (a) <= (n); (a)++)
#define mes(a,x,s) memset(a,x,(s)*sizeof a[0])
#define mem(a,x) memset(a,x,sizeof a)
#define ysk(x) (1<<(x))
typedef long long ll;
typedef pair<int, int> pii;
const int INF =0x3f3f3f3f;
ll A,B,C,K;
ll exgcd(ll a,ll b,ll &X,ll &Y)
{
if(!b)
{
X=1,Y=0;
return a;
}
ll ans=exgcd(b,a%b,X,Y);
ll X1=X,Y1=Y;
X=Y1;
Y=X1-a/b*Y1;
return ans;
}
void solve()
{
ll c=B-A,a=C,b=(ll)1<<K,X,Y;
ll d=exgcd(a,b,X,Y);
if(c%d) {puts("FOREVER");return;}
ll t=b/d;
//if(t<0) t=-t; //一般a、b是整数,所以返回的d也是正数
X= (X*(c/d)%t+t )%t;
printf("%lld\n",X);
}
int main()
{
std::ios::sync_with_stdio(false);
while(cin>>A>>B>>C>>K&&(A+B+C+K)) solve();
return 0;
}