Processing math: 100%
编程介的小学生 2017-10-23 23:11 采纳率: 0.4%
浏览 834
已采纳

Recursive Sequence

问题描述 :

Given two integers N and M, we define a recursive sequence gi as follows:
(1) If 0 <= i < M, then g[i] = ai 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.
输出:

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.
样例输入:

2

1 5
1
2

2 7
0 1
1 1
样例输出:

32
13

  • 写回答

1条回答 默认 最新

  • threenewbee 2017-11-06 06:02
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
编辑
预览

报告相同问题?

悬赏问题

  • ¥15 PADS Logic 原理图
  • ¥15 PADS Logic 图标
  • ¥15 电脑和power bi环境都是英文如何将日期层次结构转换成英文
  • ¥20 气象站点数据求取中~
  • ¥15 如何获取APP内弹出的网址链接
  • ¥15 wifi 图标不见了 不知道怎么办 上不了网 变成小地球了
手机看
程序员都在用的中文IT技术交流社区

程序员都在用的中文IT技术交流社区

专业的中文 IT 技术社区,与千万技术人共成长

专业的中文 IT 技术社区,与千万技术人共成长

关注【CSDN】视频号,行业资讯、技术分享精彩不断,直播好礼送不停!

关注【CSDN】视频号,行业资讯、技术分享精彩不断,直播好礼送不停!

客服 返回
顶部