Μπάμπης Μπουλής
Master of Science in Computer Engineering
Θέμα-Δ Απάντηση (25 μονάδες)
# – – – – – – ερώτημα Δ4 – – – – – – – – – – – – – – – – –
def search(list1,list2,key1,key2):
—-thesi = -1
—-for i in range(0,n,1):
—-—-if (key1 == list1[i]) and (key2 == list2[i]):
—-—-—-thesi = i
—-return thesi
# – – – – – – – – – – – – – – – – – – – – – – – – – – – – –
n=16
on = []
xo = []
ep = []
# – – – – – – ερώτημα Δ1 – – – – – – – – – – – – – – – – –
for i in range(0,n):
—-on.append(raw_input(“Δώσε όνομα αθλητή: “))
—-xo.append(raw_input(“Δώσε χώρα αθλητή: “))
—-ep.append(input(“Δώσε μέγιστη βολή σε μέτρα: “))
print “on=”,on
print “xo=”,xo
print “ep=”,ep
# – – – – – – ερώτημα Δ2 – – – – – – – – – – – – – – – – –
onoma = raw_input(“Δώσε το όνομα ενός αθλητή: “)
xora = raw_input(“Δώσε την χώρα του: “)
t = search(on,xo,onoma,xora)
if t == -1:
—-print “ο αθλητής δεν βρέθηκε”
else:
—-print “αθλητής”,on[t],“χώρα”,xo[t],“επίδοση”,ep[t]
# – – – – – – ερώτημα Δ3 – – – – – – – – – – – – – – – – –
for i in range(1 , n, 1):
—-for j in range(n-1, i-1 , -1):
—-—-if ep[j] > ep[j-1] :
—-—-—-ep[j], ep[j-1] = ep[j-1], ep[j]
—-—-—-on[j], on[j-1] = on[j-1], on[j]
—-—-—-xo[j], xo[j-1] = xo[j-1], xo[j]
print “Κατάταξη σε φθίνουσα σειρά ως προς την επίδοση”
for i in range (0,n,1):
—-print on[i], xo[i], ep[i]
# – – – – – – – – – – – – – – – – – – – – – – – – – – – – –