快速幂/矩阵快速幂
文章平均质量分 77
AcceptedQWQ
一直在前进
展开
-
HDU-1757(矩阵快速幂)
Lele now is thinking about a simple function f(x). If x If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-10); And ai(0Now, I will give a0 ~ a9 and two positive int原创 2017-07-26 20:08:28 · 267 阅读 · 0 评论 -
HDU-1575(矩阵快速幂)
A为一个方阵,则Tr A表示A的迹(就是主对角线上各项的和),现要求Tr(A^k)%9973。 Input数据的第一行是一个T,表示有T组数据。 每组数据的第一行有n(2 0,90,9,表示方阵A的内容。 Output对应每组数据,输出Tr(A^k)%9973。Sample Input22 21 00 13 999999991 2 34 5 67 8原创 2017-07-26 20:12:10 · 288 阅读 · 0 评论 -
HDU-2604(递推+矩阵快速幂)
Queues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our daily life. There are many people lined up at the lunch time. Now we d原创 2017-07-26 20:20:57 · 316 阅读 · 0 评论 -
HDU-2256(矩阵快速幂)
InputThe first line of input gives the number of cases, T. T test cases follow, each on a separate line. Each test case contains one positive integer n. (1 OutputFor each input case, you should ou原创 2017-07-26 20:28:53 · 292 阅读 · 0 评论 -
CodeForces-185A(矩阵快速幂)
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four triangle p原创 2017-07-26 20:36:30 · 425 阅读 · 0 评论 -
HDU-2842(递推+矩阵快速幂)
Dumbear likes to play the Chinese Rings (Baguenaudier). It’s a game played with nine rings on a bar. The rules of this game are very simple: At first, the nine rings are all on the bar. The first ri原创 2017-07-26 20:48:05 · 334 阅读 · 0 评论 -
A - A Math Problem (快速幂)
You are given a positive integer n, please count how many positive integers k satisfy kk≤nkk≤n. InputThere are no more than 50 test cases. Each case only contains a positivse integer n in a原创 2017-09-28 17:48:55 · 269 阅读 · 0 评论