CCC '18 J3 - Are we there yet?

View as PDF

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 positive integers less than , each representing the distances between consecutive pairs of consecutive cities: specifically, the th integer represents the distance between city and city .

Output Specification

The output should be lines, with the th line containing the distance from city to cities 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:

• , since the distance from city to city is ;
• , since the distance between city and city is ;
• , since the distance between city and city is ;
• , since the distance between city and city is ;
• , since the distance between city and city is .

• commented on May 30, 2022, 3:55 p.m.

phew that was hard but I wonder if there is an easier way to do it