Are we there yet?
시간 제한: 2000ms메모리 제한: 512MB출처: CCC 2018 JuniorBOJ 16019
문제
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.
입력
The first line contains 4 positive integers less than 1000, each representing the distances between consecutive pairs of consecutive cities: specifically, the ith integer represents the distance between city i and city i + 1.
출력
The output should be 5 lines, with the ith line (1 ≤ i ≤ 5) containing the distance from city i to cities 1, 2, ... 5 in order, separated by one space.
예제
예제 1
입력
3 10 12 5
출력
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
코드를 제출하려면 로그인하세요.