def distanceH(S1,S2):

s=0
for i in range(len(S1)):
if(S1[i]!=S2[i]):
s+=1
return s
def binaire(N):
s=str(N%2)
q=N//2
while(q!=0):
s=str(q%2)+s
q=q//2
return s
def distance_Nbre(A,B):
return distanceH(binaire(A),binaire(B))
def distanceh_liste(L):
s=distanceH(L[0],L[1])
for i in range(len(L)):
for j in range(i+1,len(L)):
m=distanceH(L[i],L[j])
if(s>m):
s=m
return s
############################################
def derivee(P):
if(len(P)<2):
return[0]
D=P[1:]
for i in range(len(P)):
D[i]=(i+1)*D[i]
return D
def somme(P,Q):
s=[]
if(len(P)==0 or len(Q)==0):
return P+Q
return([P[0]+Q[0]]+somme(P[1:],Q[1:]))
def puissance(x,n):
if(n==0):
return 1
return x*puissance(x;n-1)
def valeur(P,x):
s=0
for i in range(len(P)):
s+=P[i]*puissance(x,i)
return s