hdu 【2115】 C Looooops

最新推荐文章于 2019-10-16 18:15:26 发布

TouchDreamer

最新推荐文章于 2019-10-16 18:15:26 发布

阅读量304

点赞数 1

分类专栏： ACM_POJ 文章标签：数论

本文链接：https://blog.csdn.net/chen_ze_hua/article/details/51136119

版权

ACM_POJ 专栏收录该内容

57 篇文章 0 订阅

订阅专栏

C Looooops

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 21796		Accepted: 5959

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

Source

CTU Open 2004

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

void exgcd(long long a,long long b,long long &d, long long& x, long long& y)
{
    if(b == 0)
    {
        x = 1;
        y = 0;
        d = a;
        return ;
    }
    exgcd(b, a%b, d, x, y);
    int temp = x;
    x = y;
    y = temp - a/b*y;
}

int main()
{
    long long A,B,C,k,x,y,a,b,c,d;
    while(scanf("%I64d%I64d%I64d%I64d", &A, &B, &C, &k) != EOF)
    {
        if(!A && !B && !C && !k) break;
        a = C;
        b = 1LL << k;
        c = B - A;
        exgcd(a,b,d,x,y);
        if(c%d)
            printf("FOREVER\n");
        else
        {
            long long mod = b/d;
            x *= (c/d);
            x = (x%mod + mod)%mod;
            printf("%I64d\n", x);
        }
    }
    return 0;
}