http://acm.hdu.edu.cn/showproblem.php?pid=2077
每組數據有一個正整數n(1 <= n <= 20),表示有n個盤子。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a[22]={0,1};
void Init(){
for(int i=2;i<=20;i++)
a[i]=3*a[i-1]+1;
}
int main(){
//freopen("input.txt","r",stdin);
int t,n;
scanf("%d",&t);
Init();
while(t--){
scanf("%d",&n);
printf("%d\n",2*a[n-1]+2);
}
return 0;
}
#include <cstdio> #include <cstring> int dp[22][2]; int main() { dp[0][0] = dp[0][1] = 0; for (int i=1; i<=20; i++){ dp[i][0] = 2*dp[i-1][0]+dp[i-1][1]+1; dp[i][1] = dp[i-1][0]+2*dp[i-1][1]+1; } int t, n; scanf("%d",&t); while (t--) { scanf("%d",&n); printf("%d\n",dp[n-1][0]+dp[n-1][1]+2); } return 0; }http://acm.hdu.edu.cn/showproblem.php?pid=2077