poj 2115 C Looooops 【扩展欧几里得】
来源:互联网 发布:域名后缀biz什么意思 编辑:程序博客网 时间:2024/06/10 15:45
C Looooops
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20702 Accepted: 5596
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
题意:求解最小的y使得 A + C*y = B (mod 1<<k)。
思路:化简等式 (1<<k)*x + y*C = B-A。当且仅当(B-A) % gcd(1<<k, C) == 0才有解。
令temp = (B-A)/gcd(1<<k, C);
化简——(1<<k)*x/temp + y*C/temp = gcd(1<<k, C);
求出x和y,y *= temp。
由扩展欧几里得 定理三——若gcd(a, b) = d,则方程ax ≡ c (mod b)在[0, b/d - 1]上有唯一解。
求解最小的y时,只需对(1<<k) / gcd(1<<k, C)取余即可。
AC代码:
#include <cstdio>#include <cstring>#include <algorithm>#define LL long longusing namespace std;LL A, B, C, k;void exgcd(LL a, LL b, LL &d, LL &x, LL &y){ if(b == 0) {d = a, x = 1, y = 0;} else { exgcd(b, a%b, d, y, x); y -= x * (a / b); }}void solve(){ B -= A; LL d, x, y; LL a = (1LL<<k); exgcd(a, C, d, x, y); if(B % d) printf("FOREVER\n"); else { x *= (B / d); y *= (B / d); y = (y % (a / d) + a / d) % (a / d); printf("%lld\n", y); }}int main(){ while(scanf("%lld%lld%lld%lld", &A, &B, &C, &k) != EOF) { if(A == 0 && B == 0 && C == 0 && k == 0) break; solve(); } return 0;}
0 0
- 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 2115 C Looooops (扩展欧几里得)
- poj 2115 C Looooops (扩展欧几里得算法)
- POJ-2115-C Looooops(扩展欧几里得)
- C Looooops poj 2115 扩展欧几里得
- [poj 2115] C Looooops 扩展欧几里得
- poj 2115 C Looooops (扩展欧几里得)
- 【POJ】2115 - C Looooops(扩展欧几里得)
- poj 2115 C Looooops 扩展欧几里得算法
- OpenLayers 3 之 加载百度地图
- js基础看这里
- JVM指令助记符
- easyui datagrid 使用代码片段记录
- ORACLE数据库优化
- poj 2115 C Looooops 【扩展欧几里得】
- 软件测试1
- 普通代码块,静态代码块和构造代码块
- Introduce Intelligence to Your Security Operations
- hdu 4417 求[l,r]区间内小于v的有多少个
- SpriteBuilder中应用智能精灵集之后提示找不到文件的解决
- 心得
- APK反编译二次打包实例-论坛
- HDU 1695 GCD(欧拉函数+容斥原理)