AcWing 756. 蛇形矩阵
原题链接
简单
作者:
STU756
,
2021-01-20 01:17:56
,
所有人可见
,
阅读 273
#include <iostream>
using namespace std;
const int N = 110;
int a[N][N];
int main(){
int n, m;
cin >> n >> m;
int l = 0, r = m - 1, t = 0, b = n - 1;
int k = 1;
while(l <= r && t <= b) {
for(int i = l; i <= r; i++) a[t][i] = k++;
for(int i = t+1; i <= b; i++) a[i][r] = k++;
for(int i = r - 1; i >= l && t < b; i--) a[b][i] = k++;
for(int i = b - 1; i > t && l < r; i--) a[i][l] = k++;
++l, --r, ++t, --b;
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++)
cout << a[i][j] << " ";
cout << endl;
}
return 0;
}