CCC '18 J3 - Are we there yet?

View as PDF

Submit solution

Points: 3
Time limit: 3.0s
Memory limit: 256M

Problem type
Canadian Computing Competition: 2018 Stage 1, Junior #3

You decide to go for a very long drive on a very straight road. Along this road are five cities. As you travel, you record the distance between each pair of consecutive cities.

You would like to calculate a distance table that indicates the distance between any two of the cities you have encountered.

Input Specification

The first line contains 44 positive integers less than 1\,0001\,000, each representing the distances between consecutive pairs of consecutive cities: specifically, the iith integer represents the distance between city ii and city i + 1i + 1.

Output Specification

The output should be 55 lines, with the iith line (1 \le i \le 5)(1 \le i \le 5) containing the distance from city ii to cities 1, 2, 3, 4, 51, 2, 3, 4, 5 in order, separated by one space.

Sample Input

3 10 12 5

Sample Output

0 3 13 25 30
3 0 10 22 27
13 10 0 12 17
25 22 12 0 5
30 27 17 5 0

Explanation for Sample Output

The first line of output contains:

  • 00, since the distance from city 11 to city 11 is 00;
  • 33, since the distance between city 11 and city 22 is 33;
  • 1313, since the distance between city 11 and city 33 is 3 + 10 = 133 + 10 = 13;
  • 2525, since the distance between city 11 and city 44 is 3 + 10 + 12 = 253 + 10 + 12 = 25;
  • 3030, since the distance between city 11 and city 55 is 3 + 10 + 12 + 5 = 303 + 10 + 12 + 5 = 30.

Comments


  • -58
    989987  commented on Aug. 20, 2020, 6:10 p.m.

    This comment is hidden due to too much negative feedback. Click here to view it.


    • 4
      python6645  commented on Dec. 1, 2020, 9:21 p.m.

      Did you mean: "First comment on this question"?