poj 2663 Tri Tiling(DP)
2013-04-23 09:26
323 查看
题意:给你一个3*n的框框,用2*1的dominoe去填满 问一共有多少种不同的方法以;
思路:我不知道这题算是DP呢还是找公式
f[i] = f[i-2]*4 - f[i-4] i>= 4;
#include <stdio.h>
int main ()
{
int n,f[31]
= {1,0,3,0,11};
for (int i =
4;i <= 30;i ++)
f[i] = f[i - 2]*4 - f[i - 4];
while (scanf
("%d",&n)&&n !=
-1)
printf ("%d\n",f
);
return
0;
}
思路:我不知道这题算是DP呢还是找公式
f[i] = f[i-2]*4 - f[i-4] i>= 4;
#include <stdio.h>
int main ()
{
int n,f[31]
= {1,0,3,0,11};
for (int i =
4;i <= 30;i ++)
f[i] = f[i - 2]*4 - f[i - 4];
while (scanf
("%d",&n)&&n !=
-1)
printf ("%d\n",f
);
return
0;
}
相关文章推荐
- poj&nbsp;1609&nbsp;Tiling&nbsp;Up&nbsp;Blocks(DP)
- poj&nbsp;2948&nbsp;Martian&nbsp;Mining&nbsp;dp
- poj&nbsp;1952&nbsp;BUY&nbsp;LOW,&nbsp;BUY&nbsp;LOWER&nbsp;dp
- poj 2506 Tiling <dp+大数加法>
- poj&nbsp;3280&nbsp;Cheapest&nbsp;Palindrome&nbsp;dp(…
- POJ 2663 Tri Tiling dp 画图找规律
- POj 1159 Palindrome (dp)
- poj&nbsp;3034&nbsp;Whac-a-Mole&nbsp;dp
- poj&nbsp;1080&nbsp;Human&nbsp;Gene&nbsp;Functions&nbsp;dp
- ACM: DP训练好题 动态规划题 poj 1…
- poj&nbsp;3254&nbsp;Corn&nbsp;Fields(状态压缩DP…
- poj&nbsp;2836&nbsp;rectangle&nbsp;dp(动态规划)
- poj&nbsp;3356&nbsp;AGTC&nbsp;dp&nbsp;最短编辑距离
- ACM: 动态规划题 poj 2057 树状DP
- poj&nbsp;2241&nbsp;The&nbsp;Tower&nbsp;of&nbsp;Babylon(DP…
- poj 2663 Tri Tiling dp(矩形填充)
- poj&nbsp;1038&nbsp;动态规划(dp)
- poj 2181_dp
- poj&nbsp;1141&nbsp;Brackets&nbsp;Sequence&nbsp;dp
- ACM: 图论题+记忆DP poj 2662 (边…