摘要： The problemGiven the following formula, one can set operators '+' or '-' instead of each '?', in order to obtain a given k? 1 ? 2 ? ... ? n = kFor example: toobtaink = 12, the expression to be used will be:- 1 + 2 + 3 + 4 + 5 + 6 - 7 = 12withn = 7The InputThe first line isthe 阅读全文

摘要： 好久没写解题报告了，本来准备刷完这些水题再开始写，不过面对昨晚做的这道题（UVa 400 / ZOJ 1324），简直让我吐血啊。先上图。前后历经25次提交，终于通过。。。虽然，他够水的。。Unix lsThe computer company you work for is introducing a brand new computer line and is developing a new Unix-like operating system to be introduced along with the new computer. Your assignment is to writ 阅读全文

摘要： Problem EThe Other Two TreesInput: standard inputOutput: standard outputTime Limit: 2 secondsSpecial JudgeYou have a quadrilateral shaped land whose opposite fences are of equal length. You have four neighbors whose lands are exactly adjacent to your four fences, that means you have a common fence w 阅读全文

摘要： Problem Description“Point, point, life of student!”This is a ballad well known in colleges, and you must care about your score in this exam too. How many points can you get? Now, I told you the rules which are used in this course.There are 5 problems in this final exam. And I will give you 100 point 阅读全文

摘要： Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。Input第一行是测试数据的数目t（0 <= t <= 20）。以下每行均包含二个整数M和N，以空格分开。1<=M，N<=10。Output对输入的每组数据M和N，用一行输出相应的K。Sample Input17 3Sample Output8Problem Analysis本题目可使用递归方法求解。向n个盘子里放m个苹果，可以分两种情况：①至少空出一个盘子不放（相对于目前），则转化为在(n-1)个盘子里放m个苹果， 阅读全文