Работа с матрицей

In [1]: def count(matrix):
   ...:     return sum(0 not in row for row in matrix)
   ...:

In [1]: from collections import Counter
 
In [2]: from itertools import chain
 
In [3]: def maximum(matrix):
    ...:     return max(key for key, count in Counter(chain.from_iterable(matrix)).most_common() if count > 1)
    ...:

lst = []
for i in range(int(input('Введите кол-во строк в матрице: '))):
    lst.append(list(map(int, input().split())))
 
def zero(x):
    k = 0
    for q in x:
        if 0 not in q:
            k += 1
    return k
 
def mdgt(x):
    m = []
    for q in x:
        m += list(set(q))
    m.sort(reverse=True)
    for j in range(len(m)-1):
        if m[j] == m[j+1]:
            return m[j]
 
print(f'Кол-во строк с нулями: {zero(lst)}')
print(f'Самое большое повторяющееся число матрицы: {mdgt(lst)}')

(lambda a: print(max([[j for j in i if sum(e.count(j) for e in a) > 1] for i in a])[0])) ([[1, 2], [3, 4, 1, 1, 1, 1], [2, 4, 2]])

def mdgt(x):
    m = []
    for q in x:
        m += q
    m.sort(reverse=True)
    for j in range(len(m) - 1):
        if m[j] == m[j + 1]:
            return m[j]

(lambda a: print(sum(0 not in i for i in a), max([[j for j in i if sum(e.count(j) for e in a) > 1] for i in a])[0])) ([[0, 1, 2], [3, 4, 1, 1, 1, 1], [2, 4, 2]])

In [1]: (count := lambda matrix: sum(0 not in row for row in matrix)) and (maximum := lambda matrix: max(key for key, c
   ...: ount in __import__("collections").Counter(__import__("itertools").chain.from_iterable(matrix)).most_common() if
   ...:  count > 1)) and None
 
In [2]: matrix = ((1, 1, 1,), (2, 2, 3,), (3, 3, 4,))
 
In [3]: print(count(matrix), maximum(matrix))
3 3

0 not in row

all(row)

sum(all(row) for row in matrix)