判断上三角矩阵和下三角矩阵

最新推荐文章于 2023-10-23 23:56:19 发布

二十四桥_

最新推荐文章于 2023-10-23 23:56:19 发布

阅读量527

点赞数

分类专栏： Python123题目参考答案__总结文章标签： python

本文链接：https://blog.csdn.net/Zzzzzz_m/article/details/122481305

版权

Python123题目参考答案__总结专栏收录该内容

135 篇文章 508 订阅

订阅专栏

t = int(input())
ls = []
for i in range(0, t):
    n = int(input())
    l = list()
    for i in range(0, n):
        s = list(map(int, input().split(" ")))
        l.append(s)

    key = 'no'
    summer = 0
    for i in range(0, n):
        for j in range(0, n):
            if i > j:  # 判断下三角部分是否全零
                summer += int(l[i][j])
    if summer == 0:
        key = 'up'

    summer = 0
    for i in range(0, n):
        for j in range(0, n):
            if i < j:  # 判断上三角部分是否全零
                summer += int(l[i][j])
    if summer == 0:
        key = 'down'

    if key == 'up':
        ls.append("upper triangular matrix")
    elif key == 'down':
        ls.append("lower triangular matrix")
    elif key == 'no':
        ls.append('no')

for item in ls:
    print(item)