Welcome![Sign In][Sign Up]
Location:
Search - ACM 30

Search list

[Other resource1

Description: Shanghai Jiao Tong University ACM-ICPC Team Selection Contest Stage I May 17th, 2006 18:00 » 20:30
Platform: | Size: 79022 | Author: darren | Hits:

[Other1

Description: Shanghai Jiao Tong University ACM-ICPC Team Selection Contest Stage I May 17th, 2006 18:00 » 20:30
Platform: | Size: 78848 | Author: darren | Hits:

[Data structs3083

Description: pku acm上的3083源代码,不过没有解题报告-pku acm on the 3083 source code, but I did not report Problem Solving
Platform: | Size: 1024 | Author: ringsd | Hits:

[Otheracm_jiaocheng

Description: ACM国际大学生程序设计竞赛(英文全称:ACM International Collegiate Programming Contest(ACM-ICPC或ICPC)是由美国计算机协会(ACM)主办的,一项旨在展示大学生创新能力、团队精神和在压力下编写程序、分析和解决问题能力的年度竞赛。经过近30多年的发展,ACM国际大学生程序设计竞赛已经发展成为最具影响力的大学生计算机竞赛。赛事目前由IBM公司赞助。 -ACM International Collegiate Programming Contest (English name: ACM International Collegiate Programming Contest (ACM-ICPC or ICPC) by the Association for Computing Machinery (ACM) hosted a college to showcase innovation, teamwork and programming under pressure , analysis and problem-solving abilities of the annual competition. After nearly 30 years of development, ACM International Collegiate Programming Contest has developed into the most influential university computer contest. events currently sponsored by IBM.
Platform: | Size: 6576128 | Author: 杨敬 | Hits:

[Mathimatics-Numerical algorithmsWorkAssignment

Description: acm算法设计 设有n件工作分配给n个人。将工作i 分配给第j 个人所需的费用为Cij。试设计一个算法,为每一个人都分配1 件不同的工作,并使总费用达到最小。 设计一个算法,对于给定的工作费用,计算最佳工作分配方案,使总费用达到最小。 输入:第一行有1 个正整数n (1≤n≤30)。接下来的n行,每行n个数,表示工作费用。 输出:最小总费用。 例输入: 3 10 2 3 2 3 4 3 4 5 例输出:9-acm algorithm design with n pieces of work assigned to the n individuals. I will be allocated to the work of the first j for the cost of personal Cij. Try to design an algorithm for each individual a different allocation of effort and minimize the total cost. To design an algorithm for a given cost of the work to calculate the best distribution of work to minimize the total cost. Input: the first line there is a positive integer n (1 ≤ n ≤ 30). N the next line, n the number of each line, the cost of that work. Output: the minimum total cost. Cases of type: 31,023,234,345 cases output: 9
Platform: | Size: 355328 | Author: 张波 | Hits:

[AlgorithmDesktop

Description: 北大ACM试题poj 第3066 3069题源码,很好的代码,希望对搞ACM的同学有帮助 -Peking University ACM Chapter 30,663,069 question Question poj source code, good code, and want to help students engage in ACM
Platform: | Size: 1024 | Author: ttzz | Hits:

[OtherDesktop

Description: 北大ACM试题poj 第3067 3071题源码,很好的代码,希望对搞ACM的同学有帮助 -Peking University ACM Chapter 30,673,071 question Question poj source code, good code, and want to help students engage in ACM
Platform: | Size: 1024 | Author: ttzz | Hits:

[Software Engineeringacm

Description: 完美整理第29,30,31界ACM比赛资料(试题,解答)。供编程爱好者学习参考。-Perfect finishing the first race 29,30,31 sector ACM information (Questions to answer). Programming reference for enthusiasts to learn.
Platform: | Size: 1119232 | Author: 王美涵 | Hits:

[Othertriangle-data

Description: 很好地解决ACM的数字三角问题: 有一个形式如下的数字三角形: 7 3 8 8 1 0 2 7 7 4 4 5 2 6 5 从三角形顶点,沿左斜线方向或右斜线方向下降到三角形底边的路线是一条合法路径。 例如,图中用红色标出的路径就是合法的;我们可以将这条路径记为“LLRL”,它经过了7,3,8,7,5这5个数字,它们的和是30。 请编写一个程序,求解一条合法路径,使这条路径上经过的各数字的总和最大,并把这个最大的总和以及你的路径输出出来。如果路径不止一条,则优先选择向左走-A good solution to the ACM Digital Triangle problem
Platform: | Size: 897024 | Author: 李银城 | Hits:

[Data structsACM

Description: ACM国际大学生程序设计竞赛(英文全称:ACM International Collegiate ProgrammingContest(ACM-ICPC或ICPC)是由美国计算机协会(ACM)主办的,一项旨在展示大学生创新能力、团队精神和在压力下编写程序、分析和解决问题能力的年度竞赛。经过近30多年的发展,ACM国际大学生程序设计竞赛已经发展成为最具影响力的大学生计算机竞赛。这些是一些ACM的试题 -ACM International Collegiate Programming Contest (English name: ACM International Collegiate ProgrammingContest (ACM-ICPC or ICPC) is by the American Association for Computing Machinery (ACM) organized, one designed to showcase students' creativity, teamwork and programming under pressure, analytical and problem-solving skills of the annual contest. After nearly 30 years of development, ACM International Collegiate Programming Contest has become the most influential college computer contest and these are some of the questions ACM
Platform: | Size: 47104 | Author: 段梦 | Hits:

[OtherACM

Description: 大学搞杭电ACM的可以看看 ACM国际大学生程序设计竞赛(英文全称:ACM International Collegiate ProgrammingContest(ACM-ICPC或ICPC)是由美国计算机协会(ACM)主办的,一项旨在展示大学生创新能力、团队精神和在压力下编写程序、分析和解决问题能力的年度竞赛。经过近30多年的发展,ACM国际大学生程序设计竞赛已经发展成为最具影响力的大学生计算机竞赛。-Universities engage Hang power can look ACM ACM International Collegiate Programming Contest (English name: ACM International Collegiate ProgrammingContest (ACM-ICPC or ICPC) is by the American Association for Computing Machinery (ACM) hosted, designed to showcase a students ability to innovate, team mental and programming under pressure, analytical and problem-solving abilities of the annual contest. After nearly 30 years of development, ACM International Collegiate Programming Contest has become the most influential college computer race.
Platform: | Size: 24576 | Author: 罗纳尔 | Hits:

[Mathimatics-Numerical algorithmsDesktop110

Description: 北大ACM试题poj 第3067 3071题源码,很好的代码,希望对搞ACM的同学有帮助-Peking University ACM Chapter 30,673,071 question Question poj source code, good code, and want to help students engage in ACM
Platform: | Size: 1024 | Author: huang284062 | Hits:

[Documents贪心1009

Description: For example : There are 5 soldiers (A B C D E)with level numbers : 2 4 5 6 4; One method : C could teach B; B could teach A; So , A B C are eligible to study on the same broomstick. D could teach E;So D E are eligible to study on the same broomstick; Using this method , we need 2 broomsticks. Another method: D could teach A; So A D are eligible to study on the same broomstick. C could teach B; So B C are eligible to study on the same broomstick. E with no teacher or student are eligible to study on one broomstick. Using the method ,we need 3 broomsticks. ……(Input file contains multiple test cases. In a test case,the first line contains a single positive number N indicating the number of soldiers.(0<=N<=3000) Next N lines :There is only one nonnegative integer on each line , indicating the level number for each soldier.( less than 30 digits); Output For each case, output the minimum number of broomsticks on a single line.)
Platform: | Size: 1024 | Author: zilewwy | Hits:

CodeBus www.codebus.net