当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
6755：Fibonacci Sum
题目描述
The Fibonacci numbers are defined as below:
Given three integers N, C and K, calculate the following summation:
Since the answer can be huge, output it modulo 1000000009 ($10^9$+9).
Given three integers N, C and K, calculate the following summation:
Since the answer can be huge, output it modulo 1000000009 ($10^9$+9).
输入解释
The first line contains an integer T (1≤T≤200), denoting the number of test cases. Each test case contains three space separated integers in the order: N, C, K (1≤N,C≤$10^{18}$,1≤K≤$10^5$).
输出解释
For each test case, output a single line containing the answer.
输入样例
2 5 1 1 2 1 2
输出样例
12 2
来自杭电HDUOJ的附加信息
| Recommend | liuyiding |
最后修改于 2020-10-25T23:34:05+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
| 时间上限 | 内存上限 |
| 4000/2000MS(Java/Others) | 524288/524288K(Java/Others) |
登陆或注册以提交代码