Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - acm
Search - acm - List

Date : 2025-12-20 Size : 8.09kb User :

ACM的,可以弄下算法
Date : 2012-01-01 Size : 32.43mb User : wind_shadow

acm资料
Date : 2012-01-09 Size : 25.84mb User : chickenwin

VC调用ACM音频压缩编程接口的方法-VC called ACM Programming Interface audio compression method
Date : 2025-12-20 Size : 8kb User : 李喆

1995年ACM contest FINAL试题和源码-1995 ACM contest questions and source FINAL
Date : 2025-12-20 Size : 625kb User : 李明

2004年acm试题题解-2004 acm questions that solution
Date : 2025-12-20 Size : 7kb User : 施委

DL : 0
这 是一个关于算法的很好的集子,里面介绍了很多有用的acm 模板-acm
Date : 2025-12-20 Size : 69kb User : xu

These are problems and texts case of ACM-context HSPC.-These are problems and texts case of ACM-context HSPC.
Date : 2025-12-20 Size : 10.85mb User : Manh

ACM算法竞赛教程,基于c++语言,可以很好地训练自己的算法设计水平(ACM algorithm competition tutorial)
Date : 2025-12-20 Size : 1.53mb User : milanista

此为部分acm算法模板,对算法学习有帮助(This is part of the ACM algorithm template, algorithm learning helpful)
Date : 2025-12-20 Size : 16.93mb User : wang648979

ACM模板,包括了各种各样的常用算法以及经典数据结构(ACM template, including a variety of commonly used algorithms and data structure of the classic)
Date : 2025-12-20 Size : 627kb User : LX4866

有关acm算法的一本电子文档,以及模板,很实用。(About the ACM algorithm of an electronic document, as well as templates, very practical.)
Date : 2025-12-20 Size : 800kb User : 执1234

杭州电子科技大学ACM培训课件,系统培训ACM竞赛技巧(Hangzhou Dianzi University ACM training courseware, system training ACM competition skills)
Date : 2025-12-20 Size : 5.27mb User : 小妹妹qaq

这是我们学校的ACM培训资料,分好的算法模板。(This is our school's ACM training material, and a good algorithm template.)
Date : 2025-12-20 Size : 1.68mb User : 欧阳锋q

这是对ACM竞赛中对网络流和二分图的讲解。(This is to explain the network flow and the two point diagram in the ACM competition.)
Date : 2025-12-20 Size : 2.53mb User : 欧阳锋q

这是ACM竞赛的试题库,由北京大学整理的。(This is a question bank for ACM competition, which is arranged by Peking University.)
Date : 2025-12-20 Size : 9.12mb User : 欧阳锋q

DL : 0
A message from humans to extraterrestrial intelligence was sent through the Arecibo radio telescope in Puerto Rico on the afternoon of Saturday November 16, 1974. The message consisted of 1679 bits and was meant to be translated to a rectangular picture with 23 * 73 pixels. Since both 23 and 73 are prime numbers, 23 * 73 is the unique possible size of the translated rectangular picture each edge of which is longer than 1 pixel. Of course, there was no guarantee that the receivers would try to translate the message to a rectangular picture. Even if they would, they might put the pixels into the rectangle incorrectly. The senders of the Arecibo message were optimistic.(The input is a sequence of at most 2000 triplets of positive integers, delimited by a space character in between. Each line contains a single triplet. The sequence is followed by a triplet of zeros, 0 0 0, which indicated the end of the input and should not be treated as data to be processed. Input The integers of each input triplet are the integer m, the numerator a, and the denominator b described above, in this order. You may assume 4 < m <= 100000 and 1 <= a <= b <= 1000. Output The output is a sequence of pairs of positive integers. The i-th output pair corresponds to the i-th input triplet. The integers of each output pair are the width p and the height q described above, in this order.)
Date : 2025-12-20 Size : 1kb User : zilewwy

Were Tian Ji lives in nowadays, he will certainly laugh at himself. Even more, were he sitting in the ACM contest right now, he may discover that the horse racing problem can be simply viewed as finding the maximum matching in a bipartite graph. Draw Tian's horses on one side, and the king's horses on the other. Whenever one of Tian's horses can beat one from the king, we draw an edge between them, meaning we wish to establish this pair. Then, the problem of winning as many rounds as possible is just to find the maximum matching in this graph. If there are ties, the problem becomes more complicated, he needs to assign weights 0, 1, or -1 to all the possible edges, and find a maximum weighted perfect matching...(For each input case, output a line containing a single number, which is the maximum money Tian Ji will get, in silver dollars.)
Date : 2025-12-20 Size : 1kb User : zilewwy

Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce his score of the final test. And now we assume that doing everyone homework always takes one day. So Ignatius wants you to help him to arrange the order of doing homework to minimize the reduced score.(The input contains several test cases. The first line of the input is a single integer T that is the number of test cases. T test cases follow. Each test case start with a positive integer N(1<=N<=1000) which indicate the number of homework.. Then 2 lines follow. The first line contains N integers that indicate the deadlines of the subjects, and the next line contains N integers that indicate the reduced scores.)
Date : 2025-12-20 Size : 1kb User : zilewwy

包含清华大学ACM模板,以及其他两份ACM模板。(ACM Template of Tsinghua University)
Date : 2025-12-20 Size : 11.54mb User : HIPPOCAMPUS
« 12 »
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.