Pagini recente » Cod sursa (job #1366865) | Cod sursa (job #2138497) | Cod sursa (job #1860201) | Cod sursa (job #2271722) | Cod sursa (job #2871590)
#include <iostream>
#include <algorithm>
using namespace std;
//ifstream cin("abc.in");
//ofstream cout("abc.out");
const int N = 200;
int a[N + 1][N + 1], x[N + 1], n;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
cin >> a[i][j];
}
}
int cnt = 1;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
if (i > j && i + j < n + 1){
x[cnt] = a[i][j];
cnt++;
}
}
}
sort (x + 1, x + (cnt - 1) + 1);
x[cnt] = 1001;
for (int i = 1; i < cnt; i++){
if (x[i] != x[i + 1]){
cout << x[i] << " ";
}
}
return 0;
}