problemset-series-01-problem-1,2

/*

        PROBLEM-01:
        --------------------------------------------------------------------------------
        HAEDEST PROBLEM EVER
        --------------------------------------------------------------------------------

        Statement:
        Shawon has a farm which has a length of 'a' unit and a width of 'b' unit. Shawon wants to calculate the area of the farm. But he has lost the measurments. But his younger brother Sadhin remembers the lcm and the gcd of 'a' and 'b'.

        Given the lcm and the gcd. You have to determine the area of the farm.

        Input:
        You will be given two integer 'l' and 'g' which denotes the lcm and the gcd of 'a' and 'b' respectively. 1 <= l, g <= 5x10^4.

        Output:
        You have to print the area of the firm.



        Sample Input:
        1 1
        Sample Output:
        1



        PROBLEM-02:
        --------------------------------------------------------------------------------
        Biden-Trump -> Bump!
        --------------------------------------------------------------------------------

        Statement:
        Trump and Biden are the two competitors of USA president election of this year. Election Board decided that this year the election process will be held in a different method.

        The Election Board noticed that there are total 'r' * 'c' states in USA. They have suffled those states randomly and formed a matrix with 'r' rows and 'c' columns. Each element of the matrix denotes the total number of electoral votes of the corresponding state. But Trump and Biden do not have any idea about the elements of the matrix.

        Now Trump has to choose one row or one column from the matrix and also Biden has to do the same. The number of electoral votes that Trum or Biden gets shall be the total electoral votes of the row or column that they choose.

        You have to determine the maximum difference between the number of votes that Trump and Biden might get. You have to answer for several test cases.

        Input:
        The first line will contain an integer 't' denoting the number of test cases. 1 <= t <= 100.
        Each test case will start with a line containing two integer 'r' and 'c' denoting the number of rows and the number of columns of the matrix. 1 <= r, c <= 100. Each of the next 'r' lines will contain 'c' positive integers. All of these integers will be less than 101.

        Output:
        For each test case, print a single line that contains the maximum difference between the number of votes that Trump and Biden might get.

        Sample Input:
        2
        3 3
        1 2 3
        4 5 6
        7 8 9
        3 3
        2 2 2
        2 2 2
        2 2 2

        Sample Output:
        18
        0

        PROBLEM-03:
        --------------------------------------------------------------------------------
        Plus-Minus
        --------------------------------------------------------------------------------

        Statement:
        abcd


*/