- 博客(8)
- 收藏
- 关注
原创 oj.jxust.cn(重识dfs)
1139: 选数时间限制: 1 Sec 内存限制: 128 MB提交: 5 解决: 4[提交][状态][讨论版]题目描述 已知 n 个整数 x1,x2,…,xn,以及一个整数 k(k<n)。从 n 个整数中任选 k 个整数相加,可分别得到一系列的和。例如当 n=4,k=3,4 个整数分别为 3,7,12,19 时,可得全部的组合与它们的和为:3+7+12=
2015-04-28 14:34:06 1360
原创 HDU 1372(只是复习一下BFS)
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7948 Accepted Submission(s): 4688Problem DescriptionA friend of y
2015-04-23 21:25:59 382
原创 HDU 3666 (差分约束)
THE MATRIX PROBLEMTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7370 Accepted Submission(s): 1881Problem DescriptionYou hav
2015-04-21 21:12:18 527
原创 BestCoder Round #38 ($) —— A
Four Inages StrategyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 532 Accepted Submission(s): 217Problem DescriptionYoung F
2015-04-19 21:23:15 572
原创 HDU 1531(差分约束)
KingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1158 Accepted Submission(s): 526Problem DescriptionOnce, in one kingdom,
2015-04-18 11:18:12 627
原创 Codeforces Round #296 (Div. 2) —— C(set/multiset)
C. Glass Carvingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLeonid wants to become a glass carver (the
2015-04-17 16:44:25 646
原创 POJ 2983 (差分约束)
Is the Information Reliable?Time Limit: 3000MS Memory Limit: 131072KTotal Submissions: 11567 Accepted: 3661DescriptionThe galaxy war between the Empire Draco an
2015-04-14 15:03:57 538
原创 POJ 1201 (差分约束)
Language:DefaultIntervalsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22585 Accepted: 8540DescriptionYou are given n closed, integer intervals
2015-04-11 18:11:17 557
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人