- 博客(1)
- 收藏
- 关注
原创 Fibonacci Sum HDU - 6755【2020 Multi-University Training Contest 1】斐波那契数列变形+二项式定理
题目: 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 (10910^9109+9). Input The first line contains an integer T (1≤T≤200), denoting t
2020-07-23 15:35:33 276
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人