 Day 1: Problem  A, B, C              Day 2: Problem A, B, C Day 1 - Problem A Idle machine A computer records the starting and finishing time of each application program in the measure of 1/100 seconds. A daily statistic is a set of pairs (a, b) of non negative integers such that 0'. The second name terminated by end-of-line character. The names are at most 20 characters long. A line of the form A>B means that the successor of student A is B, i.e. A directly delivers messages to B. Output Data Write the minimal number of necessary modifications to the text file DAY1B.SOL as an integer. Maximum number of points: 35.   Day 1 - Problem C Fair sharing Two brothers, Alan and Bob want to share a set of gifts. Each of the gifts should be given to either Alan or Bob, and none of the gifts can be split. Each gift has a positive integer value. Let A and B denote the total value of gifts received by Alan and Bob, respectively. The aim is to minimize the absolute value of the difference A-B. Write a program which computes the values A and B. Input data The first line of the text file DAY1C.DAT contains N, the number of the gifts (1<=N<= 100). The rest of the input contains N positive integers, the values of the gifts. Each value is <=200. Output Data Write the two integers A and B to the text file DAY1C.SOL. Maximum number of points: 40.   Day 2 - Problem A Garden There are N trees in a garden. The shape of the garden is square with 1000 m long sides. We are looking for a rectangle with largest area that does not contain trees inside. The sides of the rectangle must be parallel to the corresponding sides of the garden. Each side of the rectangle may contain trees and may lie on a side of the garden. Trees are given by (x, y) coordinates of their positions measured in meter. A tree is considered to be a point without extension. The origin of the coordinate system is the lower left corner of the garden and the axes are parallel to the sides. Input data The first line of text file DAY2A.DAT contains N, the number of the trees (1<=N<=600). In each of the next N lines you will find integer coordinates (x, y) (0