九度OJ----http://ac.jobdu.com/
ruoshui13
人生如梦~~~~
展开
-
题目1009:二叉搜索树
题目描述:判断两序列是否为同一二叉搜索树序列输入:开始一个数n,(1接下去一行是一个序列,序列长度小于10,包含(0~9)的数字,没有重复数字,根据这个序列可以构造出一颗二叉搜索树。接下去的n行有n个序列,每个序列格式跟第一个序列一样,请判断这两个序列是否能组成同一颗二叉搜索树。输出:如果序列相同则输出YES,否则输出NO样例输入:2原创 2014-10-08 19:52:11 · 486 阅读 · 0 评论 -
题目1002:Grading
题目描述: Grading hundreds of thousands of Graduate Entrance Exams is a hard work. It is even harder to design a process to make the results as fair as possible. One way is to assign each exam prob原创 2014-11-01 09:48:58 · 474 阅读 · 0 评论 -
题目1001:A+B for Matrices
题目描述: This time, you are supposed to find A+B where A and B are two matrices, and then count the number of zero rows and columns.输入: The input consists of several test cases, each原创 2014-10-31 19:51:40 · 444 阅读 · 0 评论 -
题目1003:A+B
题目描述:给定两个整数A和B,其表示形式是:从个位开始,每三位数用逗号","隔开。现在请计算A+B的结果,并以正常形式输出。输入:输入包含多组数据数据,每组数据占一行,由两个整数A和B组成(-10^9 输出:请计算A+B的结果,并以正常形式输出,每组数据占一行。样例输入:-234,567,890 123,456,789原创 2014-11-01 10:06:19 · 515 阅读 · 0 评论 -
题目1000:计算a+b
题目描述:求整数a,b的和。输入:测试案例有多行,每行为a,b的值。输出:输出多行,对应a+b的结果。样例输入:1 24 56 9样例输出:3915原创 2014-10-31 19:45:37 · 708 阅读 · 0 评论 -
题目1004:Median
题目描述: Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 1原创 2014-11-01 10:12:54 · 459 阅读 · 0 评论