专栏首页mlPOJ-----C Looooops

POJ-----C Looooops

C Looooops

Time Limit: 1000MS

Memory Limit: 65536K

Total Submissions: 15282

Accepted: 3893

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

地址: http://poj.org/problem?id=2115

欧几里得扩展

转化的式子为: c*x+d*y=(b-a)mod(d)  d=1LL<<k (题目的意思);

代码:

 1 #include<iostream>
 2 #include<cstdio>
 3 #define LL long long
 4 #include<cstring>
 5 using namespace std;
 6   LL x,y,q;
 7 void  exgcd(LL a, LL b)
 8 {
 9     if(b==0)
10     {
11         x=1,y=0,q=a;
12     }
13     else
14     {
15         exgcd(b,a%b);
16         LL temp=x;
17         x=y,y=temp-a/b*y;
18     }
19 }
20 
21 int main()
22 {
23   LL a,b,c,k;
24   //freopen("test.in","r",stdin);
25   //freopen("test.out","w",stdout);
26   while(scanf("%I64d%I64d%I64d%I64d",&a,&b,&c,&k),a+b+c+k)
27   {
28       LL temp=(LL)1<<k;
29       exgcd(c,temp);
30       if((b-a)%q)
31           printf("FOREVER\n");
32       else
33       {
34           LL t=temp/q;
35           printf("%I64d\n",(x*((b-a)/q)%t+t)%t);
36       }
37   }
38   return 0;
39 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • HDUOJ----2489 Minimal Ratio Tree

    Minimal Ratio Tree Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768...

    Gxjun
  • HDUOJ-----Climbing Worm

    Climbing Worm Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3276...

    Gxjun
  • hdu----(5045)Contest(数位dp)

    Contest Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (J...

    Gxjun
  • Kaggle竞赛:《NIPS 2017 Adversarial Learning Challenges》

    Batch normalization potentially helps in two ways: faster learning and higher ov...

    fishexpert
  • Selenium Webdriver 在当前浏览器 Context 中 执行 JS 脚本。 Execute JavaScript based code using Selenium Webdriver

    In Selenium Webdriver, locators like XPath, CSS, etc. are used to identify and p...

    一个会写诗的程序员
  • Understanding a Kernel Oops!

    Understanding a kernel panic and doing the forensics to trace the bug is conside...

    jeff xie
  • js的bind函数那些你可能没想过的点

    加上上一篇文章中说的情况,我们可以总结到,当我们对一个bind返回的函数进行操作时,实际上这种操作是对目标函数的操作,也就是调用bind的函数。下面我们看一下e...

    theanarkh
  • Policy Search in Continuous Action Domains: an Overview

    用户1908973
  • Codefoces 723A The New Year: Meeting Friends

    A. The New Year: Meeting Friends time limit per test:1 second memory limit per t...

    Angel_Kitty
  • 深度单图像处理(CS)

    多年来,由于这项任务的受欢迎程度和商业重要性,图像处理吸引了许多研究。已有许多基于深度神经网络的方法用于许多图像处理任务。深度方法的主要问题是需要训练来自与目标...

    DDDDDaemon

扫码关注云+社区

领取腾讯云代金券