POJ-2115 C Looooops
来源:互联网 发布:创建一个数据库sql语句 编辑:程序博客网 时间:2024/06/07 09:41
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
Source
CTU Open 2004
分析:数论,求乘法逆元。
分析:数论,求乘法逆元。
#include <cstdio>#include <iostream>using namespace std;long long a,b,c,k;long long ex_gcd(long long a,long long b,long long &x,long long &y){if(b == 0){x = 1;y = 0;return a;} long long d = ex_gcd(b,a % b,x,y);long long temp = x;x = y;y = temp - a/b*y;return d;}int main(){cin.sync_with_stdio(false);while(cin>>a>>b>>c>>k){if(a == 0 && b == 0 && c == 0 && k == 0) break;long long x,y;long long d = ex_gcd(c,1ll << k,x,y);if((b-a) % d) cout<<"FOREVER"<<endl;else{long long ans = (b-a)/d * x % (1ll << k) + (1ll << k);cout<<ans % ((1ll << k)/d)<<endl;}}}
0 1
- 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
- POJ 2115 C Looooops
- POJ 2115--C Looooops
- 游览器及游览器内核
- Java ,从char 和 Character到内存分配
- 关于read与readLine方法的差别,留给初学java的童鞋的,周六会更新详细解析
- [线段树] [树状数组] [Vijos P1512] SuperBrother打鼹鼠 (mole)
- Android在非UI线程中显示Toast
- POJ-2115 C Looooops
- 入驻今日头条
- 抽象类和接口
- 删除重复数据 mssql2008r2
- HTML解析原理
- 设计模式之Iterator(三)
- 利用WebBrowser控件实现百度自动搜索
- 自适应电脑、手机和iPad的网页设计方法
- iOS开发小结 - AppStore App申请审核加速