- 博客(9)
- 收藏
- 关注
RSS订阅原创 Prim-NYOJ-38-布线问题
布线问题 时间限制：1000 ms | 内存限制：65535 KB 难度：4 描述 南阳理工学院要进行用电线路改造，现在校长要求设计师设计出一种布线方式，该布线方式需要满足以下条件： 1、把所有的楼都供上电。 2、所用电线花费最少 输入 第一行是一个整数n表示有n组测试数据。(n<5) 每组测试数据的第一行是两个整数v,e. v表示学校里楼的总个数(v<=500) 随后的e
2015-11-25 15:10:54
602
原创 DFS-NYOJ-20-吝啬的国度
吝啬的国度 时间限制：1000 ms | 内存限制：65535 KB 难度：3 描述 在一个吝啬的国度里有N个城市，这N个城市间只有N-1条路把这个N个城市连接起来。现在，Tom在第S号城市，他有张该国地图，他想知道如果自己要去参观第T号城市，必须经过的前一个城市是几号城市（假设你不走重复的路）。 输入 第一行输入一个整数M表示测试数据共有M(1<=M<=5)组 每组测试数据的第一
2015-11-24 21:07:39
610
原创 高精度-HDU-1042-N!
N! Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 68606 Accepted Submission(s): 19629Problem Description Given an integer N(0 ≤ N ≤ 10
2015-11-23 18:42:46
544
原创 高精度-HDU-1002-A + B Problem II
A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 281775 Accepted Submission(s): 54238Problem Description I have a very sim
2015-11-23 17:49:19
500
原创 高精度-HDU-1134-Game of Connections
Game of Connections Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3753 Accepted Submission(s): 2164Problem Description This is a small b
2015-11-23 17:34:45
641
原创 数位DP-HDU-3652-B-number
B-numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3537 Accepted Submission(s): 1992Problem Description A wqb-number, or B-number for
2015-11-18 10:35:25
429
原创 数位DP-HDU-3709-Balanced Number
Balanced NumberTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 3143 Accepted Submission(s): 1439Problem Description A balanced number is a
2015-11-14 13:08:52
515
原创 数位DP-POJ-3252-Round Numbers
Round Numbers Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10811 Accepted: 3974 DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scis
2015-11-05 18:57:54
473
原创 数位DP-URAL-1057-Amount of Degrees
Amount of Degrees Time limit: 1.0 second Memory limit: 64 MB Create a code to determine the amount of integers, lying in the set [X;Y] and being a sum of exactly K different integer degrees of B. E
2015-11-03 23:16:50
620
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人