摘要: A. The New Year: Meeting Friends |time limit per test1 second|memory limit per test256 megabytes| | There are three friend living on the straight line 阅读全文
posted @ 2016-10-04 11:04 一骑绝尘去 阅读(264) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 5000MS Memory Limit: 131072K Case Time Limit: 2000MSDescriptionN children are sitting in a circle to play a game. The childr... 阅读全文
posted @ 2016-03-05 16:55 一骑绝尘去 阅读(194) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。 ... 阅读全文
posted @ 2016-03-04 19:54 一骑绝尘去 阅读(209) 评论(0) 推荐(0) 编辑
摘要: time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputAfter observing the res... 阅读全文
posted @ 2016-03-03 15:42 一骑绝尘去 阅读(202) 评论(0) 推荐(0) 编辑
摘要: 贪心的题,从左向右推过去即可#include #include #include #include #include #include #include #include #include #include #include #include #include #include #... 阅读全文
posted @ 2016-03-03 15:20 一骑绝尘去 阅读(133) 评论(0) 推荐(0) 编辑
摘要: 树形Dp的题,根据题意建树。DP[i][0] 表示以i为根节点的树的包含i的时候的所有状态点数的总和Dp[i][1] 表示包含i结点的状态数目对于一个子节点vDp[i][0] = (Dp[v][1]+1)*Dp[i][0]+Dp[v][0]*Dp[i][1]表示子节点的所有状态与i... 阅读全文
posted @ 2016-03-03 15:18 一骑绝尘去 阅读(204) 评论(0) 推荐(0) 编辑
摘要: time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputMr. Santa asks all the ... 阅读全文
posted @ 2016-03-02 20:53 一骑绝尘去 阅读(294) 评论(0) 推荐(0) 编辑
摘要: time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputDante is engaged in a f... 阅读全文
posted @ 2016-03-02 20:48 一骑绝尘去 阅读(284) 评论(0) 推荐(0) 编辑
摘要: You are given an undirected graph G(V, E). Each vertex has a mark which is an integer from the range [0..231 – 1]. Different vertexes may hav... 阅读全文
posted @ 2016-02-26 11:42 一骑绝尘去 阅读(203) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 5 Seconds Memory Limit: 32768 KB Special JudgeNetwork of Byteland consists of n servers, connected by m optical cables. Each ... 阅读全文
posted @ 2016-02-26 09:30 一骑绝尘去 阅读(227) 评论(0) 推荐(0) 编辑
摘要: Time limit: 1.0 second Memory limit: 64 MBIf two people were born one after another with one second difference and one of them is a child,... 阅读全文
posted @ 2016-02-24 14:18 一骑绝尘去 阅读(176) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 1000MS Memory Limit: 65536KSpecial JudgeDescriptionThe City has a number of municipal buildings and a number of fallout shelte... 阅读全文
posted @ 2016-02-24 10:18 一骑绝尘去 阅读(188) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionNPY’s girlfriend blew him out!His hon... 阅读全文
posted @ 2016-02-23 09:58 一骑绝尘去 阅读(284) 评论(0) 推荐(0) 编辑
摘要: Time limit: 1.0 second Memory limit: 64 MBVasya is the beginning mathematician. He decided to make an important contribution to the scienc... 阅读全文
posted @ 2016-02-20 11:29 一骑绝尘去 阅读(132) 评论(0) 推荐(0) 编辑
摘要: Time limit: 0.5 second Memory limit: 64 MBGiven a 2-dimensional array of positive and negative integers, find the sub-rectangle with the l... 阅读全文
posted @ 2016-02-20 08:48 一骑绝尘去 阅读(137) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 1000MS Memory Limit: 131072KDescriptionYou are given a string and supposed to do some string manipulations.InputThe first line... 阅读全文
posted @ 2016-02-18 20:46 一骑绝尘去 阅读(190) 评论(0) 推荐(0) 编辑
摘要: Time limit: 0.5 second Memory limit: 64 MBMany of SKB Kontur programmers like to get to work by Metro because the main office is situated ... 阅读全文
posted @ 2016-02-18 16:54 一骑绝尘去 阅读(137) 评论(0) 推荐(0) 编辑
摘要: Time limit: 1.0 second Memory limit: 64 MBOn the Day of the Flag of Russia a shop-owner decided to decorate the show-window of his shop wi... 阅读全文
posted @ 2016-02-18 16:08 一骑绝尘去 阅读(128) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 1500MS Memory Limit: 131072KDescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the h... 阅读全文
posted @ 2016-02-16 18:26 一骑绝尘去 阅读(158) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 3000MS Memory Limit: 131072KDescriptionThe galaxy war between the Empire Draco and the Commonwealth of Zibu broke out 3 years ... 阅读全文
posted @ 2016-02-16 16:01 一骑绝尘去 阅读(139) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 1000MS Memory Limit: 10000KDescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odysse... 阅读全文
posted @ 2016-02-16 11:07 一骑绝尘去 阅读(114) 评论(0) 推荐(0) 编辑
摘要: time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard outputA long time ago, in a galaxy far far ... 阅读全文
posted @ 2016-02-16 10:48 一骑绝尘去 阅读(137) 评论(0) 推荐(0) 编辑
摘要: time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard outputKolya Gerasimov loves kefir very much... 阅读全文
posted @ 2016-02-15 20:46 一骑绝尘去 阅读(123) 评论(0) 推荐(0) 编辑
摘要: 来源:CSDN 作者:mybelief321无意中看到实验室的朋友使用的vim竟然能在左边显示树形目录,感觉很方便,这样子文件夹有什么文件一目了然。他说是一个插件叫NERDTree,安装执行后的效果如下,不是你想要的效果就别安了。我的系统是Ubuntu12.04,版本不同可能... 阅读全文
posted @ 2016-02-13 16:47 一骑绝尘去 阅读(228) 评论(0) 推荐(0) 编辑
摘要: The Same Game Time Limit: 1000MS Memory Limit: 10000KDescriptionThe game named “Same” is a single person game played on a 10 \Theta 15 boa... 阅读全文
posted @ 2016-01-28 17:36 一骑绝尘去 阅读(361) 评论(0) 推荐(0) 编辑
摘要: Flesch Reading Ease Time Limit: 1000MS Memory Limit: 65536KDescriptionFlesch Reading Ease, a readability test named after its deviser Rudol... 阅读全文
posted @ 2016-01-28 17:29 一骑绝尘去 阅读(468) 评论(0) 推荐(0) 编辑
摘要: kawigiEdit插件可以提高 TopCoder编译,提交效率,可以管理保存每次SRM的代码。kawigiEdit下载地址:http://code.google.com/p/kawigiedit/downloads/list我用C++,以后设置是设置C++的,其他的类似。一、添加... 阅读全文
posted @ 2016-01-28 13:53 一骑绝尘去 阅读(197) 评论(0) 推荐(0) 编辑
摘要: Instant Complexity Time Limit: 1000MS Memory Limit: 10000KDescriptionAnalyzing the run-time complexity of algorithms is an important tool ... 阅读全文
posted @ 2016-01-27 17:50 一骑绝尘去 阅读(189) 评论(0) 推荐(0) 编辑
摘要: Lucky and Good Months by Gregorian Calendar Time Limit: 1000MS Memory Limit: 65536KDescriptionHave you ever wondered why normally an year h... 阅读全文
posted @ 2016-01-27 09:34 一骑绝尘去 阅读(383) 评论(0) 推荐(0) 编辑
摘要: Organize Your Train part II Time Limit: 1000MS Memory Limit: 65536KDescriptionRJ Freight, a Japanese railroad company for freight operation... 阅读全文
posted @ 2016-01-26 20:41 一骑绝尘去 阅读(183) 评论(0) 推荐(0) 编辑
摘要: Instantaneous Transference Time Limit: 5000MS Memory Limit: 65536KDescriptionIt was long ago when we played the game Red Alert. There is a ... 阅读全文
posted @ 2016-01-26 16:16 一骑绝尘去 阅读(207) 评论(0) 推荐(0) 编辑
摘要: XOR and Favorite Number time limit per test: 4 seconds memory limit per test: 256 megabytes input: standard input output: standard ou... 阅读全文
posted @ 2016-01-26 10:38 一骑绝尘去 阅读(206) 评论(0) 推荐(0) 编辑
摘要: Corn Fields Time Limit: 2000MS Memory Limit: 65536KDescriptionFarmer John has purchased a lush new rectangular pasture composed of M by N (... 阅读全文
posted @ 2016-01-25 19:49 一骑绝尘去 阅读(156) 评论(0) 推荐(0) 编辑
摘要: Tarjan算法Tarjan算法是基于dfs算法,每一个强连通分量为搜索树中的一颗子树。搜索时,把当前搜索树中的未处理的结点加入一个栈中,回溯时可以判断栈顶到栈中的结点是不是在同一个强连通分量中。当dfn[u]=low[u]时,以u为根的搜索子树上的所有结点是一个强连通分量,其中d... 阅读全文
posted @ 2016-01-24 17:09 一骑绝尘去 阅读(177) 评论(0) 推荐(0) 编辑
摘要: King’s Quest Time Limit: 15000MS Memory Limit: 65536K Case Time Limit: 2000MS DescriptionOnce upon a time there lived a king and he... 阅读全文
posted @ 2016-01-24 16:44 一骑绝尘去 阅读(142) 评论(0) 推荐(0) 编辑
摘要: Father Christmas flymouse Time Limit: 1000MS Memory Limit: 131072KDescriptionAfter retirement as contestant from WHU ACM Team, flymouse ... 阅读全文
posted @ 2016-01-24 12:03 一骑绝尘去 阅读(205) 评论(0) 推荐(0) 编辑
摘要: Network of Schools Time Limit: 1000MS Memory Limit: 10000KDescriptionA number of schools are connected to a computer network. Agreements... 阅读全文
posted @ 2016-01-23 09:19 一骑绝尘去 阅读(142) 评论(0) 推荐(0) 编辑
摘要: The Bottom of a Graph Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 9759 Accepted: 4053Description We will use the follow... 阅读全文
posted @ 2016-01-22 20:10 一骑绝尘去 阅读(132) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 2000MS Memory Limit: 65536K Description Every cow's dream is to become the most popular cow in the herd. In a herd of ... 阅读全文
posted @ 2016-01-22 17:10 一骑绝尘去 阅读(186) 评论(0) 推荐(0) 编辑
摘要: Going from u to v or from v to u? Time Limit: 2000MS Memory Limit: 65536K Description In order to make their sons brave, Jiaj... 阅读全文
posted @ 2016-01-22 14:37 一骑绝尘去 阅读(353) 评论(0) 推荐(0) 编辑