C Looooops(扩展欧几里得)
来源:互联网 发布:阿里云dns解析怎么用 编辑:程序博客网 时间:2024/05/16 13:55
C Looooops
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 20128 Accepted: 5405
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
看了题解还是不太懂,有时间去请教一下大神
#include <set>#include <map>#include <list>#include <stack>#include <cmath>#include <queue>#include <string>#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>#include <algorithm>#define PI cos(-1.0)#define RR freopen("input.txt","r",stdin)using namespace std;typedef long long LL;LL ExtendedEuclid(LL a,LL b,LL &x,LL &y){ if(b==0) { x=1; y=0; return a; } LL d=ExtendedEuclid(b,a%b,x,y); LL xt=x; x=y; y=xt-a/b*y; return d;}int main(){ LL A,B,C,K; while(cin>>A>>B>>C>>K) { if(!A&&!B&&!C&&!K) { break; } LL a=C; LL b=B-A; LL n=(LL)1<<K; LL x,y; LL d=ExtendedEuclid(a,n,x,y); if(b%d!=0) { cout<<"FOREVER"<<endl; } else { x=(x*(b/d))%n; x=(x%(n/d)+n/d)%(n/d); cout<<x<<endl; } } return 0;}
- C Looooops(扩展欧几里得)
- C Looooops(扩展欧几里得)
- POJ2115 C Looooops(扩展欧几里得)
- poj2115 C Looooops(扩展欧几里得)
- POJ 2115 C Looooops(扩展欧几里得)
- poj 2115 C Looooops(扩展欧几里得)
- poj-2115 C Looooops(扩展欧几里得)
- poj 2115 C Looooops (扩展欧几里得)
- POJ 2115 C Looooops 扩展欧几里得算法
- poj 2115 C Looooops 扩展欧几里得
- POJ - 2115 - C Looooops (扩展欧几里得)
- POJ 2115 C Looooops(扩展欧几里得)
- POJ 2115 C Looooops(扩展欧几里得)
- poj 2115 C Looooops 【扩展欧几里得】
- 扩展欧几里得模板 poj-C Looooops
- POJ 2115 C Looooops (扩展欧几里得)
- poj 2115 C Looooops (扩展欧几里得算法)
- POJ-2115-C Looooops(扩展欧几里得)
- 2016年阿里巴巴校招笔试题(客户端开发岗位)
- 黑马学习笔记_多线程
- 【机房收费系统】组合查询
- Struts(20)拦截器
- 互联网行业的那些缩写PM,RD,FE,UE,QA,OP,BRD,MRD,PRD,FSD
- C Looooops(扩展欧几里得)
- MySQL 服务不能启动,1067 错误 解决方法
- 阿里巴巴 API对接 refreshToken换取accessToken的实现
- matlab下使用sqlite数据库
- cocoapods的安装问题
- 技术调研
- 递归和递推求阶乘
- 在Windows x64注册OCX/DLL组件
- 解决主机不能访问虚拟机CentOS中的web站点