import random

#### Exercice 1 #### Listes

# Travail 1

#print(L)


# Travail 2


#print(moy_int([1, 9, 7.1, "a", 0, 8.0, "12"]))


# Travail 3
# def rech_dicho(L,val):
#     g = 0
#     d = len(L)-1
#     if val < L[0] or L[-1] < val :
#         return ...
#     elif val == L[0] or L[-1] == val :
#         ...
#     while d-g ... :
#         m = ...
#         if L[m] > val:
#             ...
#         elif ...:
#             ...
#         else:
#             return True
#     return False

#### Exercice 2 ####
Dpoints={"A":1,"B":3,"C":3,"D":2,"E":1,"F":4,"G":2,"H":3,"I":1,"J":8,"K":10,"L":1,"M":2,"N":1,"O":1,"P":3,"Q":8,"R":1,"S":1,"T":1,"U":1,"V":4,"W":10,"X":10,"Y":10}

# Travail 1


# Travail 2


#print(points("CONCATENEZ"))

# Travail 3


#print(points("CONCATENEZ"))


#### Exercice 3 ####
# Travail 1


#print("degre([1,2,3]) =",degre([1,2,3]))

# Travail 2

#print("eval([1,-2,3],5) =",eval([1,-2,3],5))

# Travail 3


#print("derive([1,2,3]) =",derive([1,2,3]))

# Travail 4


#print("LxLy([0,0,1],0,2,10)=",LxLy([0,0,1],0,2,10))


# Travail 5


# Travail 6



#### Exercice 4 ####
# Travail 1


#print(comptage([0,2,3,2,0,2],4) )

# Travail 2

# def tri(L,N):
#     Ltriee=... # intitialisation liste triée comme vide
#     Lc=... # récupération de la liste de comptage
#     for k in range(len()): # on balaye la liste de comptage
#           ... # à terminer
#
#

#print(tri([0,2,3,2,0,2],4))


# Travail 3

#print(Ltest(100,10))