HDU 2187 A sequence of numbers【快速幂】
来源:互联网 发布:天津医科大学考研知乎 编辑:程序博客网 时间:2024/05/28 23:21
快速幂的求法之总结
题意不是等差就是等比数列
A sequence of numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3983 Accepted Submission(s): 1219
Problem Description
Xinlv wrote some sequences on the paper a long time ago, they might be arithmetic or geometric sequences. The numbers are not very clear now, and only the first three numbers of each sequence are recognizable. Xinlv wants to know some numbers in these sequences, and he needs your help.
Input
The first line contains an integer N, indicting that there are N sequences. Each of the following N lines contain four integers. The first three indicating the first three numbers of the sequence, and the last one is K, indicating that we want to know the K-th numbers of the sequence.
You can assume 0 < K <= 10^9, and the other three numbers are in the range [0, 2^63). All the numbers of the sequences are integers. And the sequences are non-decreasing.
You can assume 0 < K <= 10^9, and the other three numbers are in the range [0, 2^63). All the numbers of the sequences are integers. And the sequences are non-decreasing.
Output
Output one line for each test case, that is, the K-th number module (%) 200907.
Sample Input
21 2 3 51 2 4 5
Sample Output
516
Source
2009 Multi-University Training Contest 1 - Host by TJU
#include<stdio.h>#include<math.h>#define ll __int64#define mod 200907#define N 100ll fun(ll a,ll b){ll s=1;a=a%mod;while(b>0){if(b%2==1)//判断一下b是否为奇数s=(s*a)%mod;//如果是奇数,则多乘一项 b=b/2;a=(a*a)%mod; }return s;}int main(){int s;ll a,b,c,k;scanf("%d",&s);while(s--){scanf("%I64d%I64d%I64d%I64d",&a,&b,&c,&k);ll d;ll ans;if(c-b==b-a){d=b-a;ans=(a+(k-1)*d)%mod;}else if(b/a==c/b){d=b/a;ans=(a*fun(d,k-1))%mod;}printf("%I64d\n",ans);}return 0;}
0 0
- HDU 2187 A sequence of numbers【快速幂】
- hdu 2817 A sequence of numbers (快速求幂)
- hdu 2817 A sequence of numbers (快速幂)
- HDU 2817 A sequence of numbers【水题|快速幂】
- HDU 2817 A sequence of numbers【水题|快速幂】
- 【HDU】2817-A sequence of numbers(快速幂)
- HDU 2817 A sequence of numbers(快速幂)
- HDU 2817 A sequence of numbers [快速幂]
- HDU 2817 A sequence of numbers (数学+快速幂)
- HDU - 2817 - A sequence of numbers (快速幂取模!)
- HDU 2817--A sequence of numbers【快速幂取模】
- hdu 2817 A sequence of numbers(快速幂取余)
- hdu A sequence of numbers 2817 快速幂取模
- hdu 2817 A sequence of numbers——快速幂取模
- A Sequence of Numbers HDU
- A sequence of numbers(快速求幂)
- hdoj 2817 A sequence of numbers 【快速幂】
- HDU2817:A sequence of numbers(快速幂取模)
- 32bit 和 64bit系统的区别
- 《构建高性能web站点》读书随笔目录
- mongodb模糊查询
- MATLAB神经网络编程(五)——BP神经网络的模型结构与学习规则
- mysql优化一
- HDU 2187 A sequence of numbers【快速幂】
- Intersection of Two Linked Lists
- 2、安卓控件 ExitText
- HDU 2191 (多重背包)
- 结构-06. 复数四则运算(15)
- 编写程序,读入未指定个数的整数,判断读入的整数有多少个,读入的负数有多少个
- java socket编程 (转)
- java 编程----显示一个整数的所有最小因子
- Linux一些经典书籍