def somme(L):
    s=0
    n=len(L)
    for k in range(n):
        s+=L[k]
    return s

def somme_entiers(n):
    s=0
    for k in range (n):
        s+=k
    return s

def carres(n):
    L=[]
    for k in range(n):
        L.append(k**2)
    return L

def somme_carres(n):
    L=carres(n)
    s=somme(L)
    return s

def reverse(L):
    I=[]
    n=len(L)
    for k in range(n):
        I.append(L[n-1-k])
    return I

def dernier_7(L):
    n=len(L)
    i=-1
    for k in range(n):
        if L[k]==7:
            i=k
    return i

def tous_les_7(L):
    K=[]
    n=len(L)
    for k in range(n):
        if L[k]==7:
            K.append(k)
    return K

def que_des_7(L):
    t=True
    n= len(L)
    for k in range(n):
        if L[k]!=7:
            t=False
    return t

def position_max(L):
    i=0
    m=L[0]
    n=len(L)
    for k in range(1,n):
        if L[k]>m:
            m=L[k]
            i=k
    return i