POJ2115 C Looooops(扩展欧几里得算法)
来源:互联网 发布:淘宝哪个买正品乔丹 编辑:程序博客网 时间:2024/05/21 06:18
C Looooops
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25936 Accepted: 7346
Description
A Compiler Mystery: We are given a C-language style for loop of type
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.
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.
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 163 7 2 167 3 2 163 4 2 160 0 0 0
Sample Output
0232766FOREVER
思路很简单,先假设可以不会FOREVER的情况,得到方程,形如:ax+by=c,扩展欧几里得算法!!!!
代码如下:
#include <iostream>#include <math.h>using namespace std;long long int gcd(long long int a,long long int b){ return b? gcd(b,a%b):a;}void exgcd(long long int a,long long int b,long long int &x,long long int &y){ if(b == 0) { x = 1; y = 0; return; } long long int x1,y1; exgcd(b,a%b,x1,y1); x = y1; y = x1-(a/b)*y1;}int main(){ long long int a,b,c; int k; long long int m,g,n; long long int tmp,x0,y0; while(cin>>a>>b>>c>>k) { if(a==b&&c==b&&k==c&&a==0) break; m=c; n=1; for(int i=1;i<=k;i++) n=n*2; g=b-a; tmp=gcd(m,n); if(g%tmp!=0) cout<<"FOREVER"<<endl; else { m/=tmp; n/=tmp; g/=tmp; exgcd(m,n,x0,y0); x0=x0*g; x0=(x0%n+n)%n; cout<<x0<<endl; } } return 0;}
0 0
- POJ2115 C Looooops(扩展欧几里得算法)
- POJ2115:C Looooops(扩展欧几里得)
- POJ2115 C Looooops(扩展欧几里得)
- POJ2115 C Looooops(扩展欧几里得)
- poj2115 C Looooops(扩展欧几里得)
- C Looooops poj2115 (扩展欧几里得+模线性方程)
- POJ2115 C Looooops 推广的欧几里得算法
- poj2115--C Looooops(扩展gcd)
- POJ 2115 C Looooops 扩展欧几里得算法
- poj 2115 C Looooops (扩展欧几里得算法)
- poj 2115 C Looooops 扩展欧几里得算法
- POJ 2115 C Looooops (扩展欧几里得算法)
- POJ 2115 C Looooops <扩展欧几里得算法>
- C Looooops(扩展欧几里得)
- C Looooops(扩展欧几里得)
- POJ2115 C Looooops ——模线性方程(扩展gcd)
- C Looooops(欧几里德+poj2115)
- poj2115 C Looooops (欧几里德)
- 【序列】成员资格——in
- HDOJ 3853 LOOPS(DP期望入门)
- Date、String、Calendar类型之间的转换
- 文件下载
- 总结了几个最常用的MyEclipse的快捷键,没掌握的赶快记下了
- POJ2115 C Looooops(扩展欧几里得算法)
- Web前端
- oracle根据身份证更新出生日期(15位与18位身份证都可)
- sql语句拼接
- 几个优化方法
- VS2015 C#6.0 中的那些新特性
- 网络回调
- HashMap 和 Hashtable
- Eclipse控制台输出信息的控制