![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
递归
coldfresh
那我们开始吧
展开
-
操作格子(线段树)
线段树原创 2017-04-04 13:29:29 · 287 阅读 · 0 评论 -
Blocks (POJ - 3734)(矩阵快速幂)
Panda has received an assignment of painting a line of blocks. Since Panda is such an intelligent boy, he starts to think of a math problem of painting. Suppose there are N blocks in a line and each bl原创 2017-04-29 14:32:06 · 1047 阅读 · 0 评论 -
Fibonacci (POJ - 3070 )(矩阵快速幂)
In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …An alternative fo原创 2017-04-29 14:42:07 · 403 阅读 · 0 评论 -
Different Circle Permutation HDU - 5868(burnside引理+递推+矩阵快速幂+欧拉函数)
You may not know this but it’s a fact that Xinghai Square is Asia’s largest city square. It is located in Dalian and, of course, a landmark of the city. It’s an ideal place for outing any time of the y原创 2017-09-07 13:58:35 · 424 阅读 · 0 评论 -
敌兵布阵 HDU-1166(线段树)
线段树原创 2017-03-30 23:45:57 · 528 阅读 · 0 评论