Location:
Search - ACM 24
Search list
Description: 这个是C写的24点的实例源码!绝对真实!有用!ACM做的!
Platform: |
Size: 2297 |
Author: 赵鸿江 |
Hits:
Description: acm pku 2479题，代码加解题思路-acm pku 2479 title, code plus problem-solving ideas
Platform: |
Size: 1024 |
Author: lyd |
Hits:
Description: 这个是C写的24点的实例源码!绝对真实!有用!ACM做的!-This is written in C examples of 24-point-source! Absolutely true! Useful! ACM s to do!
Platform: |
Size: 2048 |
Author: 赵鸿江 |
Hits:
Description: ACM-ICPC竞赛
计算几何 终极学习资料整理合集
包含多篇PPT，论文及模板
-ACM-ICPC contest ultimate learning computational geometry data collection contains more than PPT, papers and template
Platform: |
Size: 10397696 |
Author: 朱明悦 |
Hits:
Description: 本人最近在acm.pku.edu.cn上通过的程序，有一些经典题目-I recently adopted acm.pku.edu.cn procedures, there are some classic topics
Platform: |
Size: 91136 |
Author: liulanzheng |
Hits:
Description: The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the process is repeated. This is continued as long as necessary to obtain a single digit.
For example, consider the positive integer 24. Adding the 2 and the 4 yields a value of 6. Since 6 is a single digit, 6 is the digital root of 24. Now consider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 is not a single digit, the process must be repeated. Adding the 1 and the 2 yeilds 3, a single digit and also the digital root of 39.
source
http://acm.pku.edu.cn/JudgeOnline/problem?id=1519
Platform: |
Size: 1024 |
Author: Neosony |
Hits:
Description: MFC中的经典24点游戏,界面设计精美，同时有三个难度可以提供选择。-MFC 24-point game in the classic, interface design elegant, while there are three difficulty options available.
Platform: |
Size: 475136 |
Author: kaka |
Hits:
Description: 22. 切木头
成绩: 10 / 折扣: 0.9
背景
人们需要把一跟很长的木头切成几段，有一家名为 Analog Cutting Machinery (ACM) 的公司正在经营这一业务。他们根据切割前木头的长度来收费，木头越长、收费越高，并且每切割一次就收一次费。
显而易见，在这里切割木头时，不同的切割顺序就会产生不同的价钱。譬如一跟 10 米长的木头，需要在 2、4、7 米处切开。如果顺序在这三个位置切割，需要的费用是 10 8 6 = 24，因为木头原始长度为 10 米，切掉两米剩 8 米，在四米处切掉剩 6 米。如果按照 4、2、7 的顺序来切割，花费就是 10 4 6 = 20。
任务
你的老板有很多木材要切割，现在他希望你能够帮他找到最便宜的切割方式。
输入
一次输入可能包含多组数据。每一组数据的第一行是木材的长度L (L<=1000)，如果为 0 则表示输入结束。每组数据的第二行是要切割的次数 N (N<=50)，第三行则是切割的位置Ci (0<Ci<L)。以上数据均为整数。
输出
针对每一组输入，输出切割这段木头的最小费用。
-22. Cutting wood
Results: 10/Discount: 0.9
Background
People need to put a cut into the wood with long paragraphs, there is a company called Analog Cutting Machinery (ACM) of the company is operating the business. Them according to the length of wood before cutting charges, the longer the wood, the higher the fees, and each time to receive a fee cut.
Obviously, cutting wood in here, different order will produce different cutting price. For instance, one with 10 meters of wood, you need to cut the 2,4,7 meters. If the sequence of cutting in these three locations, the cost of required 1086 = 24, because the original length of 10 meters of wood, cut two meters 8 meters left, cut off the remaining four meters 6 meters. If the cut in accordance with the order 4,2,7, cost is 1046 = 20.
Task
Your boss has a lot of wood to be cut, and now he wants you to help him find the cheapest way of cutting.
Input
One input may contain multiple sets of data. The first line of each set of dat
Platform: |
Size: 1024 |
Author: a123 |
Hits:
Description: 山东理工大学的ACM解题报告，24点算法，很不错的哦-the answer about ACM of shandong university of technology,24 points algorithm, it is very good.
Platform: |
Size: 230400 |
Author: liyan |
Hits:
Description: c语言实现的acm 24点游戏，nyoj43题，测试可运行，环境为vs2010-c language acm 24-point game, nyoj43 questions, test run, the environment for vs2010
Platform: |
Size: 719872 |
Author: 刘望 |
Hits: