当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3735：Recursive Sequence

题目描述
Given two integers N and M, we define a recursive sequence g[i] (indexed from 0) as follows:
(1) If 0 <= i < M, then g[i] = a[i]
(2) If i >= M, then g[i] = b[0]*g[i-M] + b[1]*g[i-M+1] + ... + b[M-1]*g[i-1]
Now your task is very simple: Try to find g[N] mod 1,000,000,003.
输入解释
The first line of input is an integer T (1 <= T <= 10), which is the number of test cases. T cases follow.
For each case, the first line are two integers M(1 <= M <= 1000) and N(M <= N <= 1,000,000,000). Two lines followed, each of which contains exactly M integers. The first M integers are a[0], a[1], ..., a[M-1], and the last M integers are b[0], b[1], ..., b[M-1], where 0 <= a[i], b[i] < 1,000,000,003.
输出解释
For each case, output a single line contain g[N] mod 1,000,000,003.
输入样例 
2

1 5
1
2

2 7
0 1
1 1
输出样例 
32
13

Hint
Sample #0: You can easily find that g[i] = 2^i, so g[5] = 32
Sample #1: g[i] is the i-th fibonacci number, so g[6] = 13
来自杭电HDUOJ的附加信息
Author wywcgs @ HIT & XMU
Recommend notonlysuccess
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 ACMDIY第二届群赛
源链接： HDU-3735
最后修改于 2020-10-25T23:06:31+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
6000/3000MS(Java/Others) 32768/32768K(Java/Others)