poj2115 C Looooops

原创 2018年04月15日 22:22:15
C Looooops
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 30277 Accepted: 8748

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

Source

CTU Open 2004


题解:

A+nC-B=m2^k

nC-m2^k=B-A

exgcd求即可。


代码:

#include<stdio.h>  
#define LL unsigned long long  
void exgcd(LL a,LL b,LL& d,LL& x,LL& y)  
{  
    if(!b){d=a;x=1;y=0;}  
    else  
    {  
        exgcd(b,a%b,d,y,x);  
        y-=x*(a/b);  
    }  
}  
int main()  
{  
    LL A,B,C,k;  
    while(scanf("%llu%llu%llu%llu",&A,&B,&C,&k),(A+B+C+k))  
    {  
        LL a,b,c,d,x,y,dm;  
        c=B-A;  
        if(c==0){printf("0\n");continue;}  
        a=C;  
        b=(LL)1<<k;  
        exgcd(a,b,d,x,y);  
        if(c%d){ printf("FOREVER\n");continue;}  
        dm=b/d;  
        x=(((x*c/d)%dm)+dm)%dm;  
  
        printf("%llu\n",x);  
    }  
    return 0;  
}  

C Looooops(欧几里德+poj2115)

C Looooops Description A Compiler Mystery: We are given a C-language style for loop of type for (va...
  • u010579068
  • u010579068
  • 2015-05-02 17:35:21
  • 1913

POJ 2115 C Looooops 已翻译

描述 编译器之谜:我们给出了一个C语言风格的循环类型
  • woniupengpeng
  • woniupengpeng
  • 2016-12-23 21:59:04
  • 158

欧几里德 poj2115 C Looooops

关于拓展欧几里德,别人已经写的很好的了,我也自己写一下,方便以后自己复习。 其最基础的思想就是 gcd(a,b)=gcd(b,a mod b),其中 gcd的意思是求最大公约数。。 拓展欧几里德是...
  • qq429205464
  • qq429205464
  • 2011-11-11 18:41:45
  • 531

POJ2115:C Looooops(扩展欧几里得)

C Looooops Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 26411   Accepted: 7516...
  • junior19
  • junior19
  • 2017-05-04 18:01:45
  • 100

【POJ2115】C Looooops Ex_gcd

C Looooops Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 30121 Accepted: ...
  • NLt_XXy
  • NLt_XXy
  • 2018-04-06 09:19:54
  • 9

POJ2115 C Looooops(扩展欧几里得)

C Looooops Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 19837   Ac...
  • u013021513
  • u013021513
  • 2015-07-27 21:49:59
  • 237

poj2115 C Looooops (欧几里德)

C Looooops Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 20515   Ac...
  • d_x_d
  • d_x_d
  • 2015-09-23 21:04:04
  • 1130

POJ2115 C Looooops(扩展欧几里得)

C Looooops
  • zzyyyl
  • zzyyyl
  • 2017-11-04 21:53:53
  • 49

POJ2115 C Looooops

线性同余方程
  • a1799342217
  • a1799342217
  • 2017-10-27 15:56:10
  • 362

poj2115 C Looooops(扩展欧几里得)

C Looooops Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 23143   Accepted: 6357...
  • qq_33362864
  • qq_33362864
  • 2016-08-23 15:43:06
  • 247
收藏助手
不良信息举报
您举报文章:poj2115 C Looooops
举报原因:
原因补充:

(最多只允许输入30个字)