ru
Feedback
Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Открыть в Telegram

Main channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for booking your exam slots Web- https://coding000.github.io/Projects/ 💯% clearance in any placement exams OffCampus -https://t.me/Offcampus_000 Discussion- https://t.me/exams_discussion

Больше
3 355
Подписчики
-324 часа
-97 дней
-3930 день
Архив постов
def sq(matrix, l_x, l_y,side_length):     count=0     for i in range(l_x,l_x+side_length):         for j in range(l_y,l_y+side_length):             if matrix[i][j]==1:                 count +=1             else:                 return 0     return count m,n=map(int,input().split()) mark={'X':1,'O':0} matrix=[[mark[i] for i in input().split()]for _ in range(m)] Vikram=[] for l_x in range(m):     for l_y in range(n):         for side_length in range(1,min(n- l_y+1,m- l_x+1)):             Vikram.append(sq(matrix,l_x,l_y,side_length)) print(max(vikram)) Hard question L1✅

Job is important for everyone 🙂🙂 please try to help eachother 🙂🙂🙂 @ILOVEU_143✅ SHARE OUR CHANNEL....✅✅