搜索资源列表
2262
- 北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers.
ACM_super_source
- ACM源码集合(不是音频编码的ACM), 里面有些很经典的算法代码, 参考ACM竞赛的,有很大的参考价值,需要的可以下载参考-ACM-source collection (not the audio coding of ACM), which some of the classic algorithm code, reference ACM contest, have a great reference value, can download the necessary reference
EasyKrig3.0
- Usage: yi=akimai(x,y,xi) Given vectors x and y (of the same length) and the array xi at which to interpolate, fits piecewise cubic polynomials and returns the interpolated values yi at xi. Ref. : Hiroshi Akima, Journal of the ACM,
GNU7
- acm.timus 1726. Visits
Birthdaycake
- 7月17日是Mr.W的生日，ACM-THU为此要制作一个体积为N*pi的M层生日蛋糕，每层都是一个圆柱体。 设从下往上数第i(1 <= i <= M)层蛋糕是半径为Ri, 高度为Hi的圆柱。当i < M时，要求Ri > Ri+1且Hi > Hi+1。 由于要在蛋糕上抹奶油，为尽可能节约经费，我们希望蛋糕外表面（最下一层的下底面除外）的面积Q最小。 令Q = S*pi 请编程对给出的N和M，找出蛋糕的制作方案（适当的Ri和Hi的值），使S最