Bajardi: Tohirov Sarvar

Toshkent Axborot Texnalogiyalri Universiteti

Algoritmlarni Loyihalash Fani

Amaliy ish 2

Bajardi:Tohirov Sarvar

14. 11 ga butun bo’linuvchi eng katta sonni toping(agar bunday sonlar kop bo’lsa, u holda ularning eng kattasini toping,agar bunday son mavjud bo’lmasa shunga mos malumot chiqaring ).

n=int(input("Elementlar soni: "))

a=[]
i=[]
for d in range(1,n+1):
print(d,end="")
f=int(input(" son: "))
a.append(f)
z=0
for f in a:
if f%11==0:
i.append(f)
z+=1
i.sort()
if z==0:
print("Massivda 11ga bo'linadigan element yo'q")
else:
print("11 ga bo'linadigan elementlar soni ",z," ta")
print("Eng kattasi ",i.pop())