thistf的专栏

题目描述： 求整数a，b的和。 输入： 测试案例有多行，每行为a，b的值。 输出： 输出多行，对应a+b的结果。 样例输入： 1 2 4 5 6 9 样例输出： 3 9 15 import java.util.Scanner; public class Main { public static void main(Stri

题目描述：     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

题目描述：     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

题目描述： 给定两个整数A和B，其表示形式是：从个位开始，每三位数用逗号","隔开。 现在请计算A+B的结果，并以正常形式输出。 输入： 输入包含多组数据数据，每组数据占一行，由两个整数A和B组成（-10^9 输出： 请计算A+B的结果，并以正常形式输出，每组数据占一行。 样例输入： -234,567,890 123,456,789

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, 17} is 15. The

题目描述：     It is said that in 2011, there are about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province. It would help a lot if you could write a program to automate

题目描述： 对给定的字符串(只包含'z','o','j'三种字符),判断他是否能AC。 是否AC的规则如下： 1. zoj能AC； 2. 若字符串形式为xzojx，则也能AC，其中x可以是N个'o' 或者为空； 3. 若azbjc 能AC，则azbojac也能AC，其中a,b,c为N个'o'或者为空； 输入： 输入包含多组测试用例，每行有一个只包含'z','o','j'三