6395：Sequence

题目描述

Let us define a sequence as below

$$\left\{\begin{eqnarray*}
F_1 &=& A \\
F_2 &=& B \\
F_n &=& C\cdot{}F_{n-2}+D\cdot{}F_{n-1}+\left\lfloor\frac{P}{n}\right\rfloor
\end{eqnarray*}\right.$$

Your job is simple, for each task, you should output $F_n$ module $10^9+7$.

输入解释

The first line has only one integer $T$, indicates the number of tasks.

Then, for the next $T$ lines, each line consists of $6$ integers, $A$ , $B$, $C$, $D$, $P$, $n$.

$1 \leq T \leq 20 \\
0 \leq A, B, C, D \leq 10^9 \\
1 \leq P, n \leq 10^9$

输入样例

2
3 3 2 1 3 5
3 2 2 2 1 4

输出样例

36
24

来自杭电HDUOJ的附加信息

Recommend

chendu

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 2018 Multi-University Training Contest 7

源链接： HDU-6395

最后修改于 2020-10-25T23:30:57+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
4000/2000MS(Java/Others)	262144/262144K(Java/Others)