zoukankan      html  css  js  c++  java
  • poj-2115-exgcd

    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 32062   Accepted: 9337

    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

     
      在模2^k的意义下,A每次加C,最少加多少次能达到B,输出这个次数。
      易得 A+i*C= B  (mod 2^k)   -->   i*C+j*(2^k) = B - A ,问题转化为求这个方程成立的最小的i值,直接拓欧,坑点是K最大32,不强制LL
    的话会爆。
      
     1 #include<iostream>
     2 #include<cstdio>
     3 using namespace std;
     4 #define LL long long 
     5 #define mp make_pair
     6 #define pb push_back
     7 #define inf 0x3f3f3f3f
     8 void exgcd(LL a,LL b,LL &d,LL &x,LL &y){
     9     if(!b){d=a;x=1;y=0;}
    10     else{exgcd(b,a%b,d,y,x);y-=(a/b)*x;}
    11 }
    12 int main(){
    13     LL A,B,C,K;
    14     while(scanf("%lld%lld%lld%lld",&A,&B,&C,&K)!=EOF){
    15         if(A==0&&B==0&&C==0&&K==0) break;
    16         LL x,y,d;    
    17         LL M=1;
    18         M<<=K;
    19         exgcd(C,M,d,x,y);
    20         if((B-A)%d!=0){
    21             puts("FOREVER");
    22         }
    23         else{
    24             M/=d;
    25             printf("%lld
    ",((x*(B-A)/d)%M+M)%M);
    26         }
    27     }
    28     return 0;
    29 }
  • 相关阅读:
    css3动画
    jquery和js进行添加样式
    网站基本了解
    新闻内容显示样式去除
    网页中常用的js特效
    手机和电脑同时兼容的网站
    使用repeter绑定数据的最高效率的方法
    常识(其他)
    OI暑假集训游记
    动态规划归纳(基础篇)
  • 原文地址:https://www.cnblogs.com/zzqc/p/9476927.html
Copyright © 2011-2022 走看看