![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dfs
文章平均质量分 80
安庆闪耀
这个作者很懒,什么都没留下…
展开
-
hdu 5339 Untitled (dfs)
UntitledTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1294 Accepted Submission(s): 759Problem DescriptionThere is an intege原创 2016-05-02 17:33:31 · 1814 阅读 · 0 评论 -
hdu 5311 Hidden String(dfs)
Hidden StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1801 Accepted Submission(s): 642Problem DescriptionToday is th原创 2016-05-02 17:35:02 · 4041 阅读 · 0 评论 -
hdu 1501 Zipper(dfs或dp)
Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitra原创 2016-03-28 17:05:59 · 423 阅读 · 0 评论 -
hdu 1016 Prime Ring Problem(dfs)
Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime原创 2016-03-28 16:20:17 · 224 阅读 · 0 评论 -
NYOJ 1058 部分和问题(dfs)
部分和问题时间限制:1000 ms | 内存限制:65535 KB 难度:2描述给定整数a1、a2、.......an,判断是否可以从中选出若干数,使它们的和恰好为K。输入首先,n和k,n表示数的个数,k表示数的和。接着一行n个数。(1输出如果和恰好可以为k,输出“YES”,并按输入顺序依次输出是由哪几个数的和组成,否则“NO”样例输入原创 2016-02-29 20:41:17 · 384 阅读 · 0 评论 -
CF 616C The Labyrinth(dfs)
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call原创 2016-01-14 12:50:07 · 905 阅读 · 0 评论 -
hdu 5706 GirlCat(dfs)
GirlCatTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 88 Accepted Submission(s): 71Problem DescriptionAs a cute girl, Kotori原创 2016-06-10 19:02:57 · 632 阅读 · 0 评论