POJ-2115-C Looooops(扩展欧几里得)
来源:互联网 发布:马士兵大数据视频 编辑:程序博客网 时间:2024/06/10 16:56
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 < 2 k) 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
扩展欧几里得,模板题
#include <cstdio>#include <iostream>typedef long long LL;using namespace std;LL extend_gcd(LL a, LL b, LL &x, LL &y){ if(!b) { x=1,y=0; return a; } LL d=extend_gcd(b,a%b,y,x); y-=a/b*x; return d;}int main(){ LL A,B,C,k; while(cin>>A>>B>>C>>k) { if(!A&&!B&&!C&&!k) break; LL a,b,n,x,y,d; a=C;b=B-A;n=(LL)1<<k; //转为ax=b(mod n) d=extend_gcd(a,n,x,y); if(b%d) cout<<"FOREVER\n"; else{ x=(x*(b/d))%n; //一个解 x=(x%(n/d)+n/d)%(n/d); //最小解 cout<<x<<endl; } } 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 扩展欧几里得
- poj 2115 C Looooops 【扩展欧几里得】
- POJ 2115 C Looooops (扩展欧几里得)
- poj 2115 C Looooops (扩展欧几里得算法)
- C Looooops poj 2115 扩展欧几里得
- [poj 2115] C Looooops 扩展欧几里得
- 正则表达式的学习(二)
- 产品经理的自我管理能力 之 目标管理、知识管理-----产品经理深入浅出课程
- need improve204. Count Primes
- 数据结构--栈
- 28. Implement strStr()
- POJ-2115-C Looooops(扩展欧几里得)
- 判断有向图中是否有环
- 原生js四舍五入,保留2/3位小数
- leetcode 95. Unique Binary Search Trees II | Java最短代码实现
- subline text3快捷键
- 【清华集训2014】mex
- 303. Range Sum Query - Immutable
- POJ 2478-Farey Sequence(欧拉函数)
- 清醒吧拭心!自满的程序员是最菜的!