GESP快**吧 #include<bits/stdc++.h> using namespace std; long long n,a[10010]; int main(){ cin>>n; a[1]=2; a[2]=7; for(int i=3;i<=n;i++){ a[i]=2a[i-1]+2a[i-2]+3; } cout<<a[n]; return 0; }

妙脆角提供 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 变量声明与输入 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 递推 解释： * g[n]代表n个汉诺塔片过两个柱子所需的步数，公式：g[n] = 2 * g[n - 1] + f[n - 1] + 2 * f[n]代表n个汉诺塔片过一个柱子所需的步数，公式：f[n] = 2 * g[n - 1] + 1 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 总的来说这题十分的简单，但是推不出公式你就很麻烦 完整代码如下 —————————————————————————学会了吗？给个关注和赞吧——————————————————————————