Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - acm
Search - acm - List
The Drunk Jailer acm zju pku 上的题目-The Drunk Jailer acm zju pku on the topic
Date : 2008-10-13 Size : 2.4kb User : nijia

基于acm1602lcd的c语言编程。实验已经通过,与大家分享。-acm1602lcd based on the c programming language. The experiment was passed, and share with you all.
Date : 2025-12-20 Size : 1kb User : 中国库

The Drunk Jailer acm zju pku 上的题目-The Drunk Jailer acm zju pku on the topic
Date : 2025-12-20 Size : 2kb User : nijia

acm的一些题目的解答,应该是中山大学出的那本,题目层次比较好,希望能对大家有所帮助。-acm answers some of the topics should be of that of the Sun Yat-sen University, the subject level is better, I hope you can help.
Date : 2025-12-20 Size : 1.78mb User : 张博

一个acm题目系统会自动删除debug和release目录,所以请不要将文件放在这两个目录下-a acm
Date : 2025-12-20 Size : 229kb User : shi

矩阵中填数,当给出 N*N 的矩阵,要求用程序按蛇形填入下列形式的数。-ACM BUPT
Date : 2025-12-20 Size : 1kb User : Ever

acm pku 1041题代码,经典欧拉回路问题。-acm pku 1041 title code, the issue of the classic Euler circuit.
Date : 2025-12-20 Size : 1kb User : fireToWar

此程序为12864的汉字显示程序,可以很方便地为你解决问题。多多下载!-This program is 12864 Chinese characters display program, you can easily solve the problem for you. Lot of downloads!
Date : 2025-12-20 Size : 2kb User : dawei

厦门大学汇编程序设计课件,学习汇编必备哦。-Xiamen University assembler design courseware, learning essential compilation of Oh.
Date : 2025-12-20 Size : 10.78mb User : guojian

教你怎么在puk中答题,acm中你必胜怎么在puk中答题 -Nauczy Cię , jak arkNauczy Cię , jak arkusz odpowiedzi w PUKusz odpowiedzi w PUK
Date : 2025-12-20 Size : 13kb User : 武玉锋

浙江工业大学ACM网络联系题C++部分答案-Zhejiang University ACM networking part of the answer to question C++
Date : 2025-12-20 Size : 19kb User : 张莹

ACM培训教程,内含多个例子,这是递归的教程-ACM training tutorials, contains a number of examples, this is recursive tutorial
Date : 2025-12-20 Size : 39kb User : zhsh

给出Andy和各怪物的能量, 攻击力, 防御力,和迷宫的地图,请你计算一下 能量/耗时 的最大值。 当Andy走到有怪物的地方时,Andy会先进行攻击,然后怪物攻击,然后Andy……当一方的能量小于等于0时攻击停止,并且小于等于0的一方死亡。攻击时,每次对方损耗的能量为己方的攻击力减去对方的防御力。 -Andy and gives each monster energy, attack power, defense, and the map of the maze, you calculate the energy/time consuming maximum. When Andy went to the place where there are monsters, Andy will first attack, then attack the monster, and then Andy ...... when one side of the energy is less than equal to 0:00 attack stopped, and the death of one is less than or equal to 0. Attacks, each other energy loss by subtracting one' s attack each other' s defense.
Date : 2025-12-20 Size : 14kb User : 杨兴

acm题,纪念邮票邮局最近推出了一套纪念邮票,这套邮票共有N张,邮票面值各不相同,按编号顺序为1分,2分,……,N分。小明是个集邮爱好者,他很喜欢这套邮票,可惜现在他身上只有M分,并不够把全套都买下。他希望尽量买,最好刚好花光所有的钱。作为一个集邮爱好者,小明也不想买的邮票编号断断续续,所以小明打算买面值a分至b分的b-a+1张连续的邮票,且总价值刚好为M分。 我们用不同的算法求出所有符合要求的方案,以[a,b]的形式输出。-acm questions, post office recently launched a commemorative set of commemorative stamps, stamps are a total of N sheets, stamps face value varies in numerical order of 1 minute, 2 minutes, ......, N points. Xiao Ming is a stamp collector, he was very fond of the stamps, but now his body is only M points, and not enough to have bought a full set. He hoped that try to buy the best just spend all the money. As a philatelists, Xiao Ming not want to buy stamps numbers off, so Xiao Ming intend to buy a par value b min b-a+1 continuous sheets of stamps, and the total value of M points exactly. We use different algorithms to obtain all eligible programs to [a, b] in the form of output.
Date : 2025-12-20 Size : 922kb User : lai

ACM 3n+1的題目,屬於3顆星的題目,可作為初學者做參考
Date : 2025-12-20 Size : 1kb User : 蔡承宏
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.