hdu2817 A sequence of numbers
来源:互联网 发布:java中md5解密代码 编辑:程序博客网 时间:2024/05/22 15:53
A sequence of numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3267 Accepted Submission(s): 976
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
这是一道快速幂的题目。。。。其实不难,有模版。。
#include<stdio.h>__int64 mod_exp(__int64 a,__int64 b,__int64 c){ __int64 res,t; res=1%c; t=a%c; while(b) { if(b&1) res=res*t%c; t=t*t%c; b>>=1; } return res;}int main(){ __int64 a[3],i,k,d,q,m,n,j; int t; scanf("%d",&t); while(t--) { for(i=0;i<3;i++) { scanf("%I64d",&a[i]); } scanf("%I64d",&k); if((a[0]+a[2])==2*a[1]) { d=a[1]-a[0]; n=(a[0]+(k-1)*d)%200907; printf("%I64d\n",n); } else { q=a[1]/a[0]; m=((a[0]%200907)*mod_exp(q,k-1,200907))%200907; printf("%I64d\n",m); } } return 0;}
0 0
- hdu2817 A sequence of numbers
- hdu2817 A sequence of numbers
- HDU2817 A sequence of numbers
- hdu2817 A sequence of numbers
- HDU2817:A sequence of numbers(快速幂取模)
- hdu2817 A sequence of numbers (a^i mod n)
- hdu2817 A sequence of numbers && hdu1420 Prepared for New Acmer(快速幂取模)
- A sequence of numbers
- A sequence of numbers
- A sequence of numbers
- HDOJ A sequence of numbers
- A Sequence of Numbers HDU
- 3293. A Sequence of Numbers
- A Sequence of Numbers (dp)
- 题目58:A sequence of numbers
- hdu 2817 A sequence of numbers
- HDU 2817 A sequence of numbers
- hdu(2817)A sequence of numbers
- Linux常用命令大全
- Android开发中遇到的各种数组集合学习
- myeclipse中设置字体
- 如何干净的清除Slave同步信息【小技巧】
- 测试一下lvs fullnat的性能(工作记录)
- hdu2817 A sequence of numbers
- SecureCRT学习之道:SecureCRT 常用技巧
- 为基于 x86 的 Android* 游戏选择合适的引擎
- 2014年7月4日,我从百度离职了
- 可伸缩性最佳实践:来自eBay的经验
- FATE - HDU 2159 多重背包
- 数据库的优化tips
- 在mac终端显示git分支
- N皇后位运算代码