码迷,mamicode.com
首页 >  
搜索关键字:university    ( 1239个结果
HDU 6069 Counting Divisors —— 2017 Multi-University Training 4
Counting Divisors Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 2599 Accepted Submission(s): ...
分类:其他好文   时间:2017-08-05 20:27:33    阅读次数:166
HDU 6040 Hints of sd0061 nth_element函数
Hints of sd0061 Problem Description sd0061, the legend of Beihang University ACM-ICPC Team, retired last year leaving a group of noobs. Noobs have no ...
分类:其他好文   时间:2017-08-05 11:07:54    阅读次数:166
C——Network Saboteur (POJ2531)
题目: A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided th ...
分类:Web程序   时间:2017-08-04 22:44:55    阅读次数:261
HDU 6049 - Sdjpx Is Happy | 2017 Multi-University Training Contest 2
思路来源于 FXXL - - 一个比较奇怪的地方就是第三步可以不做,也就是ans至少为1,听说场内有提问的,然后 admin 说可以不做- - (wa的我心烦) ...
分类:移动开发   时间:2017-08-02 00:35:05    阅读次数:224
HDU 6040 Hints of sd0061 —— 2017 Multi-University Training 1
Hints of sd0061 Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2297 Accepted Submission(s): 68 ...
分类:其他好文   时间:2017-07-31 23:01:46    阅读次数:284
HDU 6050 Funny Function —— 2017 Multi-University Training 2
Funny Function Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1213 Accepted Submission(s): 594 P ...
分类:其他好文   时间:2017-07-31 22:53:36    阅读次数:148
第一场 B Hints of sd0061
sd0061, the legend of Beihang University ACM-ICPC Team, retired last year leaving a group of noobs. Noobs have no idea how to deal with mm coming cont ...
分类:其他好文   时间:2017-07-31 13:26:44    阅读次数:178
CSU 1974: 神奇药水
Description 对于csuxushu来说,能够在CSU(California State University)组织2017年的ACM暑期集训让他感到十分荣幸。 csuxushu是一名充满梦想的程序员,因此他也希望来参加暑期集训的ACM萌新们和他一样怀揣着书写CSU-ACM历史的梦想。 一个 ...
分类:其他好文   时间:2017-07-29 18:52:39    阅读次数:272
hdu 6049 - Sdjpx Is Happy
题: OwO http://acm.hdu.edu.cn/showproblem.php?pid=6049 (2017 Multi-University Training Contest - Team 2 - 1005) 解: 先预处理 mn[i][j]记录区间最小值,mx[i][j]记录区间最大值 ...
分类:移动开发   时间:2017-07-29 00:54:43    阅读次数:204
Network Saboteur (DFS暴力枚举)
A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the ne ...
分类:Web程序   时间:2017-07-27 10:37:00    阅读次数:344
1239条   上一页 1 ... 65 66 67 68 69 ... 124 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!