HDU 2817 A sequence of numbers (数学+快速幂)
来源:互联网 发布:子宫肌瘤微创手术知乎 编辑:程序博客网 时间:2024/05/18 20:35
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.
Output
Output one line for each test case, that is, the K-th number module (%) 200907.
Sample Input
2
1 2 3 5
1 2 4 5
Sample Output
5
16
Source
2009 Multi-University Training Contest 1 - Host by TJU
题意:
给你数列的前三个数a、b、c,判断这个数列是等差数列还是等比数列,然后求数列的第K个值,,,最后对200907取模,
思路:
先根据前三个数判断数列,再用等差或者等比数列公式求第k个值,,取模需要使用快速幂。。
以下AC代码:
#include<stdio.h>#define mod 200907long long QucikMod(long long a,long long b){ long long temp=1; a=a%mod; while(b>0) { if(b%2==1) temp=(temp*a)%mod; b=b/2; a=(a*a)%mod; } return temp;}int main(){ long long t,a,b,c,q,d,k,sum; scanf("%I64d",&t); while(t--) { scanf("%I64d%I64d%I64d%I64d",&a,&b,&c,&k); if(c-b==b-a) { d=b-a; sum=(a%mod+(k-1)*d%mod)%mod; } else { q=b/a; sum=a*QucikMod(q,k-1)%mod; } printf("%I64d\n",sum); } return 0;}
1 0
- 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——快速幂取模
- HDU 2187 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 5787 K-wolf Number (数位DP)
- JSON 教程
- Javascript实现继承的6种方式
- 用指针实现库函数strncpy strncmp strncat
- hdu 2089(数位DP)
- HDU 2817 A sequence of numbers (数学+快速幂)
- tensorflow example
- CodeForces703B Mishka and trip 数学
- Centos6.5 双网卡配置一个上外网一个接局域网
- 基于jquery的轮播插件操作
- ThreadPoolTaskExecutor线程池
- C#实体类中在数据类型后面添加问号是什么意思
- dp_1
- 数据结构实验之二叉树二:遍历二叉树