对角线
1190. 对角线I
#include<bits/stdc++.h> using namespace std; int a[105][105]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(i==j){ a[i][j]=1; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<setw(3)<<a[i][j]; }if(i==n){ break; }else{ cout<<endl; } } return 0; }1191. 对角线II
#include<bits/stdc++.h> using namespace std; int a[105][105]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(i+j==n+1){ a[i][j]=1; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<setw(3)<<a[i][j]; } cout<<endl; } return 0; }数字走向
1184. 数字走向I
#include<bits/stdc++.h> using namespace std; int a[105][105]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(j==1){ a[i][j]=a[i-1][n]+j; continue; } a[i][j]=a[i][j-1]+1; } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<setw(3)<<a[i][j]; if(j==n)cout<<endl; } } return 0; }1185. 数字走向II
#include<bits/stdc++.h> using namespace std; int a[105][105]; int main(){ int n; cin>>n; int k=1; for(int i=n;i>=1;i--){ for(int j=1;j<=n;j++){ a[i][j]=k; k++; } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<setw(3)<<a[i][j]; }cout<<endl; } return 0; }1186. 数字走向III
#include <iostream> #include <iomanip> using namespace std; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cout << setw(3) << i + (j - 1) * n; } cout << endl; } return 0; }1187. 数字走向IV
#include<bits/stdc++.h> using namespace std; int a[11][11]; int main(){ int n,sum=1; cin>>n; for(int i=n;i>=1;i--){ for(int j=1;j<=n;j++){ a[j][i]=sum; sum++; } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<setw(3)<<a[i][j]; } cout<<endl; } return 0; }1188. 数字走向V
#include<bits/stdc++.h> using namespace std; int a[11][11]; int main(){ int n,sum=1; cin>>n; for(int i=n;i>=1;i--){ for(int j=n;j>=1;j--){ a[i][j]=sum; sum++; } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<setw(3)<<a[i][j]; } cout<<endl; } return 0; }1189. 数字走向VI
#include<bits/stdc++.h> using namespace std; int a[11][11]; int main(){ int n,sum=1; cin>>n; for(int i=1;i<=n;i++){ for(int j=n;j>=1;j--){ a[i][j]=sum; sum++; } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<setw(3)<<a[i][j]; } cout<<endl; } return 0; }斜角
1193. 斜角II
#include<bits/stdc++.h> using namespace std; int a[105][105]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(i+j<=n+1){ a[i][j]=i+j-1; }else{ a[i][j]=n*2-(i+j-1); } cout<<setw(3)<<a[i][j]; }cout<<endl; } return 0; }1192. 斜角I
#include<bits/stdc++.h> using namespace std; int a[105][105]; int main(){ int n; cin>>n; for(int i=0;i<n;i++){ for(int j=i+1;j<=n+i;j++){ a[i][j]=j; cout<<setw(3)<<a[i][j]; }cout<<endl; } return 0; }拐角
1196. 拐角I
#include<bits/stdc++.h> using namespace std; int a[105][105]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(i==1||j==1)cout<<setw(3)<<1; else if(i==2||j==2)cout<<setw(3)<<2; else if(i==3||j==3)cout<<setw(3)<<3; else if(i==4||j==4)cout<<setw(3)<<4; else if(i==5||j==5)cout<<setw(3)<<5; else if(i==6||j==6)cout<<setw(3)<<6; else if(i==7||j==7)cout<<setw(3)<<7; else if(i==8||j==8)cout<<setw(3)<<8; else if(i==9||j==9)cout<<setw(3)<<9; else if(i==10||j==10)cout<<setw(3)<<10; }cout<<endl; } return 0; }1197. 拐角II
#include <iostream> #include <iomanip> #include <cmath> using namespace std; int main() { int n; int a[10][10]; cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (j <= i) { a[i][j] = n + 1 - i; cout << setw(3) << a[i][j]; } else { a[i][j] = n + 1 - j; cout << setw(3) << a[i][j]; } } cout << endl; } return 0; }1198. 拐角III
#include <iostream> #include <iomanip> #include <cmath> using namespace std; int main() { int n; int a[10][10]; cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (n + 1 - j > n + 1 - i) { a[i][j] = n + 1 - j; cout << setw(3) << a[i][j]; } else { a[i][j] = n + 1 - i; cout << setw(3) << a[i][j]; } } cout << endl; } return 0; }二维数组可能得告一段落，下一次在教大家
