Location:
Search - hdoj
Search list
Description: acm题目免费馅饼 杭州电子科技大学hdoj 1176 实现算法 网址acm.hziee.edu.cn-acm topic free pie Hangzhou University of Electronic Science and Technology 1176 hdoj algorithm website acm.hziee.edu.cn
Platform: |
Size: 877 |
Author: sxb |
Hits:
Description: HDOJ 1047
One of the first users of BIT s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.
``This supercomputer is great, remarked Chip. ``I only wish Timothy were here to see these results. (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.) -HDOJ 1047 One of the first users of BIT's new s upercomputer was Chip Diller. He extended his e xploration of powers of three to go from 0 to 333 and he explored taking various sums of those numbers. `` This supercomputer is great, Chip remarked. `` I only wish Timothy were not here o see these results. (Chip moved to a new apartme nt. once one became available on the third floor of t he Lemon Sky apartments on Third Street.)
Platform: |
Size: 852 |
Author: sxb |
Hits:
Description: HDOJ ACM
input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.-HDOJ ACM input : The input consists of T test cases. The number of test cases) (T is given in the first line of the in put. Each test case begins with a line containin g an integer N, a
Platform: |
Size: 1232 |
Author: sxb |
Hits:
Description: acm HDOJ 1051WoodenSticks
Description:
There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:
(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
Platform: |
Size: 1015 |
Author: sxb |
Hits:
Description: HDOJ
acm.hdu.edu.cn
第10卷的一些题目，有些提供数据，有简单的分析过程
Platform: |
Size: 179697 |
Author: 黄魏 |
Hits:
Description: HDOJ acm 1056HangOver
http://acm.hdu.edu.cn/showproblem.php?pid=1056-HDOJ acm 1056HangOver http :// acm.hdu.edu.cn/showproblem.php pid = 1056
Platform: |
Size: 46080 |
Author: sxb |
Hits:
Description: HDOJ
acm.hdu.edu.cn
第10卷的一些题目，有些提供数据，有简单的分析过程-HDOJacm.hdu.edu.cn Vol.10 some of the topics, and some provide data, has a simple analytical process
Platform: |
Size: 179200 |
Author: 黄魏 |
Hits:
Description: hdoj（杭州电子科技大学） acm题chm格式-chm format title hdoj acm
Platform: |
Size: 5037056 |
Author: hk |
Hits:
Description: HDOJ部分题目程序解答，一共200多题-Topic to answer some of the procedures HDOJ
Platform: |
Size: 1453056 |
Author: myt |
Hits:
Description: 杭电ACM部分代码，HDOJ-1102~1150，只做出了一部分。-Hangzhou Xinhua ACM code part, HDOJ-1102 ~ 1150, made only a part of.
Platform: |
Size: 9216 |
Author: 粮陆 |
Hits:
Description: ACM解题报告
第一题…… …… …… HDOJ 1011 (动态规划+路径拓扑)
第二题………………………… POJ 1007 (排序算法)
第三题………………………… HDOJ 1018 (大数运算)
第四题………………………… POJ 1011 (深度优先搜索)
第五题………………………… POJ 1032 (数学题)
-Report of the First ACM solving problems ... ... ... ... ... ... ... ... ... ... HDOJ 1011 (dynamic programming+ path topology) the second question ... ... ... ... ... ... ... ... ... ... POJ 1007 (sorting algorithms) The third question ... ... ... ... ... ... ... ... ... ... HDOJ 1018 (computation of large numbers) the fourth title ... ... ... ... ... ... ... ... ... ... POJ 1011 (depth-first search) fifth title ... ... ... ... ... ... ... ... ... ... POJ 1032 (math problem)
Platform: |
Size: 70656 |
Author: upwinder |
Hits:
Description: 一些HDOJ的算法题讨论，解题报告，注重分析,很有启发-some components of algorithm
Platform: |
Size: 648192 |
Author: 杨扬 |
Hits:
Description: 杭电OJ（1000-1099） AC 代码-Hang Power OJ (1000-1099) AC code
Platform: |
Size: 286720 |
Author: liuying |
Hits:
Description: hdoj的第五次作业的描述，刘春英老师的作业，时间2012-11-11，-wish you could good good study for every day
Platform: |
Size: 3072 |
Author: lishuai |
Hits:
Description: HDOJ 源代码 包含几百道HDOJ题目源码-The the HDOJ source code contains hundreds Road HDOJ topic source
Platform: |
Size: 200704 |
Author: zhbb |
Hits:
Description: HDOJ 1080 动态规划题目。欢迎各种讨论交流。-The dynamic programming topics HDOJ 1080. Welcome discussions AC.
Platform: |
Size: 1024 |
Author: violet |
Hits:
Description: HDOJ的算法题目，完整的解答方案,含有7个题目的完整程序，希望对你们有帮助-this is the hdu acm,and the algoirth is very perfect
Platform: |
Size: 3072 |
Author: lishuai |
Hits:
Description: HDOJ部分题目编程答案集锦，个人编辑，仅供参考-HDOJ answer section highlights programming topics, people can edit, for reference
Platform: |
Size: 48128 |
Author: liuzhao |
Hits:
Description: hdoj 1495
大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升 可乐的体积为S （S<101）毫升 (正好装满一瓶) ，它们三个之间可以相互倒可乐 (都是没有刻度的，且 S==N+M，101＞S＞0，N＞0，M＞0) 。聪明的ACMER你们说他们能平分吗？如果能请输出倒可乐的最少的次数，如果不能输出 NO 。
-hdoj 1495
Platform: |
Size: 1024 |
Author: Chg |
Hits:
Description: HDOJ练习题目源码，约100多道题目，附带题目类型-HDOJ practice questions source, about 100 multi-channel title, with the title type, etc.
Platform: |
Size: 9295872 |
Author: Biil Sim |
Hits: