码海坐标

[Submit][Status][Web Board]Description输入学生的姓名和成绩，统计出最高分的学生和最低分的学生。Input输入5个学生的姓名和分数，用结构体完成Output输出最高分的姓名和分数，最低分的姓名和分数Sample Inputwang 98.8 li 67.9 zhang 5

qsort(数组名,数组长度,数组中每个元素大小,compare); compare函数的写法决定了排序是升序还是降序。需要#include例如：int compare(const void*a,const void*b){return *(int*)a-*(int*)b;} 示例：qsort(a,10,sizeof(int),compare) //假设已定义了整型数组a[10]升

Problem DescriptionIgnatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and a straight line. The picture below shows the area. Now g

Problem DescriptionFamous Harry Potter,who seemd to be a normal and poor boy,is actually a wizard.Everything changed when he had his birthday of ten years old.A huge man called 'Hagrid' found Harr

Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room con

Children’s QueueTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10040    Accepted Submission(s): 3198Problem DescriptionThere ar

不容易系列之一Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 70   Accepted Submission(s) : 26Font: Times New Roman | Verdana | GeorgiaFo

A Mathematical CuriosityTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 87   Accepted Submission(s) : 23Font: Times New Roman | Verdana | Ge

Max SumTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 52   Accepted Submission(s) : 12Font: Times New Roman | Verdana | GeorgiaFont Size:

Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The

C语言实验——一元二次方程ⅡTime Limit: 1 Sec  Memory Limit: 64 MBSubmit: 169  Solved: 131[Submit][Status][Web Board]Description求一元二次方程ax2+bx+c=0的解。a,b,c为任意实数。Input输入数据有一行，包括a b c的值。Outp

游起来吧！超妹！Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 15  Solved: 7[Submit][Status][Web Board]Description夏天到了，无聊的超妹跑到了落雪湖里抓鱼吃。结果，游到湖的正中 央时被湖边保安看到了，保安要抓住超妹。我们假设落雪湖是一个半径为r的圆形，超妹在圆形的正中

Problem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It nee

Tian Ji -- The Horse Racin Problem DescriptionHere is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play

位图像素的颜色Time Limit: 2000/1000 MS (Java/Others)    MemoryLimit: 32768/32768 K (Java/Others)Total Submission(s): 0    Accepted Submission(s): 0Problem Description有一个在位图上画出矩形程序，一开始位图都被初始化为白色

Problem Description一把钥匙有N个槽，2 Input本题无输入Output对2Sample OutputN=3: 104N=4: 904N=5: 5880.....N=25: 8310566473196300280#include#includeusing namespace std;in

Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的：有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？已经告诉你了，这是个DP的题目，你能AC吗?Input输入数据首先包括一个整数C,表示测试实例的个数，每个测试实例的第一行是一个整数N(1 Ou

Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there e

Fire Net Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 13   Accepted Submission(s) : 5Font: Times New Roman | Verdana | GeorgiaFont Si

Super Jumping! Jumping! Jumping!Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 20   Accepted Submission(s) : 7Font: Times New Roman |

Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求

Problem Description搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n的整数.幸运的是xhd根据多年的搬东西的经验发现每搬一次的疲劳度是和

杭电ACM 2014暑期集训队——选拔安排~Bone CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25800    Accepted Submission(s): 10453

P01: 01背包问题题目 有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。 基本思路 这是最基础的背包问题，特点是：每种物品仅有一件，可以选择放或不放。 用子问题定义状态：即f[i][v]表示前i件物品恰放入一个容量为v的背包可以获得的最大价值。则其状态转移方程