C Looooops(扩展欧几里得)
来源:互联网 发布:linux 复制命令 编辑:程序博客网 时间:2024/05/16 14:36
H - C Looooops
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uAppoint description:
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 < 2 k) modulo 2 k.
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 < 2 k) modulo 2 k.
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
题意:for(i=A;i!=B;i+=C){i%(2^k)};问你循环执行几次?
思路:先假设等式成立:(A+x*C)%(2^k)=B
变形(2^k)*y+B=A+C*x ==> C*x+(-(2^k)*y)=B-A;
ax+by=c
#include <iostream>#include <cstdio>#include <cstring>using namespace std;typedef long long ll;ll ex_gcd(ll a,ll b,ll &x,ll &y){if(b==0){ x = 1; y = 0; return a;}ll r = ex_gcd(b,a%b,y,x);y -= x*(a/b);return r;}ll a,b,c,x,y;ll A,B,C,k;int main(){while(~scanf("%lld%lld%lld%lld",&A,&B,&C,&k)&&(A+B+C+k)){a = C;b = (ll)1<<k;//一定要把这里的1转成ll类型,在这里错了无数次。。 c = B-A;if(c==0){printf("0\n");continue;}//特殊情况判断 ll gcd = ex_gcd(a,b,x,y);if(c%gcd!=0){printf("FOREVER\n");continue;}x *= c/gcd;b /= gcd;if(b<0)b=-b;x = x%b;if(x<0)x += b;printf("%lld\n",x);}return 0;}
阅读全文
0 0
- C Looooops(扩展欧几里得)
- C Looooops(扩展欧几里得)
- POJ2115 C Looooops(扩展欧几里得)
- poj2115 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-C Looooops
- POJ 2115 C Looooops (扩展欧几里得)
- poj 2115 C Looooops (扩展欧几里得算法)
- POJ-2115-C Looooops(扩展欧几里得)
- Socket到底是什么?
- 一个页面从输入URL到页面加载显示完成,这个过程都发生什java 基础知识-数组的7种算法(排序、求和、最值、遍历...)么?
- 继承
- 【poj 2299】 Ultra-QuickSort 【Waterloo local 2005.02.05】
- 20171013学习日记 CSS
- C Looooops(扩展欧几里得)
- PAT 1003.我要通过!(20) java
- 线代008 矩阵的运算
- [Tensorflow]1.交叉熵(Cross Entropy)算法实现及应用
- python求素数时间
- 一个页面从输入URL到页面加载显示完成,这个过程都发生什么?
- 如何在linux(ubuntu)下安装字体(给wps安装字体)
- http与文件传输
- halcon基于mlp神经网络分类器的OCR字符识别