poj2115
来源:互联网 发布:2018年网络有线电视 编辑:程序博客网 时间:2024/06/06 00:42
C Looooops
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
扩展欧几里德。设循环了x次,则c*x%2^k=b-a,化为欧几里德方程,c*x-2^k*y=b-a。
代码如下:
#include<stdio.h>#include<math.h>long long x;long long y;int ex_gcd(long long a, long long b) { if (!b) { x = 1; y = 0; return a; } long long r = ex_gcd(b, a % b); long long tmp = x; x = y; y = tmp - a / b*y; return r;}int main(void) { long long a, b, c, k; while (scanf("%lld%lld%lld%lld", &a, &b, &c, &k), a + b + c + k) { k = (long long) 1 << k; long long gcd = ex_gcd(c, k); if ((b - a) % gcd) printf("FOREVER\n"); else { x = ((x * (b - a) / gcd) % (k / gcd)+(k / gcd)) % (k / gcd); printf("%lld\n", x); } } return 0;}
- poj2115
- poj2115
- poj2115
- poj2115
- poj2115
- poj2115
- poj2115
- 欧几里德 poj2115 C Looooops
- POJ2115 C Looooops
- POJ2115 扩展欧几里得
- poj2115 Looooops 扩展欧几里德
- poj2115(扩展欧几里得运用)
- poj2115 同余方程
- POJ2115(数论)
- poj2115(扩展欧几里得)
- POJ2115-C Looooops
- [POJ2115] C Looooops
- #POJ2115# C Looooops
- 电子工程师的《道德经》《生意经》《处世经》
- 开机报警声音
- flex olapdatagrid NaN 问题
- inotify -- Linux 2.6 内核中的文件系统变化通知机制
- 响应式网页设计需要考虑的5大预算因素
- poj2115
- Java程序员应该了解的10个面向对象设计原则
- LWA_COLORKEY undeclared identifier 的解决办法
- 一个改进的logger类
- 输出缓冲区的管理
- Ubuntu清空回收站
- INFOCOM
- 每天工作4小时的程序员
- 富士康行政总裁辞职