def moyenne(liste):
    if liste == ():
        res = none
    else:
        x = 0
        cpt = 0
        for i in range(len(liste)):
            cpt = cpt + 1
            x = x + liste[i]
        res = x / cpt
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if liste == []:
        res = None
    else:
        x = 0
        cpt = 0
        for i in liste:
            x = x + i
            cpt = cpt + 1
        res = x / cpt
        return res

Return the mean of a list of numbers.


def somme(liste):
    res = 0
    for i in liste:
        res = res + i
    return res

Return the sum of the elements in a list.


def maximum(liste):
    if liste == []:
        max = None
    else:
        max = liste[0]
        for i in range(len(liste)):
            if liste[i] > max:
                max = liste[i]
    return max

Return the maximum element in a list of numbers.


def minimum(liste):
    if liste == []:
        min = None
    else:
        min = liste[0]
        for i in range(len(liste)):
            if liste[i] < min:
                min = liste[i]
    return min

Return the minimum element in a list of numbers.


def somme(liste):
    res = 0
    for n in liste:
        res = res + n
    return res


def maximum(liste):
    max = l[0]
    for x in liste:
        if x > max:
            max = x
        return max


def maximum(liste):
    max = l[1]
    for x in liste:
        if x > max:
            max = x
        return max


def maximum(l):
    max = l[0]
    for x in l:
        if x > max:
            max = x
        return max


def maximum(liste):
    max = liste[0]
    for x in liste:
        if x > max:
            max = x
    return max


def maximum(liste):
    res = liste[0]
    for x in liste:
        if x > res:
            res = x
    return res


def maximum(liste):
    res = liste[1]
    for x in liste:
        if x > res:
            res = x
    return res


def maximum(liste):
    for x in liste:
        if x > res:
            res = x
    return res


def maximum(liste):
    res = l(0)
    for x in liste:
        if x > res:
            res = x
    return res


def maximum(liste):
    res = l(1)
    for x in liste:
        if x > res:
            res = x
    return res


def maximum(liste):
    res = 0
    for x in liste:
        if x > res:
            res = x
    return res


def maximum(liste):
    res = []
    for x in liste:
        if x > res:
            res = x
    return res


def maximum(liste):
    res = 0
    for i in range(1, len(liste)):
        if list[i] > res:
            res = list[i]
    return res


def maximum(l):
    max = l[0]
    for i in range(0, len(l)):
        if l[i] > res:
            res = l[i]
    return res


def maximum(liste):
    max = liste[0]
    for i in range(0, len(liste)):
        if liste[i] > max:
            max = l[i]
    return max


def maximum(liste):
    max = liste[0]
    for i in range(0, len(liste)):
        if liste[i] > max:
            max = liste[i]
    return max


def maximum(liste):
    max = liste[1]
    for i in range(1, len(liste)):
        if liste[i] > max:
            max = liste[i]
    return max


def maximum(liste):
    max = liste[1]
    for i in len(liste):
        if liste[i] > max:
            max = liste[i]
    return max


def minimum(liste):
    min = l[0]
    for i in liste:
        if i < min:
            min = i
    return min


def minimum(liste):
    min = l[1]
    for i in liste:
        if i < min:
            min = i
    return min


def minimum(liste):
    for i in liste:
        if i < min:
            min = i
    return min


def maximum(liste):
    maxVal = liste[0]
    for i in range(0, len(liste)):
        if liste[i] > maxVal:
            maxVal = liste[i]
    return maxVal


def maximum(liste):
    maxVal = liste[0]
    for i in range(0, len(liste) + 1):
        if liste[i] > maxVal:
            maxVal = liste[i]
    return maxVal


def maximum(liste):
    max = l[0]
    for i in range(0, len(liste)):
        if max < l[0]:
            max = l[0]
    return max


def maximum(liste):
    max = l[0]
    for i in range(0, len(liste)):
        if max < i:
            max = i
    return max


def maximum(liste):
    res = l[0]
    for i in range(0, len(liste)):
        if res < i:
            res = i
    return res


def sommeNPremiersEntiersPairs(n):
    res = 0
    for n in range(1, n + 1):
        if n % 2 == 0:
            res = res + 1
    return res

assert sommeNPremiersEntiersPairs(1)==0 and sommeNPremiersEntiersPairs(3)==2 and sommeNPremiersEntiersPairs(5)==6 and sommeNPremiersEntiersPairs(-2)==0 and sommeNPremiersEntiersPairs(0)==0 and sommeNPremiersEntiersPairs(10)==30 and sommeNPremiersEntiersPairs(124)==3906 and sommeNPremiersEntiersPairs(-5)==0

Returns the sum of the n first even numbers.


def sommeNPremiersEntiersPairs(n):
    res = 0
    for n in range(1, n + 1):
        if n % 2 == 0:
            res = res + n
    return res


def sommeNbPairs(liste):
    res = 0
    for n in liste:
        if n % 2 == 0:
            res += n
    return res

Return the sum of the even numbers in a list.


def somme(liste):
    res = 0
    for element in liste:
        res = res + element
    return res


def moyenne(liste):
    if len(liste) == 0:
        res = none
    else:
        x = 0
        cpt = 0
        for i in range(len(liste)):
            cpt = cpt + 1
            x = x + liste[i]
        res = x / cpt
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        x = 0
        cpt = 0
        for i in range(len(liste)):
            cpt = cpt + 1
            x = x + liste[i]
        res = x / cpt
    return res

Return the mean of a list of numbers.


def minimum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = liste[0]
        for i in range(len(liste)):
            if res > liste[i]:
                res = liste[i]
    return res


def minimum(liste):
    if len(liste) == 0:
        return None
    min = liste[0]
    for i in range(1, len(liste)):
        if liste[i] < min:
            min = liste[i]
    return min


def somme(liste):
    res = 0
    for x in range(liste):
        res += x
    return res


def somme(liste):
    res = 0
    for x in range[liste]:
        res += x
    return res


def somme(liste):
    res = 0
    for x in range([liste]):
        res += x
    return res


def somme(liste):
    res = 0
    for i in range(len(liste)):
        res += liste[i]
    return res


def maximum(liste):
    if len(list) == 0:
        res = None
    res = []
    for i in range(len(liste)):
        if liste[i + 1] > liste[i]:
            res = liste[i + 1]
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    res = []
    for i in range(len(liste)):
        if liste[i + 1] > liste[i]:
            res = liste[i + 1]
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    res = []
    for i in range(len(liste)):
        if liste[i] + 1 > liste[i]:
            res = liste[i] + 1
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = []
        for i in range(len(liste)):
            if liste[i] + 1 > liste[i]:
                res = liste[i] + 1
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = []
        for i in range(len(liste)):
            if liste[i + 1] > liste[i]:
                res = liste[i + 1]
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = []
        for i in range(len(liste)):
            if liste[1 + i] > liste[i]:
                res = liste[1 + i]
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = []
        for i in range(len(liste)):
            if len(liste + 1) > len(liste):
                res = len(liste + 1)
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = []
        for i in range(len(liste)):
            if len(liste) + 1 > len(liste):
                res = len(liste + 1)
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        for i in range(len(liste)):
            res = res < liste[i]
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = []
        for i in range(len(liste)):
            res = liste[i] > res
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = []
        for i in range(len(liste)):
            if liste[i] > res:
                res = liste[i]
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = []
        for i in range(len(liste)):
            if res < liste[i]:
                res = liste[i]
    return res


def sommeNbPairs(liste):
    if len(liste) == 0:
        res = 0
    else:
        res = 0
        for i in range(len(liste)):
            if liste[i] % 2 == 0:
                res = res + liste[i]
    return res


def somme(liste):
    res = 0
    for elem in liste:
        res = res + elem
    return res


def maximum(liste):
    res = liste[0]
    if res < liste[i]:
        res = liste[i]
    return res


def maximum(liste):
    res = liste[0]
    for i in range(liste):
        if liste[i] > res:
            res = liste[i]
    return res


def sommeNPremiersEntiersPairs(n):
    if n < 0:
        res = 0
    else:
        for x in range(n):
            if x % 2 == 0:
                res = res + x
    return res


def sommeNPremiersEntiersPairs(n):
    if n < 0:
        res = 0
    else:
        res = 0
        for x in range(n):
            if x % 2 == 0:
                res = res + x
    return res


def maximum(liste):
    if len(liste) == 0:
        max = None
    else:
        max = liste[0]
        for i in range(1, len(liste)):
            if liste[i] > max:
                max = liste[i]
    return res


def maximum(liste):
    if len(liste) == 0:
        max = None
    else:
        max = liste[0]
        for i in range(1, len(liste)):
            if liste[i] > max:
                max = liste[i]
    return max


def moyenne(liste):
    res = 0
    compteur = 0
    for element in liste:
        res = res + element
        compteur = compteur + 1
    if compteur == 0:
        res = None
    else:
        res = res / compteur
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if liste == []:
        res = None
    else:
        x = 0
        cpt = 0
        for i in liste:
            x = x + i
            cpt = cpt + 1
            res = x / cpt
            return res

Return the mean of a list of numbers.


def moyenne(liste):
    if liste == []:
        res = None
    else:
        x = 0
        cpt = 0
        for i in range(len(liste)):
            x = x + i
            cpt = cpt + 1
            res = x / cpt
        return res

Return the mean of a list of numbers.


def minimum(liste):
    res = liste[0]
    for i in range(len(liste)):
        if liste[i] > res:
            res = liste[i]
    return res


def maximum(liste):
    res = liste[0]
    for i in range(len(liste)):
        if liste[i] > res:
            res = liste[i]
    return res


def maximum(liste):
    res = l[0]
    for i in range(len(liste)):
        if l[i] > res:
            res = l[i]
    return res


def minimum(liste):
    for i in range(len(liste)):
        if liste[i] > res:
            res = liste[i]
    return res


def minimum(liste):
    res = 0
    for i in range(len(liste)):
        if liste[i] > res:
            res = liste[i]
    return res


def minimum(liste):
    res = 0
    for i in range(len(liste)):
        if liste[i] < res:
            res = liste[i]
    return res


def minimum(liste):
    res = 1000
    for i in range(len(liste)):
        if liste[i] < res:
            res = liste[i]
    return res


def sommeNbPairs(liste):
    res = 0
    for i in range(len(liste)):
        if i % 2 == 0:
            res = res + liste[i]
    return res


def sommeNbPairs(liste):
    res = 0
    for i in range(len(liste)):
        if i % 2 == 0:
            res = res + [i]
    return res


def sommeNbPairs(liste):
    res = 0
    for i in range(len(liste)):
        if i % 2 == 0:
            res = res + i
    return res


def somme(liste):
    if len(liste) == 0:
        res = 0
    else:
        res = 0
        for elem in liste:
            res = res + elem
    return res


def minimum(liste):
    if len(liste) == 0:
        min = None
    else:
        min = liste[0]
        for i in range(1, len(liste)):
            if liste[i] < min:
                min = liste[i]
    return min


def listeSymetrique(l):
    i = 0
    while i < len(l):
        if l[i] != l[-(1 + i)]:
            return False
    return True

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    while i < len(l):
        if l[i] != l[-(1 + i)]:
            return False
        i += 1
        return True

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    while i < len(l):
        if l[i] != l[-(1 + i)]:
            return False
        i += 1
    return True

Check whether a list is symmetrical.


def listeSymetrique(l):
    A = False
    l2 = []
    flag = A
    i = 0
    while flag == A and i < len(l) - 1:
        if l[i] < l[i + 1]:
            l2.append(l[i])
            l2.append(l[i + 1])
            i = +2
        else:
            l2.reverse()
            flag = True
    print(l[i + 1:], l2)
    if l[i + 1:] == l2:
        res = True
    else:
        res = A
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    n = 0
    while i < len(l) and n == 0:
        if l[i] == l[len(l) - i - 1]:
            i = i + 1
            n = 0
        else:
            n = 1
    if n == 0:
        res = True
    else:
        res = False
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    A = False
    l2 = []
    flag = A
    i = 0
    while flag == A and i < len(l) - 1:
        if l[i] < l[i + 1] and l[i] >= 0:
            l2.append(l[i])
            l2.append(l[i + 1])
            i = +2
        elif l[i] > l[i + 1] and l[i] < 0:
            l2.append(l[i])
            l2.append(l[i + 1])
            i = +2
        else:
            l2.reverse()
            flag = True
    print(l[i + 1:], l2)
    if l[i + 1:] == l2:
        res = True
    else:
        res = A
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    A = False
    trouve = A
    i = 0
    j = -1
    while i < len(l) and j <= -len(l):
        if l(i) == l(j):
            trouve = True
        else:
            trouve = A
        i = i + 1
        j = j - 1
    return trouve

Check whether a list is symmetrical.


def listeSymetrique(l):
    trouve = False
    i = 0
    j = -1
    while i < len(l) and j <= -len(l):
        if l(i) == l(j):
            trouve = True
        i = i + 1
        j = j - 1
    return trouve

Check whether a list is symmetrical.


def listeSymetrique(l):
    trouve = True
    i = 0
    j = -1
    while i < len(l) and j <= -len(l):
        if l(i) != l(j):
            trouve = False
        i = i + 1
        j = j - 1
    return trouve

Check whether a list is symmetrical.


def listeSymetrique(l):
    trouve = True
    i = 0
    j = -1
    while i < len(l) and j <= -len(l) and trouve == True:
        if l(i) != l(j):
            trouve = False
        i = i + 1
        j = j - 1
    return trouve

Check whether a list is symmetrical.


def listeSymetrique(l):
    A = True
    trouve = A
    i = 0
    j = -1
    while i < len(l) and j <= -len(l) and trouve == A:
        if l(i) != l(j):
            trouve = False
        else:
            trouve = A
        i = i + 1
        j = j - 1
    return trouve

Check whether a list is symmetrical.


def listeSymetrique(l):
    trouve = True
    i = 0
    j = -1
    while i < len(l) and j <= -len(l) and trouve == True:
        if l[i] != l[j]:
            trouve = False
        i = i + 1
        j = j - 1
    return trouve

Check whether a list is symmetrical.


Check whether a list is symmetrical.


def moyenne(liste):
    somme = 0
    cpt = 0
    for elem in liste:
        somme = somme + elem
        cpt = cpt + 1
    res = somme / cpt
    return res

Return the mean of a list of numbers.


def listeSymetrique(l):
    l2 = l[int(len(l) / 2):]
    l2.reverse()
    l = l[:int(len(l) / 2) + 1]
    res = False
    if l == l2:
        res = True
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    l2 = l[int(len(l) / 2):]
    l2.reverse()
    l = l[:int(len(l) / 2) + 1]
    res = True
    if l != l2:
        res = False
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    l2 = l[int(len(l) / 2):]
    l2.reverse()
    if len(l) % 2 == 0:
        l = l[:int(len(l) / 2)]
    else:
        l = l[:int(len(l) / 2) + 1]
    res = True
    print(l, l2)
    if l != l2:
        res = False
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    res = True
    while res == True and i < len(l) - 1:
        i += 1
        if l[i] != l[len(l) - i - 1]:
            res = False
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    trouve = True
    i = 0
    j = -1
    while i < len(l) and j >= -len(l) and trouve == True:
        if l[i] != l[j]:
            trouve = False
        i = i + 1
        j = j - 1
    return trouve

Check whether a list is symmetrical.


def listeSymetrique(liste):
    res = True
    i = 0
    while i < len(liste) // 2:
        if liste[i] != liste[len(liste) - 1 - i]:
            res = False
        i = i + 1
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    res = True
    i = 0
    while i < len(l) and res == True:
        if l[i] != l[len(l) - i - 1]:
            res = False
        i = i + 1
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    res = True
    i = 0
    j = -1
    while i < len(l) and j < len(l):
        if l[i] == l[j]:
            i = i + 1
            j = j - 1
        else:
            res = False
            i = i + 1
            j = j + 1
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    res = True
    i = 0
    j = len(l) - 1
    while i < len(l) and j < len(l):
        if l[i] != l[j]:
            res = False
        i += 1
        j -= 1
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    if l == []:
        ok = True
    else:
        ok = True
        i = 0
        while i < len(l) and ok:
            if l[i] != l[-i - 1]:
                ok = False
            i += 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) and ok:
        if l[i] != l[-i]:
            ok = False
        i += 1
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) and ok:
        if l[i] != l[-i]:
            ok = False
        i += 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    trouve = True
    i = 0
    j = len(l) - 1
    while i < len(l) and j < len(l) and trouve:
        if l[i] != l[j]:
            trouve = False
        i += 1
        j -= 1
    return trouve

Check whether a list is symmetrical.


def listeSymetrique(l):
    res = True
    i = 0
    j = -1
    while i < len(l) and j < len(l) and res == True:
        if l[i] == l[j]:
            i = i + 1
            j = j - 1
        else:
            res = False
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) and ok:
        if l[i] != l[-i - 1]:
            ok = False
        else:
            ok = True
        i += 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) and ok:
        if l[i] != l[-i - 1]:
            ok = False
        i += 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    j = len(l) - 1
    while i < j and ok:
        if l[i] != l[j]:
            ok = False
        i += 1
        j -= 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) and ok:
        if l[i] != l[i - 1]:
            ok = False
        i = i + 1
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) and ok:
        if l[i] != l[i - 1]:
            ok = False
        i = i + 1
        return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) and ok:
        if l[i] != l[i - 1]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) and ok:
        if l[i] != l[i - 1]:
            ok = False
            i = i + 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    res = True
    i = 0
    while i < len(l) and res:
        if l[i] != l[-i - 1]:
            res = False
        i += 1
    return res

Check whether a list is symmetrical.


Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    ok = True
    while i < len(l) and ok:
        if l[i] != l[i - 1]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    ok = True
    while i < len(l) // 2 and ok:
        if l[i] != l[-i - 1]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def maximum(liste):
    if liste == []:
        res = None
    else:
        res = max(liste)
    return res


def listeSymetrique(l):
    A = False
    trouve = True
    i = 0
    j = -1
    while i < len(l) and j >= -len(l) and trouve != A:
        if l[i] != l[j]:
            trouve = A
        i = i + 1
        j = j - 1
    return trouve

Check whether a list is symmetrical.


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        res = 0
        cpt = 0
        for elem in liste:
            res = res + elem
            cpt = cpt + 1
    return res / cpt

Return the mean of a list of numbers.


Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        res = 0
        cpt = 0
        moy = res / cpt
        for elem in liste:
            res = res + elem
            cpt = cpt + 1
    return moy

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        res = 0
        cpt = 0
        for elem in liste:
            res = res + elem
            cpt = cpt + 1
        moy = res / cpt
    return moy

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        res = 0
        cpt = 0
        moy = 0
        for elem in liste:
            res = res + elem
            cpt = cpt + 1
        moy = res / cpt
    return moy

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        res = 0
        cpt = 0
        for elem in liste:
            res = res + elem
            cpt = cpt + 1
        res = res / cpt
    return res

Return the mean of a list of numbers.


def listeSymetrique(l):
    i = 0
    n = 0
    while i < len(l / 2) and n == 0:
        if l[i] == l[len(l) - i - 1]:
            i = i + 1
            n = 0
        else:
            n = 1
    if n == 0:
        res = True
    else:
        res = False
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    n = 0
    while i < len(l) / 2 and n == 0:
        if l[i] == l[len(l) - i - 1]:
            i = i + 1
            n = 0
        else:
            n = 1
    if n == 0:
        res = True
    else:
        res = False
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    j = -1
    res = True
    while i < len(l) / 2 and j < len(l) / 2 and res == True:
        if l[i] != l[j]:
            res = False
        i = i + 1
        j = j - 1
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    ok = True
    while i < len(liste) and ok:
        if liste[i] != liste[-(i + 1)]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) and ok:
        if l[i] != l[-i - 1]:
            ok = False
        i += 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    ok = True
    while i < len(l) and ok:
        if l[i] != l[-(i + 1)]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) and ok:
        if l[i] != l[-1 - i]:
            ok = False
        i += 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    j = -1
    res = True
    while i < len(l) / 2 and j > -len(l) / 2 and res == True:
        if l[i] != l[j]:
            res = False
        i = i + 1
        j = j - 1
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    j = -1
    res = True
    while i < len(l) / 2 and j < -len(l) / 2 and res == True:
        if l[i] != l[j]:
            res = False
        i = i + 1
        j = j - 1
    return res

Check whether a list is symmetrical.


Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    j = -1
    while i < len(l) / 2 and ok:
        if l[i] != l[j]:
            ok = False
        i += 1
        j -= 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    j = -1
    ok = True
    while i < len(l) / 2 and j > -len(l) / 2 and ok:
        if l[i] != l[j]:
            ok = False
        i = i + 1
        j = j - 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    j = -1
    ok = True
    while i < len(l) / 2 and ok:
        if l[i] != l[j]:
            ok = False
        i = i + 1
        j = j - 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    ok = True
    while i < len(liste) and ok == True:
        if liste[i] != liste[-i - 1]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(liste):
    i = 0
    ok = True
    while i < len(liste) and ok == True:
        if liste[i] != liste[-i - 1]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    ok = True
    while i < len(l) and ok:
        if l[i] != l[-i - 1]:
            ok = False
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(liste) / 2 and ok:
        if l[i] != l[-1 - i]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    ok = True
    i = 0
    while i < len(l) / 2 and ok:
        if l[i] != l[-1 - i]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    res = True
    i = 0
    while i < len(l) / 2 and res == True:
        if l[i] != l[len(l) - i - 1]:
            res = False
        i = i + 1
    return res

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    ok = True
    while i < len(l) / 2 and ok:
        if l[i] != l[1 - i]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def listeSymetrique(l):
    i = 0
    ok = True
    while i < len(l) / 2 and ok:
        if l[i] != l[-1 - i]:
            ok = False
        i = i + 1
    return ok

Check whether a list is symmetrical.


def somme(liste):
    res = 0
    for elem in liste:
        res += elem
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste) - 1):
            if res <= liste[i]:
                res = liste[i]
    return res


def minimum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste) - 1):
            if liste[i] < res:
                res = liste[i]
    return res


def minimum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste) - 1):
            if res > liste[i]:
                res = liste[i]
    return res


def minimum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste)):
            if res > liste[i]:
                res = liste[i]
    return res


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        for elem in liste:
            s += elem
        res = s // len(liste)
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        s = 0
        for elem in liste:
            s += elem
        res = s // len(liste)
    return res

Return the mean of a list of numbers.


Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) == 0:
        res = None
        return res
    else:
        s = 0
        for elem in liste:
            s += elem
        res = s // len(liste)
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) != 0:
        s = 0
        for elem in liste:
            s += elem
        res = s // len(liste)
    else:
        res = None
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) != 0:
        s = 0
        for elem in liste:
            s += elem
        res = s // len(liste)
    else:
        res = 0
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) != 0:
        s = 0
        for elem in liste:
            s += elem
        res = s / len(liste)
    else:
        res = None
    return res

Return the mean of a list of numbers.


def motPalindrome(mot):
    if mot == '':
        ok = True
    else:
        ok = True
        i = 0
        while i < len(mot) and ok:
            if mot[i] != mot[-i - 1]:
                ok = False
            i += 1
    return ok

assert motPalindrome('radar')==True and motPalindrome('')==True and motPalindrome('python')==False and motPalindrome('anna')==True and motPalindrome('abcdefghhgfedcba')==True and motPalindrome('abcdefghhgfedcbb')==False and motPalindrome('abcdefghigfedcba')==False

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    while i < len(mot) // 2 and ok:
        if mot[i] != mot[-i - 1]:
            ok = False
        i += 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    while i < len(mot) and ok:
        ok = mot[i] == mot[-1 - i]
        i += 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = True
    i = 0
    while i < int(len(mot) / 2) and res:
        if mot[i] != mot[-1 - i]:
            res = False
        i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < j and ok:
        if mot[i] != mot[j]:
            ok = False
        i = i + 1
        j = j - 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < j and ok:
        if mot[i] != mot[j]:
            ok = False
        i += 1
        j -= 1
    return ok

Check whether a word is a palindrome.


Check whether a word is a palindrome.


def motPalindrome(mot):
    B = True
    A = False
    flag = 0
    trouve = A
    if mot == '':
        res = B
    else:
        while flag <= len(mot) // 2 and not trouve:
            if mot[flag] == mot[-flag - 1]:
                flag += 1
            else:
                trouve = B
                res = A
    if trouve == A:
        res = B
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = True
    i = 0
    while i < len(mot) / 2 and res == True:
        if mot[i] != mot[len(l) - i - 1]:
            res = False
        i = i + 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = True
    i = 0
    while i < len(mot) / 2 and res == True:
        if mot[i] != mot[len(mot) - i - 1]:
            res = False
        i = i + 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    while i < len(mot) // 2 and ok:
        if mot[i] != mot[-1 - i]:
            ok = False
        i += 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    D = False
    C = 'bcdfghjklmnpqrstvxz'
    B = 'aeiouy'
    A = True
    i = 0
    if len(mot) == 0:
        res = A
        good = A
    else:
        while i < len(mot) - 1 and good == A:
            l1 = mot[i]
            l2 = mot[i + 1]
            if l1 in B and l2 in C or l1 in C and l2 in B:
                res = A
            else:
                res = D
                good = D
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = True
    i = 0
    res = A
    while i < len(mot) and res == A:
        pl = mot[i]
        dl = mot[-i - 1]
        if pl == dl:
            res = A
        else:
            res = False
        i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = True
    i = 0
    j = len(mot) - 1
    while i < len(mot):
        if mot[i] != mot[j]:
            res = False
        i += 1
        j -= 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < len(mot) and ok:
        if i != j:
            ok = False
        i = i + 1
        j = j + 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < len(mot) and ok:
        if i != j:
            ok = False
        i = i + 1
        j = j + 1
    if i == j:
        ok = True
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < len(mot) and ok:
        if mot[i] != mot[j]:
            ok = False
        i = i + 1
        j = j + 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < j and ok:
        if mot[i] != mot[j]:
            ok = False
        i = i + 1
        j = j + 1
    return ok

Check whether a word is a palindrome.


def somme(liste):
    res = 0
    for i in range(len(liste)):
        res = res + liste[i]
    return res


def maximum(liste):
    if []:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste)):
            if res < liste[i]:
                res = liste[i]
    return res


def maximum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste)):
            if res < liste[i]:
                res = liste[i]
    return res


def minimum(liste):
    if len(liste) == 0:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste)):
            if res > liste[i]:
                res = liste[i]
    return res


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        res = 0
        cpt = 0
        for i in range(len(liste)):
            res = res + liste[i]
            cpt += 1
        res = res / cpt
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        res = 0
        for i in range(len(liste)):
            res = res + liste[i]
        res = res / len(liste)
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) == 0:
        res = None
    else:
        res = 0
        for i in range(len(liste)):
            res += liste[i]
        res = res / len(liste)
    return res

Return the mean of a list of numbers.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < len(mot) and ok:
        if i == j:
            ok = true
        else:
            ok = true
        i = i + 1
        j = j - 1
    return None

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < len(mot) and ok:
        if i == j:
            ok = true
        else:
            ok = true
        i = i + 1
        j = j - 1
    return ok

Check whether a word is a palindrome.


Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < len(mot) and ok:
        if i == j:
            ok = True
        else:
            ok = False
        i = i + 1
        j = j - 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < j and ok:
        if i == j:
            ok = True
        else:
            ok = False
        i = i + 1
        j = j - 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < j and ok:
        if mot[i] == mot[j]:
            ok = True
        else:
            ok = False
        i = i + 1
        j = j - 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 1
    while i < len(mot) and ok:
        ok = mot[i] == mot[-1 - i]
        i += 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = True
    i = 0
    j = len(mot) - 1
    while i < len(mot) and res:
        if mot[i] != mot[j]:
            res = False
        i = i + 1
        j = j - 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    if len(mot) == 0:
        res = True
    else:
        ok = True
        i = 0
        while i < len(mot) and ok:
            ok = mot[i] == mot[-1]
            i += 1
        res = ok
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    if len(mot) == 0:
        res = True
    else:
        ok = True
        i = 0
        while i < len(mot) and ok:
            ok = mot[i] == mot[-1]
            i += 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    if len(mot) == 0:
        res = True
    else:
        res = True
        i = 0
        while i < len(mot) and res:
            res = mot[i] == mot[-1]
            i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = True
    if len(mot) == 0:
        res = A
    else:
        res = A
        i = 0
        while i < len(mot) and res:
            if mot[i] == mot[-1]:
                res = A
            i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = True
    if len(mot) == 0:
        res = A
    else:
        res = A
        i = 0
        while i < len(mot) and res:
            if mot[i] == mot[-i]:
                res = A
            i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = True
    if len(mot) == 0:
        res = A
    else:
        res = A
        i = 0
        while i < len(mot) and res:
            if mot[i] == mot[-i - 1]:
                res = A
            i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = True
    if len(mot) == 0:
        res = A
    else:
        res = A
        i = 0
        while i < len(mot) and res == A:
            if mot[i] == mot[-i]:
                res = A
            i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = True
    if len(mot) == 0:
        res = A
    else:
        res = A
        i = 0
        while i < len(mot) and res == A:
            if mot[i] == mot[-i]:
                res = A
                i += 1
            else:
                res = False
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = True
    if len(mot) == 0:
        res = A
    else:
        res = A
        i = 0
        while i < len(mot) and res == A:
            if mot[i // 2] == mot[-i // 2]:
                res = A
                i += 1
            else:
                res = False
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = True
    if len(mot) == 0:
        res = A
    else:
        res = A
        i = 0
        while i < len(mot) and res == A:
            if mot[i // 2] == mot[-i // 2]:
                res = A
                i += 1
            if mot[i // 2] != mot[-i // 2]:
                res = False
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = True
    if len(mot) == 0:
        res = A
    else:
        res = A
        i = 0
        while i < len(mot) and res == A:
            if mot[i // 2] == mot[-i // 2]:
                res = A
                i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    while i < len(mot) // 2 and ok:
        if mot[i] != mot[-i - 1]:
            ok = False
        i = i + 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = 0
    ok = True
    while i < len(mot) and ok:
        if mot[i] != mot[-i - 1]:
            ok = False
        i = i + 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    i = 0
    ok = True
    while i < len(mot) and ok:
        if mot[i] != mot[-i - 1]:
            ok = False
        i = i + 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    i = 0
    res = True
    while i < len(mot) and res == True:
        if mot[i] != mot[-i - 1]:
            res = False
        i = i + 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    palindrome = True
    i = 0
    j = len(mot) - 1
    i = 0
    while i < j and palindrome:
        if mot[i] != mot[j]:
            palindrome = False
    i = i + 1
    j = j - 1
    return palindrome

Check whether a word is a palindrome.


def motPalindrome(mot):
    palindrome = True
    i = 0
    j = len(mot) - 1
    i = 0
    while i < j and palindrome:
        if mot[i] != mot[j]:
            palindrome = False
        i = i + 1
        j = j - 1
    return palindrome

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = True
    i = 0
    while i < len(mot):
        if mot[i] != mot[-i - 1]:
            res = False
        i = i + 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = False
    if mot[0] == mot[-1]:
        res = True
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = True
    i = 0
    trouve = False
    res = A
    while i < len(mot) / 2 and not trouve:
        if mot[i] == mot[-i - 1]:
            i += 1
            trouve = A
    if trouve:
        res = A
    return res

Check whether a word is a palindrome.


Check whether a word is a palindrome.


def motPalindrome(mot):
    A = False
    res = A
    if mot[0] == mot[-1]:
        res = True
    else:
        res = A
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = False
    if mot(0) == mot(-1):
        res = True
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = False
    i = 0
    while i < len(mot) and not res:
        if mot[i] == mot[-1 - i]:
            res = True
        i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = True
    i = 0
    while i < len(mot) and res:
        if mot[i] != mot[-1 - i]:
            res = False
        i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    j = len(mot) - 1
    while i < j and ok:
        if mot[i] != mot[j]:
            ok = False
        i += 1
        j -= 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    A = False
    i = 0
    ok = True
    res = A
    while i < len(mot) / 2 and ok:
        if mot[i] != mot[-i - 1]:
            ok = A
        i += 1
    if ok:
        res = True
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    B = False
    A = True
    c = A
    while i < len(mot) / 2 and c:
        if mot[i] == mot[len(mot) - i]:
            c = A
        else:
            c = B
    if c == A:
        return A
    else:
        return B

Check whether a word is a palindrome.


def motPalindrome(mot):
    B = False
    A = True
    i = 0
    c = A
    while i < len(mot) / 2 and c:
        if mot[i] == mot[len(mot) - i]:
            c = A
        else:
            c = B
    if c == A:
        return A
    else:
        return B

Check whether a word is a palindrome.


def motPalindrome(mot):
    B = False
    A = True
    i = 0
    c = A
    while i < len(mot) / 2 and c:
        if mot[i] == mot[len(mot) - i - 1]:
            c = A
        else:
            c = B
    if c == A:
        return A
    else:
        return B

Check whether a word is a palindrome.


def motPalindrome(mot):
    B = False
    A = True
    i = 0
    c = A
    while i < len(mot) / 2 and c:
        if mot[i] == mot[len(mot) - i - 1]:
            c = A
        else:
            c = B
        i = i + 1
    if c == A:
        return A
    else:
        return B

Check whether a word is a palindrome.


def motPalindrome(mot):
    palindrome = True
    i = 0
    while i < len(mot) and palindrome == True:
        if mot[i] != mot[-i - 1]:
            palindrome = False
        i = i + 1
    return palindrome

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    while i < len(mot) // 2 and ok:
        if mot[i] != mot[-i - 1]:
            ok = False
        i += 1
        return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = False
    if mot == '':
        res = True
    else:
        mot2 = ''
        for i in mot:
            mot2 = i + mot2
        if mot1 == mot2:
            res = True
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = False
    if mot == '':
        res = True
    else:
        mot2 = ''
        for i in mot:
            mot2 = i + mot2
        if mot == mot2:
            res = True
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    while i < len(mot) / 2 and ok:
        if mot[i] != mot[-1 - i]:
            ok = False
        i = i + 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    if len(mot) == 0:
        res = True
    else:
        res = True
        i = 0
        while i < len(mot) // 2 and res:
            if mot[i] != mot[-(i + 1)]:
                res = False
            i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = True
    i = 0
    while i < len(mot) // 2 and res:
        if mot[i] != mot[-i - 1]:
            res = False
        i += 1
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    ok = True
    i = 0
    while i < len(mot) // 2 and ok:
        if mot[i] != mot[-i - 1]:
            ok = False
        i += 1
    return ok

Check whether a word is a palindrome.


def motPalindrome(mot):
    if len(mot) == 0:
        res = True
    else:
        res = True
        i = 0
        while i < len(mot) // 2 and res:
            if mot[i] != mot[-(i + 1)]:
                res = False
    return res

Check whether a word is a palindrome.


Check whether a word is a palindrome.


def motPalindrome(mot):
    res = True
    i = 0
    while i < len(mot) // 2 and res:
        if mot[i] != mot[-i - 1]:
            res = False
    return res

Check whether a word is a palindrome.


def motPalindrome(mot):
    res = True
    i = 0
    while i < len(mot) // 2 and res:
        if mot[i] != mot[-1 - i]:
            res = False
        i += 1
    return res

Check whether a word is a palindrome.


def listeDecroissante(scores):
    res = True
    for i in range(len(scores) - 1):
        if scores[i] < scores[i + 1]:
            res = False
    return res

assert listeDecroissante([352100, 325410, 312785, 220199, 127853])==True and listeDecroissante([352100, 325410, 312785, 127853, 220199])==False and listeDecroissante([])==True and listeDecroissante([0, 2])==False and listeDecroissante([0])==True and listeDecroissante([-100, -50, 0])==False and listeDecroissante([-100, -200, -300])==True

Check whether a list is sorted in descending order.


def listeDecroissante(scores):
    c = True
    i = 0
    while i < len(scores) - 1 and c:
        if scores[i] < scores[i + 1]:
            c = False
        i = i + 1
    return c


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1:
        if scores[i] > scores[i + 1]:
            ok = False
        i = i + 1
    return ok


def listeDecroissante(scores):
    ok = True
    if len(scores) == 0:
        ok = True
    i = 0
    while i < len(scores) - 1:
        if scores[i] < scores[i + 1]:
            ok = False
        i = i + 1
    return ok


def listeDecroissante(scores):
    i = 0
    ok = True
    while i < len(scores):
        if scores[i] < scores[i + 1]:
            ok = False
        i += 1
    return ok


def listeDecroissante(scores):
    i = 0
    ok = True
    while i < len(scores) - 1:
        if scores[i] < scores[i + 1]:
            ok = False
        i += 1
    return ok


def listeDecroissante(scores):
    res = True
    i = 0
    while i < len(scores) - 1 and res:
        if scores[i] <= scores[i + 1]:
            res = False
    return res


def listeDecroissante(scores):
    res = True
    i = 0
    while i < len(scores) - 1 and res:
        if scores[i] <= scores[i + 1]:
            res = False
        i = i + 1
    return res


def listeDecroissante(scores):
    res = False
    if scores == []:
        res = True
    for i in range(len(scores) - 1):
        if scores[i] > scores[1 + i]:
            res = True
    return res


def listeDecroissante(scores):
    res = False
    if scores == []:
        res = True
    for i in range(len(scores)):
        if scores[i] > scores[1 + i]:
            res = True
    return res


def listeDecroissante(scores):
    res = False
    if scores == []:
        res = True
    for i in range(len(scores)):
        if scores[i] < scores[1 - i]:
            res = True
    return res


def listeDecroissante(scores):
    A = False
    res = A
    if scores == []:
        res = True
    for i in range(len(scores) - 1):
        if scores[i] > scores[1 + i]:
            res = A
    return res


def listeDecroissante(scores):
    res = False
    if scores == []:
        res = True
    for i in range(len(scores) - 1):
        if scores[i] > scores[i + 1]:
            res = True
    return res


def listeDecroissante(scores):
    res = False
    if scores == []:
        res = True
    for i in scores:
        if scores[i] > scores[i + 1]:
            res = True
    return res


def listeDecroissante(scores):
    res = True
    if scores == []:
        res = True
    for i in range(len(scores) - 1):
        if scores[i] <= scores[i + 1]:
            res = False
    return res


def listeDecroissante(scores):
    if scores == [] or res == True:
        res = True
    for i in range(len(scores) - 1):
        if scores[i] <= scores[i + 1]:
            res = False
    return res


def listeDecroissante(scores):
    scorePrec = scores[0]
    ok = True
    i = 1
    while i < len(scores) and ok:
        if scorePrec <= scores[i]:
            ok = False
            i += 1
    return ok


def listeDecroissante(scores):
    scorePrec = scores[0]
    ok = True
    i = 1
    while i < len(scores) and ok:
        if scorePrec <= scores[i]:
            ok = False
        i += 1
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1 and ok:
        ok = scores[i] > scores[i + 1]
        i += 1
    return ok


def listeDecroissante(scores):
    if scores == []:
        ok = True
    else:
        scorePrec = scores[0]
        ok = True
        i = 1
        while i < len(scores) and ok:
            if scorePrec <= scores[i]:
                ok = False
            i += 1
    return ok


def listeDecroissante(scores):
    if scores == []:
        ok = True
    else:
        scorePrec = scores[0]
        ok = True
        i = 1
        while i < len(scores) and ok:
            if scorePrec <= scores[i]:
                ok = False
            scorePrec = scores[i]
            i += 1
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1 and ok:
        if scores[i] < scores[i + 1]:
            ok = False
        i += 1
    return ok


def listeDecroissante(scores):
    res = []
    for i in range(len(scores) - 1):
        if scores[i] > scores[i + 1]:
            res = True
        else:
            res = False
    return res


def listeDecroissante(scores):
    i = 0
    while i < len(scores) - 1:
        if scores[i] > scores[i + 1]:
            return True
        else:
            return False
    i = i + 1


def listeDecroissante(scores):
    res = True
    for i in range(len(scores) - 1):
        if scores[i] > scores[i + 1]:
            res = True
        else:
            res = False
    return res


def listeDecroissante(scores):
    i = 0
    res = True
    while i < len(scores) - 1:
        if scores[i] < scores[i + 1]:
            res = False
    i = i + 1
    return res


def listeDecroissante(scores):
    for i in range(len(scores)):
        if scores[i] < scores[i + 1]:
            return False
        else:
            return True


def listeDecroissante(scores):
    if scores == []:
        return True
    else:
        for i in range(len(scores)):
            if scores[i] < scores[i + 1]:
                return False
            else:
                return True


def listeDecroissante(scores):
    ok = False
    while i < len(liste) and not ok:
        if liste[i] > liste[i + 1]:
            res = True
        else:
            res = ok
        return ok


def listeDecroissante(scores):
    ok = False
    while i < len(liste) and not ok:
        if liste[i] > liste[i + 1]:
            res = True
        else:
            res = ok
    return ok


def listeDecroissante(scores):
    ok = False
    while i < len(scores) and not ok:
        if liste[i] > liste[i + 1]:
            res = True
        else:
            res = ok
    return ok


def listeDecroissante(scores):
    ok = True
    while i < len(scores) and ok:
        if liste[i] > liste[i + 1]:
            res = ok
        else:
            res = Faux
    return res


def listeDecroissante(scores):
    ok = True
    while i < len(scores) and ok:
        if liste[i] > liste[i + 1]:
            res = ok
        else:
            res = False
    return res


def listeDecroissante(scores):
    ok = True
    while i < len(scores) and ok:
        if liste[i] >= liste[i + 1]:
            res = ok
        else:
            res = False
    return res


def listeDecroissante(scores):
    res = True
    i = 0
    while i < len(score) - 1:
        if score[i] < score[i + 1]:
            return False
        i = i + 1
    return res


def listeDecroissante(scores):
    res = True
    i = 0
    while i < len(scores) - 1:
        if scores[i] < scores[i + 1]:
            return False
        i = i + 1
    return res


def listeDecroissante(scores):
    ok = True
    while i < len(scores) and ok:
        if scores[i] >= scores[i + 1]:
            res = ok
        else:
            res = False
    return res


def listeDecroissante(scores):
    ok = True
    while i < len(scores) and ok:
        if scores[i] >= scores[i + 1]:
            res = ok
    return res


def listeDecroissante(scores):
    res = True
    for i in range(len(scores) - 1):
        if scores[i] < scores[i + 1]:
            res = False
    return res


def listeDecroissante(scores):
    for i in range(len(scores) - 1):
        if scores[i] < scores[i + 1]:
            return False
    return True


def listeDecroissante(scores):
    i = 0
    ok = True
    while i < len(scores) - 1 and ok:
        if scores[i] < scores[i + 1]:
            ok = False
        i += 1
    return res


def listeDecroissante(scores):
    i = 0
    ok = True
    while i < len(scores) - 1 and ok:
        if scores[i] < scores[i + 1]:
            ok = False
        i += 1
    return ok


def listeDecroissante(scores):
    c = True
    i = 0
    while i < len(score) - 1 and c:
        if score[i] < score[i + 1]:
            c = False
        i = i + 1
    return c


def listeDecroissante(score):
    c = True
    i = 0
    while i < len(score) - 1 and c:
        if score[i] < score[i + 1]:
            c = False
        i = i + 1
    return c


def listeDecroissante(scores):
    res = True
    i = 0
    while i < len(scores) - 1 and res:
        if scores[i] < scores[i + 1]:
            res = False
        i = i + 1
    return res


def listeDecroissante(scores):
    res = True
    x = score[0]
    for elem in score:
        if x < elem:
            res = False
        x = elem
    return res


def listeDecroissante(scores):
    res = True
    x = scores[0]
    for elem in scores:
        if x < elem:
            res = False
        x = elem
    return res


def listeDecroissante(scores):
    i = 0
    while i < len(scores) - 1:
        if scores[i] < scores[i + 1]:
            return False
        i += 1
    return True


def listeDecroissante(scores):
    res = True
    if len(scores) == 0:
        return res
    else:
        x = scores[0]
        for elem in scores:
            if x < elem:
                res = False
            x = elem
        return res


def listeDecroissante(scores):
    res = True
    if len(scores) == 0:
        return res
    else:
        x = True
        i = 0
        while i < len(scores) and x:
            if scores[i] < scores[i + 1]:
                x = False
            i = i + 1
        return x


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(lscore) - 1 and ok:
        if lscore[i] <= lscore[i + 1]:
            ok = False
        i = i + 1
    return ok


def listeDecroissante(scores):
    i = 0
    while i < len(scores) - 1:
        if scores[i] < scores[i + 1]:
            return False
        i = i + 1
    return True


def somme(liste):
    res = 0
    for i in liste:
        res = res + res[i]
    return res


def somme(liste):
    res = 0
    for i in liste:
        res = res + i
    return res


def minimum(liste):
    min = 0
    for i in liste:
        if l[i] < l[i + 1]:
            min = l[i]
        else:
            min = None
    return min


def minimum(liste):
    min = 0
    for i in liste:
        if liste[i] < liste[i + 1]:
            min = l[i]
        else:
            min = None
    return min


def minimum(liste):
    min = 0
    for i in liste:
        if liste[i] < liste[i + 1]:
            min = liste[i]
        else:
            min = None
    return min


def minimum(liste):
    min = liste[0]
    for i in range(1, len(liste), 1):
        if liste[i] < liste[i + 1]:
            min = liste[i]
        else:
            min = None
    return min


def minimum(liste):
    min = liste[0]
    for i in range(1, len(liste), -1):
        if liste[i] < liste[i + 1]:
            min = liste[i]
        else:
            min = None
    return min


def minimum(liste):
    min = liste[0]
    for i in liste:
        if liste[i] < liste[i + 1]:
            min = liste[i]
        else:
            min = None
    return min


def minimum(liste):
    min = liste[0]
    for i in liste:
        if i < min:
            min = i
    return min


def minimum(liste):
    min = liste[1]
    for i in liste:
        if i < min:
            min = i
    return min


def minimum(liste):
    res = liste[0]
    for n in liste:
        if n < res:
            res = n
    return res


def minimum(liste):
    for i in liste:
        if i < min:
            min = i
    return min


def minimum(liste):
    for i in liste:
        if i < res:
            res = i
    return res


def minimum(liste):
    res = liste[0]
    for i in liste:
        if i < res:
            res = i
        else:
            res = None
    return res


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1 and ok:
        if scores[i] < scores[i + 1]:
            ok = False
        i += 1
    else:
        if len(scores) == []:
            ok = True
    return ok


def listeDecroissante(scores):
    if len(scores) == 0:
        ok = True
    else:
        ok = True
        i = 0
        while i < len(scores) and ok:
            if scores[i] < scores[i + 1]:
                ok = False
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) and ok:
        if scores[i] < scores[i + 1]:
            ok = False
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) and ok:
        if scores[i] < scores[i + 1]:
            ok = False
        i += 1
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1 and ok:
        if scores[i] < scores[i + 1]:
            ok = False
        i += 1
    return ok


def somme(liste):
    res = 0
    for elem in range(liste):
        res += elem
    return res


def somme(liste):
    res = 0
    for elem in liste:
        res += elem
    return res


def maximum(liste):
    if liste == []:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste) - 1):
            if liste[i] > res:
                res = liste[i]
    return res


def maximum(liste):
    if liste == []:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste) - 1):
            if liste[i] > liste[i + 1]:
                res = liste[i]
    return res


def minimum(liste):
    if liste == []:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste) - 1):
            if liste[i] < res:
                res = liste[i]
    return res


def minimum(liste):
    if liste == []:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste) - 1):
            if liste[i] < liste[i + 1]:
                res = liste[i]
    return res


def minimum(liste):
    if liste == []:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste)):
            if liste[i] < res:
                res = liste[i]
    return res


def minimum(liste):
    if liste == []:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste)):
            if liste[i] < liste[i + 1]:
                res = liste[i]
    return res


def minimum(liste):
    if liste == []:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste)):
            if liste[i] > liste[i + 1]:
                res = liste[i]
    return res


def maximum(liste):
    if liste == []:
        res = None
    else:
        res = liste[0]
        for i in range(1, len(liste)):
            if liste[i] > res:
                res = liste[i]
    return res


def moyenne(liste):
    if liste == []:
        res = None
    else:
        res = 0
        for elem in liste:
            res += elem
        res = res / len(liste)
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if liste == []:
        res = None
    res = 0
    for elem in liste:
        res += elem
    res = res / len(liste)
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if liste == []:
        res = None
    else:
        res = 0
        for elem in liste:
            res += elem
        res /= len(liste)
    return res

Return the mean of a list of numbers.


def moyenne(liste):
    if liste == []:
        res = None
    else:
        res = 0
        for elem in liste:
            res += elem
        res = len(liste)
    return res

Return the mean of a list of numbers.


Return the mean of a list of numbers.


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1:
        if scores[i] > score[i + 1]:
            ok = False
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1:
        if scores[i] > score[i + 1]:
            ok = False
        i = i + 1
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1:
        if scores[i] > scores[i + 1]:
            ok = False
        i = i + 1
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    if len(scores) > 1:
        while i < len(scores) - 1:
            if scores[i] > scores[i + 1]:
                ok = False
            i = i + 1
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    if len(scores) > 1:
        while i < len(scores) - 1 and ok:
            if scores[i] > scores[i + 1]:
                ok = False
            i = i + 1
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1 and ok:
        if scores[i] > scores[i + 1]:
            ok = False
        i = i + 1
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1 and ok:
        ok = scores[i] > scores[i + 1]
        i += 1
    return ok


def listeDecroissante(scores):
    ok = True
    i = 0
    while i < len(scores) - 1 and ok:
        if scores[i] < scores[i + 1]:
            ok = False
        i += 1
    return ok


def somme(liste):
    res = 0
    for i in range(len(liste)):
        res += liste[i]
    return res


def somme(liste):
    res = 0
    for i in liste:
        res += liste[i]
    return res


def somme(liste):
    res = 0
    for elem in liste:
        res += liste[elem]
    return res


def somme(liste):
    res = 0
    for elem in liste:
        res = res + liste[elem]
    return res


def somme(liste):
    res = 0
    for elem in liste:
        res += elem
    return res


def maximum(liste):
    res = liste[0]
    for elem in liste:
        if elem > res:
            res = elem
    return res


def maximum(liste):
    if len(liste) != 0:
        max = liste[0]
        for elem in liste:
            if elem > max:
                max = elem
        return max


def minimum(liste):
    if len(liste) != 0:
        min = liste[0]
        for elem in liste:
            if elem < min:
                min = elem
        return min


def moyenne(liste):
    if len(liste) != 0:
        for elem in liste:
            num += elem
        res = num / len(liste)
        return res

Return the mean of a list of numbers.


def moyenne(liste):
    if len(liste) != 0:
        num = 0
        for elem in liste:
            num += elem
        res = num / len(liste)
        return res

Return the mean of a list of numbers.