
dfs
my_acm
这个作者很懒,什么都没留下…
展开
-
poj 2488
A Knight's Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 30099 Accepted: 10320 Description Background The knight is getting bored of seeing the原创 2014-07-24 22:41:20 · 549 阅读 · 0 评论 -
poj3083
Children of the Candy Corn Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9108 Accepted: 3958 Description The cornfield maze is a popular Halloween treat.原创 2014-05-31 13:04:36 · 988 阅读 · 0 评论 -
poj 2676
Sudoku Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13665 Accepted: 6767 Special Judge Description Sudoku is a very simple task. A square table with原创 2014-08-01 16:31:07 · 707 阅读 · 0 评论 -
poj 1011
Sticks Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 120261 Accepted: 27833 Description George took sticks of the same length and cut them randomly until转载 2014-08-13 20:56:31 · 613 阅读 · 0 评论 -
poj 1724
ROADS Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10844 Accepted: 3994 Description N cities named with numbers 1 ... N are connected with one-way roads原创 2014-08-26 17:05:34 · 596 阅读 · 0 评论 -
poj 3373
Changing Digits Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 2960 Accepted: 952 Description Given two positive integers n and k, you are asked to genera原创 2014-08-16 13:37:39 · 818 阅读 · 0 评论 -
大臣的旅费(树的直径)
问题描述 很久以前,T王国空前繁荣。为了更好地管理国家,王国修建了大量的快速路,用于连接首都和王国内的各大城市。 为节省经费,T国的大臣们经过思考,制定了一套优秀的修建方案,使得任何一个大城市都能从首都直接或者通过其他大城市间接到达。同时,如果不重复经过大城市,从首都到达每个大城市的方案都是唯一的。 J是T国重要大臣,他巡查于各大城市之间,体察民情。所以,从一个城市马不停蹄地原创 2015-02-27 21:35:32 · 709 阅读 · 0 评论