AcWing 754. 平方矩阵 II
原题链接
简单
作者:
wayy
,
2021-12-17 19:44:40
,
所有人可见
,
阅读 126
C++ 代码
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
while(cin >> n, n){
int a[n][n];
for(int i = 0; i < n; i++){
bool flag = false;
for(int j = 0; j < n; j++){
if(i == j) {a[i][j] = 1; flag = true;}
else{
if(flag) a[i][j] = a[i][j - 1] + 1;
else a[i][j] = a[i - 1][j] + 1;
}
}
}
for(int i = 0; i < n; i++){
bool flag = false;
for(int j = 0; j < n; j++){
cout << a[i][j] << " ";
}
cout << endl;
}
cout << endl;
}
}