<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[abu47643的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/abu47643</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; abu47643]]></copyright><item><title><![CDATA[POJ-2663-Tri Tiling]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434030</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434030</guid><author>abu47643</author><pubDate>Wed, 05 Nov 2014 14:33:00 +0800</pubDate><description><![CDATA[解题报告：
1、subproblems:


2、A(n) = A(n-2) + 2 * B(n-1)


3、B(n) = A(n-1) + D(n-1)


4、D(n) = B(n-1)


4、由此可得：
A(n) = A(n-2) + 2 * B(n-1)
A(n) = 3*A(n-2) + 2 * B(n-3)
A(n) =3*A...]]></description><category></category></item><item><title><![CDATA[UVa-712-S-Trees]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434051</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434051</guid><author>abu47643</author><pubDate>Thu, 23 Oct 2014 13:24:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 2. Data Structures::Binary
 Trees




解题报告：
1、题目太长了，差点失去耐心。：）
2、其实无非就是顺着树走，找到叶子的值，不要被那个函数迷惑。
3、往左走为0，往右走为1。若树的深度为n，则...]]></description><category></category></item><item><title><![CDATA[POJ-1321-棋盘问题]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434028</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434028</guid><author>abu47643</author><pubDate>Sat, 18 Oct 2014 20:22:00 +0800</pubDate><description><![CDATA[解题报告：
1、逐行放置，则仅需考虑列是否冲突。
2、注意在出口处恢复被修改的值。
AC代码：
#include &lt;iostream&gt;
#include &lt;cstring&gt;
using namespace std;

int n, k, ans;
int col[10];
char chess[10][10];

void dfs(int ro...]]></description><category></category></item><item><title><![CDATA[POJ-2488-A Knight's Journey]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434049</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434049</guid><author>abu47643</author><pubDate>Wed, 15 Oct 2014 21:46:00 +0800</pubDate><description><![CDATA[解题报告：



1、DFS遍历，并且记录走过的路径(先数字代替)，不重复地全部走完。

2、需要按照字典序输出，注意方向数组的方向顺序，并且从A1开始搜索。

3、DFS的参数用于记录状态转移量(x,y)和递归的深度(step)。
4、使用全局变量简化程序的设计。
AC代码：
#include &lt;iostream&gt;
#include &lt...]]></description><category></category></item><item><title><![CDATA[UVa-409-Excuses, Excuses!]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434026</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434026</guid><author>abu47643</author><pubDate>Sun, 28 Sep 2014 15:42:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 1. Elementary Problem Solving::String


// 409 - Excuses, Excuses!
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#includ...]]></description><category></category></item><item><title><![CDATA[UVa-674-Coin Change]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434046</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434046</guid><author>abu47643</author><pubDate>Sat, 27 Sep 2014 12:28:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 5. Dynamic Programming


// 674 - Coin Change
#include &lt;iostream&gt;
#include &lt;cstring&gt;
#define MAXN 7500
using nam...]]></description><category></category></item><item><title><![CDATA[UVa-10763-Foreign Exchange]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434044</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434044</guid><author>abu47643</author><pubDate>Thu, 25 Sep 2014 17:09:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 4. Algorithm Design


// 10763 - Foreign Exchange
#include &lt;iostream&gt;
#define MAXN 500000
using namespace std;
int a[M...]]></description><category></category></item><item><title><![CDATA[UVa-10714-Ants]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434023</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434023</guid><author>abu47643</author><pubDate>Thu, 25 Sep 2014 00:05:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 4. Algorithm Design


// 10714 - Ants
#include &lt;iostream&gt;
#include &lt;cstdlib&gt;
using namespace std;
int a[1000001]...]]></description><category></category></item><item><title><![CDATA[UVa-10341-Solve It]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434041</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434041</guid><author>abu47643</author><pubDate>Wed, 24 Sep 2014 22:54:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 4. Algorithm Design


// 10341 - Solve It
#include &lt;cstdio&gt;
#include &lt;cmath&gt;
#define EPS 1e-7						// 精度要求苛刻...
...]]></description><category></category></item><item><title><![CDATA[UVa-133-The Dole Queue]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434038</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434038</guid><author>abu47643</author><pubDate>Thu, 18 Sep 2014 10:19:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 2. Data Structures::Lists


// 133 - The Dole Queue
#include &lt;cstdio&gt;
#include &lt;cstdlib&gt;

typedef struct node
...]]></description><category></category></item><item><title><![CDATA[UVa-11234-Expressions]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434036</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434036</guid><author>abu47643</author><pubDate>Wed, 17 Sep 2014 11:42:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 2. Data Structures::Lists


// 11234 - Expressions
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstdlib&...]]></description><category></category></item><item><title><![CDATA[UVa-10487-Closest Sums]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434034</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434034</guid><author>abu47643</author><pubDate>Sun, 14 Sep 2014 11:42:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 4. Algorithm Design


// 10487 - Closest Sums
#include &lt;iostream&gt;
#include &lt;cstdlib&gt;
using namespace std;
int ma...]]></description><category></category></item><item><title><![CDATA[UVa-10815-Andy's First Dictionary]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434021</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434021</guid><author>abu47643</author><pubDate>Sat, 23 Aug 2014 17:19:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 1. Elementary Problem Solving::String


// 10815 - Andy's First Dictionary
#include &lt;iostream&gt;
#include &lt;cstdio&g...]]></description><category></category></item><item><title><![CDATA[UVa-537-Artificial Intelligence?]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434031</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434031</guid><author>abu47643</author><pubDate>Fri, 22 Aug 2014 17:11:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 1. Elementary Problem Solving::String


// 537 - Artificial Intelligence?
#include &lt;iostream&gt;
#include &lt;cstdio&gt...]]></description><category></category></item><item><title><![CDATA[UVa-10115-Automatic Editing]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434029</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434029</guid><author>abu47643</author><pubDate>Fri, 22 Aug 2014 16:05:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 1. Elementary Problem Solving::String


// 10115 - Automatic Editing
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#in...]]></description><category></category></item><item><title><![CDATA[UVa-10010-Where's Waldorf?]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434027</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434027</guid><author>abu47643</author><pubDate>Fri, 22 Aug 2014 08:49:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 1. Elementary Problem Solving::String


// 10010 - Where's Waldorf?
#include &lt;iostream&gt;
#include &lt;cstring&gt;
#in...]]></description><category></category></item><item><title><![CDATA[UVa-10361-Automatic Poetry]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434025</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434025</guid><author>abu47643</author><pubDate>Thu, 21 Aug 2014 10:47:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 1. Elementary Problem Solving::String


// 10361 - Automatic Poetry
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[UVa-11205-The broken pedometer]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434019</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434019</guid><author>abu47643</author><pubDate>Sun, 17 Aug 2014 15:15:00 +0800</pubDate><description><![CDATA[AOAPC
 I: Beginning Algorithm Contests (Rujia Liu)::Volume
 3. Brute Force::Elementary
 Skills


// 11205 - The broken pedometer
#include &lt;iostream&gt;
#include &lt;cstring&gt;
u...]]></description><category></category></item><item><title><![CDATA[UVa-729-The Hamming Distance Problem]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434022</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434022</guid><author>abu47643</author><pubDate>Sat, 16 Aug 2014 16:18:00 +0800</pubDate><description><![CDATA[AOAPC I: Beginning Algorithm Contests (Rujia Liu)::Volume 3. Brute Force::Elementary Skills


// 729 - The Hamming Distance Problem
#include &lt;iostream&gt;
#include &lt;algorithm&gt;
...]]></description><category></category></item><item><title><![CDATA[UVa-10098-Generating Fast]]></title><link>https://blog.youkuaiyun.com/abu47643/article/details/101434020</link><guid>https://blog.youkuaiyun.com/abu47643/article/details/101434020</guid><author>abu47643</author><pubDate>Sat, 16 Aug 2014 11:51:00 +0800</pubDate><description><![CDATA[AOAPC I: Beginning Algorithm Contests (Rujia Liu)::Volume 3. Brute Force::Elementary Skills



// 10098 - Generating Fast
#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include...]]></description><category></category></item></channel></rss>