problem A: A + B
Source: http://acm.zju.edu.cn/show_problem.php?pid=1001
Calculate a + b
Input
The input file will consist of a series of pairs of integers a and b,separated by a space, one pair of integers per line.
Output
For each pair of input integers a and b you should output the sum of a and b in one line,and with one line of output for each line in input.
1 5
2 8
Sample Output
6
10
problem b: Crashing Balloons
Source: http://acm.zju.edu.cn/show_problem.php?pid=1003
On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV. The rule is very simple. On the ground there are 100 labeled balloons, with the numbers 1 to 100. After the referee shouts "Let's go!" the two players, who each starts with a score of "1", race to crash the balloons by their feet and, at the same time, multiply their scores by the numbers written on the balloons they crash. After a minute, the little audiences are allowed to take the remaining balloons away, and each contestant reports his\her score, the product of the numbers on the balloons he\she's crashed. The unofficial winner is the player who announced the highest score.
Inevitably, though, disputes arise, and so the official winner is not determined until the disputes are resolved. The player who claims the lower score is entitled to challenge his\her opponent's score. The player with the lower score is presumed to have told the truth, because if he\she were to lie about his\her score, he\she would surely come up with a bigger better lie. The challenge is upheld if the player with the higher score has a score that cannot be achieved with balloons not crashed by the challenging player. So, if the challenge is successful, the player claiming the lower score wins.
So, for example, if one player claims 343 points and the other claims 49, then clearly the first player is lying; the only way to score 343 is by crashing balloons labeled 7 and 49, and the only way to score 49 is by crashing a balloon labeled 49. Since each of two scores requires crashing the balloon labeled 49, the one claiming 343 points is presumed to be lying.
On the other hand, if one player claims 162 points and the other claims 81, it is possible for both to be telling the truth (e.g. one crashes balloons 2, 3 and 27, while the other crashes balloon 81), so the challenge would not be upheld.
By the way, if the challenger made a mistake on calculating his/her score, then the challenge would not be upheld. For example, if one player claims 10001 points and the other claims 10003, then clearly none of them are telling the truth. In this case, the challenge would not be upheld.
Unfortunately, anyone who is willing to referee a game of crashing balloon is likely to get over-excited in the hot atmosphere that he\she could not reasonably be expected to perform the intricate calculations that refereeing requires. Hence the need for you, sober programmer, to provide a software solution.
Input
Pairs of unequal, positive numbers, with each pair on a single line, that are claimed scores from a game of crashing balloon.
Output
Numbers, one to a line, that are the winning scores, assuming that the player with the lower score always challenges the outcome.
Sample Input
343 49
3599 610
62 36
Sample Output
49
610
62
Problem c: Render it!
by Joshua C. Martinez, MIT
Pedro, an IT student in Ateneo, plans to design a new markup language, which is basically a presentation language that defines how text, images, and other information will be displayed on the computer screen. Since he is on his first year, he does not have a good background in programming. Hence, he taps you to do the dirty job.
Input Specification
From your initial talk, he laid out the following:- You will create a program that will read a file containing one or more spaces, newlines, words, and tags.
- The tag will describe how the item will be rendered on the screen. A tag starts with an open square bracket, followed by the command, and terminated by the closing square bracket. Example: [command]
- Two tags have been defined by Pedro - [NL] for new line and [DIV] for horizontal divider. All tags in the input file will either be [NL] or [DIV].
- Words will be a combination of letters, punctuation marks, and numbers (i.e. Josh123, 1xyz ) except '[' and ']'. A word must not exceed 50 characters.
Output Specification
Your program must display the content, following some simple rules.- Two or more spaces between words must be considered as one space during display.
- If it reads a word and the resulting line does not exceed 50 characters, display it. If it does, the suceeding words must be displayed on the next line.
- If it reads [NL], a new line must be printed.
- If it reads [DIV], display 50 characters of the plus sign (+) in a new line. If [DIV] is placed at the start of the file, do not print a new line anymore.
Sample Input
[DIV]Hi! This is a sample text. [NL] May I know your name? You
are
from what place? Are you male or female? Do you have siblings? [NL][DIV][NL] Jack and Jill [NL] went up [DIV]
the hill [DIV]
Sample Output
++++++++++++++++++++++++++++++++++++++++++++++++++
Hi! This is a sample text.
May I know your name? You are from what
place? Are you male
or female? Do you have siblings?
++++++++++++++++++++++++++++++++++++++++++++++++++
Jack and Jill
went up
++++++++++++++++++++++++++++++++++++++++++++++++++
the hill
++++++++++++++++++++++++++++++++++++++++++++++++++