C语言实现：轻松判断方阵是否为上三角矩阵

```c #include <stdio.h> int isUpperTriangular(int n, int arr[][n]) { for (int i = 1; i < n; i++) { for (int j = 0; j < i; j++) { if (arr[i][j]!= 0) { return 0; } } } return 1; } int main() { int t; scanf("%d", &t); while (t--) { int n; scanf("%d", &n); int arr[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { scanf("%d", &arr[i][j]); } } if (isUpperTriangular(n, arr)) { printf("yes\n"); } else { printf("no\n"); } } return 0; } ``` ######[AI写代码神器 | 243点数解答 | 2024-11-11 20:16:14]