Submission
Status:
PPPPPPPPPPPPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: matcherbrainner
Problemset: เมทริกซ์สมมาตร
Language: cpp
Time: 0.005 second
Submitted On: 2026-10-03 15:06:56
#include <bits/stdc++.h>
using namespace std;
int A[205][205];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
if (!(cin >> N)) return 0;
for (int i = 1; i < N; ++i) {
for (int j = 0; j < i; ++j) {
int val;
cin >> val;
A[i][j] = val;
A[j][i] = val;
}
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
cout << A[i][j] << (j == N - 1 ? "" : " ");
}
cout << "\n";
}
}