小灰狼与大白兔的博客

题目链接：点我 Description Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak. Input The input contains exactly one test case. The first line of input contains three p...

题目链接：点我 Description 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, 2...

题目链接：这里写链接内容 先求出式子的前几项 然后这个式子和h的式子是非常像的 得到递推式后就可以用矩阵快速幂了 详细看代码： #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> #inclu...

题目链接：点我 Problem Description Lele now is thinking about a simple function f(x). If x < 10 f(x) = x. If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-10); And ai(0&lt...

题目链接：点我 Problem Description 春天到了, HDU校园里开满了花, 姹紫嫣红, 非常美丽. 葱头是个爱花的人, 看着校花校草竞相开放, 漫步校园, 心情也变得舒畅. 为了多看看这迷人的校园, 葱头决定, 每次上课都走不同的路线去教室, 但是由于时间问题, 每次只能经过k个地方, 比方说, 这次葱头决定经过2个地方, 那他可以先去问鼎广场看看喷泉, 再去教室, 也可以先到...

题目链接：点我 Problem Description Bruce Force has had an interesting idea how to encode strings. The following is the description of how the encoding is done: Let x1,x2,…,xn be the sequence of character...