<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[forseer2000的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/forseer2000</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; forseer2000]]></copyright><item><title><![CDATA[linux安装问题 this environment is externally managed]]></title><link>https://blog.youkuaiyun.com/forseer2000/article/details/140642609</link><guid>https://blog.youkuaiyun.com/forseer2000/article/details/140642609</guid><author>forseer2000</author><pubDate>Tue, 23 Jul 2024 17:57:42 +0800</pubDate><description><![CDATA[解决方法：安装venv，在虚拟环境中安装包，且安装的时候不用sudo。]]></description><category></category></item><item><title><![CDATA[POJ 3979 && NOI.openjudge 2424 Tiling a grid with dominoes(递推/递归)]]></title><link>https://blog.youkuaiyun.com/forseer2000/article/details/53190469</link><guid>https://blog.youkuaiyun.com/forseer2000/article/details/53190469</guid><author>forseer2000</author><pubDate>Wed, 16 Nov 2016 19:29:52 +0800</pubDate><description><![CDATA[/*************************************By HZGZy*********************************/

用f[i]表示铺满4行i列的方案数
我们从最后两行开始讨论
用相同的2个数字表示一个骨牌
1.
①
①
②
②
此时是f[i-1]
2.
①①
②②
③③
④④
此时是f[i-2]
3.
①①
②②]]></description><category></category></item></channel></rss>