HDU - 2817 - A sequence of numbers (快速幂取模!)
来源:互联网 发布:苹果电脑mac怎么下游戏 编辑:程序博客网 时间:2024/05/18 11:17
A sequence of numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3494 Accepted Submission(s): 1073
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
题意:就是给出数列的前三个数,判断是否是等差或是等比,然后算出第k个数,注意算等比时要用快速幂取模(还要注意溢出问题,最好全用long long,我没注意WA了两次%>_<%)
arithmetic or geometric sequences. 等差数列或等比数列
AC代码:
#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <iostream>#include <cstdlib>#define LL long longusing namespace std;const int maxn = 200907;int qmod(LL a, LL q, int m){LL ans = a%maxn;while(m){if(m&1) ans = (ans*q)%maxn;q = ((q%maxn*q%maxn)%maxn);m>>=1;}return (int)(ans%maxn);}int main(){int N, k;LL a, b, c;scanf("%d", &N);while(N--){scanf("%I64d %I64d %I64d %d", &a, &b, &c, &k);if(b-a == c-b){LL cha = b-a;printf("%d\n", (int)( ( (k-3) * cha + c) % maxn) );}else {LL bi = b/a;printf("%d\n", qmod(a, bi, k-1));}}return 0;}
1 1
- HDU - 2817 - A sequence of numbers (快速幂取模!)
- HDU 2817--A sequence of numbers【快速幂取模】
- hdu A sequence of numbers 2817 快速幂取模
- 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
- hdoj 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 (数学+快速幂)
- HDU2817:A sequence of numbers(快速幂取模)
- HDOJ 2817 A sequence of numbers【快速幂取模】
- hdu 2817 A sequence of numbers
- CodeForces 494A Treasure
- Android面试-如何动态改变RelativeLayout中的按钮布局
- uva 10719 Quotient Polynomial
- ANDROID开发之SQLite详解
- DB2 DBA技能要求
- HDU - 2817 - A sequence of numbers (快速幂取模!)
- 树-堆结构练习——合并果子之哈夫曼树
- 第十六周 Problem C:相同的数字
- Word Search
- ubuntu常用命令大全
- php实现文件下载和多文件上传
- 数据挖掘之大数据流处理
- 通过getPropertyValue 取得最终的CSS样式
- python packages管理工具---pip