poj 2115 C Looooops
来源:互联网 发布:奥尔加隆 知乎 编辑:程序博客网 时间:2024/05/22 07:46
C Looooops
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21717 Accepted: 5932
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
题解: cx=b-a(mod 2^k) 扩展欧几里德算法 ,poj 很奇怪我刚开始用c++交就WA,用G++交就AC#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#define ll long longusing namespace std;ll a,b,c,k; ll x,y;ll pow(ll x,ll num){ ll t=x,sum=1; while (num) { if (num&1) sum=sum*x; t=t*t; num>>=1; } return sum;}ll gcd(ll x,ll y){ ll r; while (y!=0) { r=x%y; x=y; y=r; } return x;}void exgcd(ll a,ll b){ if (b==0) { x=1; y=0; return ; } exgcd(b,a%b); ll t=y; y=x-(a/b)*y; x=t;}int main(){ scanf("%lld%lld%lld%lld",&a,&b,&c,&k); while (a!=0||b!=0||c!=0||k!=0) { ll p=pow(2,k); b=b-a; a=c; ll t=gcd(a,p); if (b%t) { printf("FOREVER\n"); scanf("%lld%lld%lld%lld",&a,&b,&c,&k); continue; } b/=t; p/=t; a/=t; x=0; y=0; exgcd(a,p); x=((x*b)%p+p)%p; printf("%lld\n",x); scanf("%lld%lld%lld%lld",&a,&b,&c,&k); } 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
- POJ 2115 C Looooops
- POJ 2115--C Looooops
- Android动画原理分析
- ejs 请求路径问题
- poj3080 kmp
- MyBatis的一些资料
- 错误10error LNK1104: 无法打开文件“kernel32.lib”
- poj 2115 C Looooops
- Merge Two Sorted Lists(和并两个从小到大排好序的链表)
- 高质量 Android 开发框架 LoonAndroid 详解
- CUDA 7.5 & cuDNN v4 & tensorflow on Ubuntu 14.04 LTS
- iOS Project bootstrap
- java包package之二
- WebLogic Tomcat WebSphere JBOSS 区别1
- 1141: 百钱百鸡问题
- 笔试总结——数据库篇【持续更新】