Problem B

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 6   Accepted Submission(s) : 3

Problem DescriptionA 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.

 InputThe 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.

 OutputThe 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 Input3 3 2 16 3 7 2 167 3 2 163 4 2 160 0 0 0  Sample Output0232766 FOREVER 

 #include<iostream>
 //#include<cstdio>
 using namespace std;
 long long x,y,q;
 void exgcd( long long a,long long b)
 {
     if(b==)
     {
         x=,y=,q=a;
     }
     else
     {
       exgcd(b,a%b);
       long long temp=x;
       x=y,y=temp-a/b*y;
     }
 } int main()
 {
     long long a,b,c,k;
     long long sum;
      while(cin>>a>>b>>c>>k,a+b+c+k)
     {
         //sum=1<<k;
         sum=;
         for(int i=;i<k;i++)
         {
             sum*=;
         }
         exgcd(c,sum);
         q;
         if((b-a)%q)
         {
             cout<<"FOREVER"<<endl;
         }
         else
         {
             long long temp=sum/q;
             cout<<(((b-a)/q*x%temp+temp)%temp)<<endl;
         }
     }
      return ;
 }