- 博客(3)
- 收藏
- 关注
RSS订阅原创 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
386
原创 hdu 5631 Rikka with Graph(并查集)
Rikka with GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 593 Accepted Submission(s): 274Problem DescriptionAs we know,
2016-02-27 10:55:17
306
原创 codeforces 629C Famil Door and Brackets(dp)
As Famil Door’s birthday is coming, some of his friends (like Gabi) decided to buy a present for him. His friends are going to buy a string consisted of round brackets since Famil Door loves string of
2016-02-26 19:26:42
2009
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人