Sume
레이팅 미적용의견: 0
\(6^{th}\) round, March \(9^{th}\), 2013
Once upon a time, there existed a sequence A consisting of N positive integers. You don't know the
sequence itself, but you do know the sum of every two elements of the sequence. Find the sequence A!
The first line of input contains the positive integer N (\(2 \le N \le 1000\)).
Each of the following N lines contains N positive integers smaller than or equal to 100 000, forming
the table S. The following relations hold: S(i, j) = A[i] + A[j] for \(i \ne j\), and S(i, j) = 0 for \(i = j\). Here S(i,
j) denotes the number in the i^{th} row and j^{th} column of the table, and A[i] denotes the i^{th} element of the
sequence A.
It is guaranteed that for any input data set there exists a unique sequence of positive integers A with
the given properties.
The first and only line of output must contain the required sequence A (in the form of N space-
separated positive integers).
2
0 2
2 01 14
0 3 6 7
3 0 5 6
6 5 0 9
7 6 9 02 1 4 5평가 및 의견
Sume
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Sume