本文介绍了一种使用矩阵快速幂解决九连环问题的方法。通过递推公式f(n)=f(n-1)+2*f(n-2) + 1，将问题转化为矩阵运算，以求出取下n个环所需的最少操作次数。文中提供了矩阵的初始值，并指出了解决此类问题的经验重要性。
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2842
题目：
Problem Description
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 ring can be taken off or taken on with one step.
If the first k rings are all off and the (k + 1)th ring is on, then the (k + 2)th ring can be taken off or taken on with one step. (0 ≤ k ≤ 7)
Now consider a game with N (N ≤ 1,000,000,000) rings on a bar, Dumbear wants to make all the rings off the bar with least steps. But Dumbear is
The first ring can be taken off or taken on with one step.
If the first k rings are all off and the (k + 1)th ring is on, then the (k + 2)th ring can be taken off or taken on with one step. (0 ≤ k ≤ 7)
Now consider a game with N (N ≤ 1,000,000,000) rings on a bar, Dumbear wants to make all the rings off the bar with least steps. But Dumbear is
最低0.47元/天 解锁文章
350
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
