<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[天下有码]]></title><description><![CDATA[伪装的 ACMer]]></description><link>https://blog.youkuaiyun.com/liaojch</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; liaojch]]></copyright><item><title><![CDATA[Ural - 1753  Bookshelf]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/31086165</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/31086165</guid><author>liaojch</author><pubDate>Tue, 17 Jun 2014 00:03:24 +0800</pubDate><description><![CDATA[链接：http://acm.timus.ru/problem.aspx?space=1&num=1753]]></description><category></category></item><item><title><![CDATA[POJ - 3273 Monthly Expense]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/31069785</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/31069785</guid><author>liaojch</author><pubDate>Sun, 15 Jun 2014 23:10:58 +0800</pubDate><description><![CDATA[链接：POJ  - 3273
    题意：]]></description><category></category></item><item><title><![CDATA[Ural - 1196  History Exam]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/28424793</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/28424793</guid><author>liaojch</author><pubDate>Wed, 04 Jun 2014 15:58:33 +0800</pubDate><description><![CDATA[链接：Ural - 1196
    题意：]]></description><category></category></item><item><title><![CDATA[Ural 1760 Infernal Work]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/28269757</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/28269757</guid><author>liaojch</author><pubDate>Wed, 04 Jun 2014 15:45:05 +0800</pubDate><description><![CDATA[题意：这道题题意很难理解，大体的意思是给三个数， a, b, n, 有两个人，第一个人把这 n 个数按顺序写在一页页纸上，每页纸写 a 个数，第二个人每页纸写 b 个数，然后要求判断有多少对数（x,y），x 和 y 对于第一个人来说是在同一页纸上的，但对于第二个人来说是在不同页上的。
思路：
设第一个人的每一页第一个数为 i ，i 在第二个人的页数为 x，那么从 A（第一个人）每一页的第二个数]]></description><category></category></item><item><title><![CDATA[URAL  1152  False Mirrors]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/27231245</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/27231245</guid><author>liaojch</author><pubDate>Wed, 04 Jun 2014 15:42:32 +0800</pubDate><description><![CDATA[链接： URAL  1152
    题意：有 n 个阳台（暂且这么看吧...)把英雄包围zai]]></description><category></category></item><item><title><![CDATA[URAL  1005  Stone Pile]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/27232953</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/27232953</guid><author>liaojch</author><pubDate>Tue, 27 May 2014 21:06:10 +0800</pubDate><description><![CDATA[链接： 
URAL  1005
    题意：]]></description><category></category></item><item><title><![CDATA[URAL  1792  Hamming Code]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/27232149</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/27232149</guid><author>liaojch</author><pubDate>Tue, 27 May 2014 20:50:21 +0800</pubDate><description><![CDATA[链接：URAL 1792 
    题意：]]></description><category></category></item><item><title><![CDATA[POJ  1125  Stockbroker Grapevine]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/27230791</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/27230791</guid><author>liaojch</author><pubDate>Tue, 27 May 2014 20:20:06 +0800</pubDate><description><![CDATA[链接： 
POJ  1125
    题意：]]></description><category></category></item><item><title><![CDATA[POJ  2342   URAL  1039  Anniversary Party]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/27229895</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/27229895</guid><author>liaojch</author><pubDate>Tue, 27 May 2014 19:55:16 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 

using namespace std;

#define maxn 6003

class node
{
public:
	int num,rate,fa,k;
	vector child;
}person[maxn];

int n,real_root,root[maxn],dp[maxn][]]></description><category></category></item><item><title><![CDATA[SOJ - 1002  POJ - 2034  Anti-prime Sequences]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/26060051</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/26060051</guid><author>liaojch</author><pubDate>Sun, 25 May 2014 16:11:20 +0800</pubDate><description><![CDATA[链接：SOJ - 1002    POJ --]]></description><category></category></item><item><title><![CDATA[POJ - 1860   URAL - 1162  Currency Exchange]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/26962819</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/26962819</guid><author>liaojch</author><pubDate>Sun, 25 May 2014 15:53:43 +0800</pubDate><description><![CDATA[链接： POJ - 1860   URAL - 1162  Currency Exchange

题目大意：题目是说给出几种货币的兑换比率和兑换手续费，现有其中一种货币 s ，其数量为 v ,问能不能经过一些兑换之后换到更多货币s，即兑换后数量大于 v。货币兑换的计算为：（当前货币 – 手续费）X 兑换率。注意 A 到 B 和 B 到 A 间的兑换比率和手续费是不同的。
可以看一下输入数据，]]></description><category></category></item><item><title><![CDATA[POJ  3259 Wormholes]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/26961821</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/26961821</guid><author>liaojch</author><pubDate>Sun, 25 May 2014 15:44:44 +0800</pubDate><description><![CDATA[链接： POJ 3259  Wormholes
                 Ural]]></description><category></category></item><item><title><![CDATA[POJ  2387 Til the Cows Come Home]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/26961509</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/26961509</guid><author>liaojch</author><pubDate>Sun, 25 May 2014 15:27:21 +0800</pubDate><description><![CDATA[链接：




#include 
#include 
#include 
#include 

using namespace std;

#define INF 0x3f3f3f3f
#define MAXN 1003

struct node{
    int x,y;
    int d;
    node(int str1,int str2,int dis){
        ]]></description><category></category></item><item><title><![CDATA[URAL 1755 Cake]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/26008449</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/26008449</guid><author>liaojch</author><pubDate>Fri, 16 May 2014 21:22:31 +0800</pubDate><description><![CDATA[链接：http://vjudge.net/problem/viewProblem.action?id=24604]]></description><category></category></item><item><title><![CDATA[URAL 1654 Cipher Message]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/26008025</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/26008025</guid><author>liaojch</author><pubDate>Fri, 16 May 2014 20:44:46 +0800</pubDate><description><![CDATA[链接：http://vjudge.net/problem/viewProblem.action?id=13762
    题意：给一串不带空格和标点符号的字符串，其中没有任何连续的相同字母，现在有一个操作，在任意位置插入两个相同字母，执行多次操作后，求原来的字符串是什么。
     解法：用 stack 去写。一开始直接用数组写得很复杂不说还一直错，很容易遗漏特殊情况。



#inc]]></description><category></category></item><item><title><![CDATA[URAL 1320 Graph Decomposition]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/25983043</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/25983043</guid><author>liaojch</author><pubDate>Fri, 16 May 2014 15:37:36 +0800</pubDate><description><![CDATA[链接：http://vjudge.net/problem/viewProblem.action?id=18507

    题意：给一组边，求每次删除相邻的两条边，是否可能把图删完
    解法：简单并查集应用，判断每个连通块的边数是否等于偶数，边的数目等于顶点度数的和的一半，所以偶数边等于顶点度数和对 4 整除。



#include 
#include 
#include 
#]]></description><category></category></item><item><title><![CDATA[URAL 1837 Isenbaev's Number]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/25928895</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/25928895</guid><author>liaojch</author><pubDate>Fri, 16 May 2014 00:44:29 +0800</pubDate><description><![CDATA[链接：http://vjudge.net/problem/viewProblem.action?id=18943]]></description><category></category></item><item><title><![CDATA[POJ  1753 Flip Game]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/25928755</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/25928755</guid><author>liaojch</author><pubDate>Fri, 16 May 2014 00:28:57 +0800</pubDate><description><![CDATA[链接：http://vjudge.net/problem/viewProblem.action?id=16122
    赶时间，参考了别人的代码


#include 
#include 

using namespace std;

int st,map[6][6];
int dir[4][2] = {0,1,0,-1,1,0,-1,0};
bool flag;

void init(]]></description><category></category></item><item><title><![CDATA[URAL 1072 Routing]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/25907981</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/25907981</guid><author>liaojch</author><pubDate>Fri, 16 May 2014 00:17:32 +0800</pubDate><description><![CDATA[好复杂的建图啊！但核心代码只是带路]]></description><category></category></item><item><title><![CDATA[SOJ 1001  Alphacode]]></title><link>https://blog.youkuaiyun.com/liaojch/article/details/25499679</link><guid>https://blog.youkuaiyun.com/liaojch/article/details/25499679</guid><author>liaojch</author><pubDate>Sat, 10 May 2014 18:02:45 +0800</pubDate><description><![CDATA[数据量远远不止 500.


#include 
#include 
#include 

using namespace std;

#define MAXN 10005

int main()
{
	string str;
	int dp[MAXN];
	while(cin>>str && str != "0")
	{
		int len = str.size();
		memset(d]]></description><category></category></item></channel></rss>