<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[coco430的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/coco430</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; coco430]]></copyright><item><title><![CDATA[HDU 1730 - Northcott Game（博弈）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/39377319</link><guid>https://blog.youkuaiyun.com/coco430/article/details/39377319</guid><author>coco430</author><pubDate>Thu, 18 Sep 2014 20:02:08 +0800</pubDate><description><![CDATA[Northcott Game
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2784    Accepted Submission(s): 1208


Problem Description
　　Tom和Jerry正在玩一]]></description><category></category></item><item><title><![CDATA[HDU 1524 - A Chess Game（SG）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/39312873</link><guid>https://blog.youkuaiyun.com/coco430/article/details/39312873</guid><author>coco430</author><pubDate>Tue, 16 Sep 2014 09:34:15 +0800</pubDate><description><![CDATA[A Chess Game
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1407    Accepted Submission(s): 639


Problem Description
Let's design a new]]></description><category></category></item><item><title><![CDATA[HDU 1536 - S-Nim（SG）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/39297445</link><guid>https://blog.youkuaiyun.com/coco430/article/details/39297445</guid><author>coco430</author><pubDate>Mon, 15 Sep 2014 20:28:06 +0800</pubDate><description><![CDATA[S-Nim
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4585    Accepted Submission(s): 1989


Problem Description
Arthur and his sister Ca]]></description><category></category></item><item><title><![CDATA[ZOJ 3529 - A Game Between Alice and Bob（素因子+博弈）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/26599167</link><guid>https://blog.youkuaiyun.com/coco430/article/details/26599167</guid><author>coco430</author><pubDate>Thu, 22 May 2014 16:30:40 +0800</pubDate><description><![CDATA[A Game Between Alice and Bob

Time Limit: 5 Seconds      
Memory Limit: 262144 KB 

Alice and Bob play the following game. A series of numbers is written on the blackboard. Alice and Bob take tur]]></description><category></category></item><item><title><![CDATA[STL部分]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/25913293</link><guid>https://blog.youkuaiyun.com/coco430/article/details/25913293</guid><author>coco430</author><pubDate>Thu, 15 May 2014 20:23:43 +0800</pubDate><description><![CDATA[/*****优先队列结构体重载操作符*****/
bool operator<(const cow& rhs) const  
{  
    return ed>rhs.ed; //可取出右端点最小的。若改成'<'则取出右端点最大的。  
} 

priority_queueque;]]></description><category></category></item><item><title><![CDATA[图论题目]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/24435461</link><guid>https://blog.youkuaiyun.com/coco430/article/details/24435461</guid><author>coco430</author><pubDate>Thu, 24 Apr 2014 20:53:30 +0800</pubDate><description><![CDATA[=============================以下是最小生成树+并查集======================================
【HDU】
1213         How Many Tables            基础并查集★
1272         小希的迷宫            基础并查集★
1325&&poj1308     Is It A ]]></description><category></category></item><item><title><![CDATA[CodeForces 214E - Relay Race（二取方格数）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/21078777</link><guid>https://blog.youkuaiyun.com/coco430/article/details/21078777</guid><author>coco430</author><pubDate>Wed, 12 Mar 2014 10:55:28 +0800</pubDate><description><![CDATA[E. Relay Race

time limit per test
4 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output


Furik and Rubik take part in a relay race. The race wil]]></description><category></category></item><item><title><![CDATA[CodeForces 204B - Little Elephant and Cards]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/21076947</link><guid>https://blog.youkuaiyun.com/coco430/article/details/21076947</guid><author>coco430</author><pubDate>Wed, 12 Mar 2014 10:45:34 +0800</pubDate><description><![CDATA[B. Little Elephant and Cards

time limit per test
2 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output


The Little Elephant loves to play with c]]></description><category></category></item><item><title><![CDATA[杂记]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/19933533</link><guid>https://blog.youkuaiyun.com/coco430/article/details/19933533</guid><author>coco430</author><pubDate>Tue, 25 Feb 2014 21:26:00 +0800</pubDate><description><![CDATA[稀疏图适合用邻接表，效率和边数量有关；密集图适合用邻接矩阵]]></description><category></category></item><item><title><![CDATA[POJ 3253 - Fence Repair（贪心）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/18240141</link><guid>https://blog.youkuaiyun.com/coco430/article/details/18240141</guid><author>coco430</author><pubDate>Tue, 14 Jan 2014 00:01:47 +0800</pubDate><description><![CDATA[Fence Repair




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 21562
 
Accepted: 6886





Description

Farmer John wants to repair a small length of the fence aro]]></description><category></category></item><item><title><![CDATA[POJ 3617 - Best Cow Line（贪心）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/18237119</link><guid>https://blog.youkuaiyun.com/coco430/article/details/18237119</guid><author>coco430</author><pubDate>Mon, 13 Jan 2014 22:57:01 +0800</pubDate><description><![CDATA[Best Cow Line




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 7377
 
Accepted: 2322





Description

FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annua]]></description><category></category></item><item><title><![CDATA[POJ 3190 - Stall Reservations（贪心）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/18219813</link><guid>https://blog.youkuaiyun.com/coco430/article/details/18219813</guid><author>coco430</author><pubDate>Mon, 13 Jan 2014 14:07:59 +0800</pubDate><description><![CDATA[Stall Reservations




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 2278
 
Accepted: 811
 
Special Judge





Description

Oh those picky N (1 <= N <= 50,000) c]]></description><category></category></item><item><title><![CDATA[POJ 1328 - Radar Installation（贪心）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/18219559</link><guid>https://blog.youkuaiyun.com/coco430/article/details/18219559</guid><author>coco430</author><pubDate>Mon, 13 Jan 2014 13:45:26 +0800</pubDate><description><![CDATA[Radar Installation




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 45932
 
Accepted: 10256





Description

Assume the coasting is an infinite straight line. La]]></description><category></category></item><item><title><![CDATA[POJ 2376 - Cleaning Shifts（贪心）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/18219085</link><guid>https://blog.youkuaiyun.com/coco430/article/details/18219085</guid><author>coco430</author><pubDate>Mon, 13 Jan 2014 13:23:48 +0800</pubDate><description><![CDATA[Cleaning Shifts




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 9242
 
Accepted: 2461





Description

Farmer John is assigning some of his N (1 <= N <= 25,000)]]></description><category></category></item><item><title><![CDATA[POJ 2718 - Smallest Difference（穷竭搜索）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/18218107</link><guid>https://blog.youkuaiyun.com/coco430/article/details/18218107</guid><author>coco430</author><pubDate>Mon, 13 Jan 2014 12:55:12 +0800</pubDate><description><![CDATA[Smallest Difference




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 3238
 
Accepted: 910





Description

Given a number of distinct decimal digits, you can for]]></description><category></category></item><item><title><![CDATA[SGU 271 - Book Pile]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/17965851</link><guid>https://blog.youkuaiyun.com/coco430/article/details/17965851</guid><author>coco430</author><pubDate>Tue, 07 Jan 2014 19:15:59 +0800</pubDate><description><![CDATA[271. Book Pile


time limit per test: 0.25 sec.
memory limit per test: 65536 KB

input: standard
output: standard


There is a pile of N books on the table. Two types of operations are perfo]]></description><category></category></item><item><title><![CDATA[SGU 180 - Inversions（逆序数）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/17964873</link><guid>https://blog.youkuaiyun.com/coco430/article/details/17964873</guid><author>coco430</author><pubDate>Tue, 07 Jan 2014 18:46:46 +0800</pubDate><description><![CDATA[180. Inversions


time limit per test: 0.25 sec.
memory limit per test: 4096 KB

input: standard
output: standard




There are N integers (1A[j].


Input

The first line of the input]]></description><category></category></item><item><title><![CDATA[POJ 1502 - MPI Maelstrom（单源最短路）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/17122997</link><guid>https://blog.youkuaiyun.com/coco430/article/details/17122997</guid><author>coco430</author><pubDate>Wed, 04 Dec 2013 18:18:05 +0800</pubDate><description><![CDATA[MPI Maelstrom




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 4531
 
Accepted: 2744





Description

BIT has recently taken delivery of their new supercomputer,]]></description><category></category></item><item><title><![CDATA[HDU 2647 - Reward（拓扑排序）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/12291489</link><guid>https://blog.youkuaiyun.com/coco430/article/details/12291489</guid><author>coco430</author><pubDate>Fri, 04 Oct 2013 21:41:21 +0800</pubDate><description><![CDATA[Reward
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3001    Accepted Submission(s): 899



Problem Description

Dandelion's uncle is]]></description><category></category></item><item><title><![CDATA[HDU 2923 - Einbahnstrasse（floyd）]]></title><link>https://blog.youkuaiyun.com/coco430/article/details/12291279</link><guid>https://blog.youkuaiyun.com/coco430/article/details/12291279</guid><author>coco430</author><pubDate>Fri, 04 Oct 2013 21:31:11 +0800</pubDate><description><![CDATA[Einbahnstrasse
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1626    Accepted Submission(s): 451



Problem Description

Einbahnstra]]></description><category></category></item></channel></rss>