AcWing 754. 平方矩阵 II
原题链接
简单
作者:
牛奶小柒Luke
,
2021-02-10 15:42:45
,
所有人可见
,
阅读 341
1和4差不多
方法一
#include <iostream>
using namespace std;
const int N = 110;
int a[N][N];
int main(){
int n;
cin >> n;
while(n){
for(int i = 0;i < n;++i){
a[i][0] = i + 1;
a[0][i] = i + 1;
}
for(int i = 1;i < n;++i){
for(int j = 1;j < n;++j){
a[i][j] = a[i - 1][j - 1];
}
}
for(int i = 0;i < n;++i){
for(int j = 0;j < n;++j){
cout << a[i][j] << ' ';
}
cout << endl;
}
cout << endl;
cin >> n;
}
return 0;
}
方法二
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110;
int n;
int main(){
while(cin >> n,n){
for(int i = 1;i <= n;++i){
for(int j = 1;j <= n;++j){
cout << abs(i - j) + 1 << ' ';
}
cout << endl;
}
cout << endl;
}
return 0;
}
方法三
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110;
int n;
int main(){
while(cin >> n,n){
for(int i = 1;i <= n;++i){
for(int j = i;j >= 1;--j){
cout << j << ' ';
}
for(int j = i + 1;j <= n;++j){
cout << j - i + 1 << ' ';
}
cout << endl;
}
cout << endl;
}
return 0;
}
方法四
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110;
int n;
int a[N][N];
int main(){
while(cin >> n,n){
for(int i = 1;i <= n;++i){
for(int j = i,k = 1;j <= n;++j,++k){
a[i][j] = k;
a[j][i] = k;
}
}
for(int i = 1;i <= n;++i){
for(int j = 1;j <= n;++j){
cout << a[i][j] << ' ';
}
cout << endl;
}
cout << endl;
}
return 0;
}