es
Feedback

¡No caigas en manos de tramposos! Telemetrio encuentra y marca estos canales 👉 Si quieres ver la etiqueta, suscríbete

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

Ir al canal en 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

Mostrar más
3 257
Suscriptores
Sin datos24 horas
-107 días
-3930 días
Archivo de publicaciones
Deliotee 2nd code python✅
+1
Deliotee 2nd code python✅
27 dic 2022, 07:46
27 dic 2022, ~09:07

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✅
27 dic 2022, 07:44
27 dic 2022, ~09:07

Guys post ur question... IDP L1 👇👇 https://t.me/exams_discussion https://t.me/exams_discussion IDP L2👇👇 https://t.me/coding000 https://t.me/coding000 Share our channel to ur frds...✅
27 dic 2022, 07:35
27 dic 2022, ~09:07

Guys i will post deliotee codes pls wait....
27 dic 2022, 07:26
27 dic 2022, ~09:07

Job is important for everyone 🙂🙂 please try to help eachother 🙂🙂🙂 @ILOVEU_143✅ SHARE OUR CHANNEL....✅✅
27 dic 2022, 07:22
27 dic 2022, ~12:41