<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ddn220120的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ddn220120</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ddn220120]]></copyright><item><title><![CDATA[IOS简单的选择器实现UIPickerView（省＋市＋区）]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211244</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211244</guid><author>ddn220120</author><pubDate>Fri, 28 Aug 2015 09:34:00 +0800</pubDate><description><![CDATA[轮子的样式：

area.plist的样式：

1.解析文件
1.1解析省

 1 -(void)ProvinceArray
 2 {
 3     
 4     //获取第一层Dictionary
 5     self.allDic = [[NSDictionary alloc]initWithContentsOfFile:[[NSBundle mainBun...]]></description><category></category></item><item><title><![CDATA[Asteroids（二分图的最大分配）]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211248</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211248</guid><author>ddn220120</author><pubDate>Sat, 07 Sep 2013 19:46:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=3041
~题目~
Asteroids




Time Limit:1000MS

Memory Limit:65536K


Total Submissions:12708

Accepted:6918




Description
Bessie wants...]]></description><category></category></item><item><title><![CDATA[Arbitrage(POJ 2240)]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211242</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211242</guid><author>ddn220120</author><pubDate>Fri, 06 Sep 2013 19:25:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=2240
~题目~
                                                        Arbitrage




Time Limit:1000MS...]]></description><category></category></item><item><title><![CDATA[昂贵的聘礼（POJ1062 Dijkstra）]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211246</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211246</guid><author>ddn220120</author><pubDate>Thu, 15 Aug 2013 17:43:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=1062
昂贵的聘礼




Time Limit:1000MS

Memory Limit:10000K


Total Submissions:32225

Accepted:9151




Description
年轻的探险家来到了一个印第安部落里。在那里他和酋长...]]></description><category></category></item><item><title><![CDATA[Currency Exchange(POJ1860 判正环)]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211235</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211235</guid><author>ddn220120</author><pubDate>Thu, 15 Aug 2013 09:06:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=1860
Sample Input
3 2 1 20.0
1 2 1.00 1.00 1.00 1.00
2 3 1.10 1.00 1.10 1.00

Sample Output
YES
1.Spfa


 1 #include&lt;stdio.h&gt;
 2 #include&lt;st...]]></description><category></category></item><item><title><![CDATA[Wormholes(POJ 3259)]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211245</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211245</guid><author>ddn220120</author><pubDate>Wed, 14 Aug 2013 15:14:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=3259
Sample Input
2
3 3 1
1 2 2
1 3 4
2 3 1
3 1 3
3 2 1
1 2 3
2 3 4
3 1 8
Sample Output
NO
YES
题目：输入农田个数，连通的路数，虫洞的个数。两农田之间连通是双向的，而虫洞是单向的。虫洞有这样的性质：...]]></description><category></category></item><item><title><![CDATA[Children of the Candy Corn(BFS+DFS POJ3083)]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211230</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211230</guid><author>ddn220120</author><pubDate>Tue, 13 Aug 2013 15:35:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=3083
Sample Input
2
8 8
########
#......#
#.####.#
#.####.#
#.####.#
#.####.#
#...#..#
#S#E####
9 5
#########
#.#.#.#.#
S.......E
#.#.#.#.#
####...]]></description><category></category></item><item><title><![CDATA[Robot Motion（POJ 1573 模拟题）]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211243</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211243</guid><author>ddn220120</author><pubDate>Wed, 07 Aug 2013 16:21:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=1573
输入
3 6 5
NEESWE
WWWESS
SNWWWW
4 5 1
SESWE
EESNW
NWEEN
EWSEN
0 0 0
结果
10 step(s) to exit
3 step(s) before a loop of 8 step(s)
输入行数、列数、机器人的位置
...]]></description><category></category></item><item><title><![CDATA[Emag eht htiw Em Pleh（POJ 2993）、Help Me with the Game（POJ 2996）模拟题]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211238</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211238</guid><author>ddn220120</author><pubDate>Wed, 07 Aug 2013 16:10:00 +0800</pubDate><description><![CDATA[Emag eht htiw Em Pleh（POJ 2993）
~题目链接~
http://poj.org/problem?id=2993
输入
White: Ke1,Qd1,Ra1,Rh1,Bc1,Bf1,Nb1,a2,c2,d2,f2,g2,h2,a3,e4
Black: Ke8,Qd8,Ra8,Rh8,Bc8,Ng8,Nc6,a7,b7,c7,d7,e7,f7,h7,h6...]]></description><category></category></item><item><title><![CDATA[Parencodings（POJ 1068）]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211240</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211240</guid><author>ddn220120</author><pubDate>Wed, 07 Aug 2013 16:03:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=1068
输入
2
6
4 5 6 6 6 6
9 
4 6 6 6 6 8 9 9 9
结果
1 1 1 4 5 6
1 1 2 4 5 1 1 3 9
匹配括号
1.输入数据为右括号出现时，前段左括号的个数
2.输出此右括号与左括号匹配时，中间包含几个完整的括号


 1 #includ...]]></description><category></category></item><item><title><![CDATA[Tautology（POJ 3295编译原理）]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211226</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211226</guid><author>ddn220120</author><pubDate>Wed, 07 Aug 2013 15:53:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=3295
输入
ApNp
ApNq
0
结果
tautology
not
1.要把p,q,r,s,t的所有取值都搜索一遍
2.'K' a&amp;b; 'A' a||b; 'N' !a; 'C' !a||b;'E' a==b;
3.如果为永真式，输出tautology；否则 not
...]]></description><category></category></item><item><title><![CDATA[Tiling（POJ 2506 高精度）]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211239</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211239</guid><author>ddn220120</author><pubDate>Wed, 07 Aug 2013 15:37:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=2506
输入
2
8
12
100
200
结果
3
171
2731
845100400152152934331135470251
1071292029505993517027974728227441735014801995855195223534251
递推+高精度  f[n]=f[n-...]]></description><category></category></item><item><title><![CDATA[Ubiquitous Religions(POJ 2524)]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211223</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211223</guid><author>ddn220120</author><pubDate>Wed, 07 Aug 2013 15:33:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=2524
输入
10 9
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
10 4
2 3
4 5
4 8
5 8
0 0
结果
Case 1: 1
Case 2: 7
题目概述
1.输入学生数和调查到的案例，输入案例（同组案例信仰同一宗教），输出信仰...]]></description><category></category></item><item><title><![CDATA[Y2K Accounting Bug（POJ 2586）]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211237</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211237</guid><author>ddn220120</author><pubDate>Wed, 07 Aug 2013 15:18:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=2586
输入
59 237
375 743
200000 849694
2500000 8000000
结果
116
28
300612
Deficit
题目概述
1.每个月要是盈利就盈利 s ；否则，就亏损 p 
2.每连着的五个月必定亏损 12345、23456、 344567……
3...]]></description><category></category></item><item><title><![CDATA[Power of Cryptography(POJ 2109 math )]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211221</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211221</guid><author>ddn220120</author><pubDate>Wed, 07 Aug 2013 15:05:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=2109
输入
2 16
3 27
7 4357186184021382204544
结果
4
3
1234
kn= p，一直k和p,求n。
做完这道题，让我知道了math.h 的强大
1.exp+log

#include&lt;cstdio&gt;
#include&lt;cstdlib...]]></description><category></category></item><item><title><![CDATA[Radar Installation(POJ 1328 贪心)]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211233</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211233</guid><author>ddn220120</author><pubDate>Wed, 07 Aug 2013 14:54:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=1328
输入
3 2
1 2
-3 1
2 1

1 2
0 2

0 0
结果
Case 1: 2
Case 2: 1
1.小岛上的雷达在X轴上有覆盖区域，左点x-sqrt(d*d-y*y)和 右点x+sqrt(d*d-y*y).
2.对左覆盖点就行排序，（区域覆盖问题）。
贪心...]]></description><category></category></item><item><title><![CDATA[The Pilots Brothers' refrigerator(POJ2965枚举)]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211232</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211232</guid><author>ddn220120</author><pubDate>Sun, 04 Aug 2013 15:31:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=2965
输入
-+--
----
----
-+--
结果
6
1 1
1 3
1 4
4 1
4 3
4 4
1.BFS+位运算
自己写了一半天异或的代码，又长又不实用，提交还TLE（此在代码有 已被注释，如果有大牛可以改出来，希望帮助）；后跟人家学了一招，很方便。

#includ...]]></description><category></category></item><item><title><![CDATA[Flip Game（枚举）]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211219</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211219</guid><author>ddn220120</author><pubDate>Fri, 02 Aug 2013 16:53:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=1753
可参考大神题解（位运算）：http://www.cnblogs.com/tanhehe/archive/2013/06/11/3131615.html
                 http://www.cnblogs.com/kuangbin/archive/20...]]></description><category></category></item><item><title><![CDATA[Counterfeit Dollar （枚举）]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211217</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211217</guid><author>ddn220120</author><pubDate>Fri, 02 Aug 2013 16:51:00 +0800</pubDate><description><![CDATA[~题目连接~
http://poj.org/problem?id=1013
输入
1 
ABCD EFGH even 
ABCI EFJK up 
ABIJ EFGH even 
结果
K is the counterfeit coin and it is light. 
even 都为真,标记（为保持好看，标记写成了累加，最后判断是否为0）
up右重左轻,分类累加...]]></description><category></category></item><item><title><![CDATA[Maya Calendar]]></title><link>https://blog.youkuaiyun.com/ddn220120/article/details/102211231</link><guid>https://blog.youkuaiyun.com/ddn220120/article/details/102211231</guid><author>ddn220120</author><pubDate>Fri, 02 Aug 2013 16:50:00 +0800</pubDate><description><![CDATA[~题目链接~
http://poj.org/problem?id=1008&amp;lang=default&amp;change=true
输入
3
10. zac 0
0. pop 0
10. zac 1995
结果
3
3 chuen 0
1 imix 0
9 cimi 2801
注意处理临界点
4. uayet 259
正解是 13 ahau 364...]]></description><category></category></item></channel></rss>