hdu 【2115】 C Looooops
来源:互联网 发布:振动分析软件 编辑:程序博客网 时间:2024/04/30 14:54
C Looooops
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21796 Accepted: 5959
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 <cmath>#include <cstring>#include <iostream>#include <algorithm>using namespace std;void exgcd(long long a,long long b,long long &d, long long& x, long long& y){ if(b == 0) { x = 1; y = 0; d = a; return ; } exgcd(b, a%b, d, x, y); int temp = x; x = y; y = temp - a/b*y;}int main(){ long long A,B,C,k,x,y,a,b,c,d; while(scanf("%I64d%I64d%I64d%I64d", &A, &B, &C, &k) != EOF) { if(!A && !B && !C && !k) break; a = C; b = 1LL << k; c = B - A; exgcd(a,b,d,x,y); if(c%d) printf("FOREVER\n"); else { long long mod = b/d; x *= (c/d); x = (x%mod + mod)%mod; printf("%I64d\n", x); } } return 0;}
1 0
- hdu 【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
- POJ 3468 A Simple Problem with Integers 【splay树入门题】
- 【poj 2411】Mondriaan's Dream 状态压缩DP
- MyBatis 3 用户指南
- SCOI2016酱油记
- CSS3之弹性盒模型
- hdu 【2115】 C Looooops
- 第六周项目1-分数类的锥形
- jquery跨域ajax访问方法
- 启动weblogic的遇见的一些问题及解决方案(环境为win 10 64位,weblogic 12.2.1)
- vs2013 C1853 编译问题
- android jni编译配置DEBUG or RELEASE 的方法和优先级
- Matlab传统神经网络函数:Newff的使用方法记录
- 利用手机距离感应器来切换扬声器和听筒播放
- 输出正整数的所有分割