# Créé par flaroche, le 21/01/2013
from __future__ import division
from lycee import *


def Exercice_5_5_1():
    L=[-1]
    for k in range(20):
        n=-1
        while n in L or n==-1:
            #n=demande("nombre "+str(k+1)+"/20")
            n=randint(1,100)
        if k==0:
            L=[n]
        else:
            L.append(n)
    print L
    n=-1
    while n in L or n==-1:
        n=demande("dernier nombre")

def Exercice_5_5_2_a():
    from random import randint
    L,M=[],[] ; amax=20 ; n = 50
    for k in range(0, n):
        L = L + [randint(0, amax)]
        M = M + [randint(0, amax)]
    print L,'\n',M
    c=0;E=[]
    for k in range(0, n):
        u=L[k]
        for j in range(0, n):
            if u==M[j]:
                E.append(u)
                c=c+1
    print E,'\n Nombre d\'occurences: ',c

def Exercice_5_5_2_b():
    from random import randint
    L,M=[],[] ; amax=4 ; n = 10000
    for k in range(0, n):
        L = L + [randint(1, amax)]
        M = M + [randint(1, amax)]
    c=0;E=[]
    for k in range(0, n):
        #print L[k:k+5],M[k:k+5]
        if L[k]==M[k]:
                E.append(M[k])
                c=c+1
    print E,'\n Nombre d\'occurences: ',c

def Exercice_5_5_3():
    from random import randint
    L,E=[],[] ; amax=1000 ; n = 1000 ;c=0
    for k in range(0, n):
        L = L + [randint(1, amax)]
    for k in range(0, n):
        if L[k] not in E:
            E.append(L[k])
        else:
            c=c+1
        E.sort()
    print'Liste ',L,'\nListe triée',E,'\nNombre de doublons : ',c

def Exercice_5_5_4():
    from random import randint
    L,E=[],[] ; amax=10000000 ; n = 1000 ;c=0
    for k in range(0, n):
        L = L + [randint(1, amax)]
    maxL=-1
    minL=amax+1
    for k in range(0, n):
        if L[k]>maxL:
            maxL=L[k]
        if L[k]<minL:
            minL=L[k]
    print L,'\nle plus petit / grand élément de cette liste a la valeur : ',minL,' / ',maxL,'.'

def Exercice_5_5_5():
    from random import randint
    L=[] ; Lmax=100 ; n = 1000 ; S=0 ; K=0
    for k in range(0, n):
        u=randint(1, Lmax)
        L = L + [u]
        S=S+u;K=K+u*u
    S=S/n;
    K=sqrt((K/n)-(S*S))
    print 'Liste :',L,'\nMoyenne = ',S,'écart-type = ',K

def Exercice_5_5_6():
    from random import randint
    L=[] ; Lmax=100 ; n = 100
    for k in range(0, n):
        L=L+[randint(1, Lmax)]
    P=[];I=[]
    for k in range(0, n):
        if L[k]%2==0:
            P=P+[L[k]]
        else:
            I=I+[L[k]]
    print L,' \n', P,' \n',I


def Exercice_5_5_7():
    St=''
    for u in [0,4]:
        for j in range(1,10):
            Sa=''
            for k in range(2+u,6+u):
                S=str(k)+' '+unichr(215)+' '+str(j)+' = '+str(j*k)
                while len(S)<15:S=S+' '
                Sa=Sa+S
            St=St+Sa+'\n'
        St=St+'\n'
    print St

def Exercice_5_5_8():
    ch_1 = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
    ch_2 = ['Janvier', 'Février', 'Mars', 'Avril', 'Mai', 'Juin', 'Juillet', 'Août', 'Septembre', 'Octobre', 'Novembre', 'Décembre']
    Lmax=0 ; n=len(ch_2); ch_3=[]
    for k in range(n):
        if len(ch_2[k])>Lmax: Lmax=len(ch_2[k])
    for k in range(n):
        while len(ch_2[k])<Lmax: ch_2[k]=ch_2[k]+' '
        S=ch_2[k]+' : '+str(ch_1[k])+' jours\n'
        ch_3=ch_3+[S]
        print S

def Exercice_5_5_9():
    from random import randint
    annee=randint(1,2013)
    if annee%4==0:S=' bissextile'
    else: S=''
    print 'année : ', annee,S
    ch_1 = [28, 29, 30, 31]
    ch_2 = ['Janvier', 'Février', 'Mars', 'Avril', 'Mai', 'Juin', 'Juillet', 'Août', 'Septembre', 'Octobre', 'Novembre', 'Décembre']
    Ra=[3,0,3,2,3,2,3,3,2,3,2,3]
    Rb=[3,1,3,2,3,2,3,3,2,3,2,3]
    Lmax=0 ; n=len(ch_2); ch_3=[];R=[]
    for k in range(n):
        if len(ch_2[k])>Lmax: Lmax=len(ch_2[k])
    for k in range(n):
        while len(ch_2[k])<Lmax: ch_2[k]=ch_2[k]+' '
        if annee%4==0:R=Rb
        else:R=Ra
        S=ch_2[k]+' : '+str(ch_1[R[k]])+' jours'
        ch_3=ch_3+[S]
        print S

def Exercice_5_5_12():
    n=6 ; S=''
    for k in range(n):
        S = S+'*'*(k+1)+' '
    print S

def Exercice_5_5_13():
    n=6 ; S=''
    for k in range(n):
        S = S+ '*'*(k+1) +'\n'
    print S

def Exercice_5_5_14():
    from random import randint
    M=['Janvier', 'Fevrier', 'Mars', 'Avril', 'Mai', 'Juin', 'Juillet', 'Aout', 'Septembre', 'Octobre', 'Novembre', 'Decembre']
    L=[]
    for k in range(0,12):
        a = randint (0,11)
        while a in L:
            a=randint(0,11)
        L.append(a)
    for k in range(0,12):
        L[k]=M[L[k]]
    print L

def sattoloCycle(items):
    from random import randint
    i = len(items)-1
    while i > 0:
        j = randint(0,i)
        items[j],items[i] = items[i],items[j]
        i = i - 1
    return items

def Exercice_5_5_14b():
    M=['Janvier', 'Fevrier', 'Mars', 'Avril', 'Mai', 'Juin', 'Juillet', 'Aout', 'Septembre', 'Octobre', 'Novembre', 'Decembre']
    L=[]
    L=sattoloCycle(M)
    print L

def Exercice_5_5_14c():
    from time import time
    M,L=[],[]
    u=time()
    for k in range(100000):M=M+[k]
    L=sattoloCycle(M)
    v=time()-u
    print v


def Exercice_5_5_15():
    L=[]
    for a in range (0,10):
        for b in range(0,10):
            p=a+10*b+100*a
            L.append(p*26)
    for k in range (0,100):
        c=(L[k])%10
        d=(L[k]//10)%10
        e=(L[k]//100)%10
        f=(L[k]//1000)%10
        g=(L[k]//10000)%10
        if (c==g and d==f) or (d==g and e==f and c==0) or (e==g and c==0 and d==0):
            print 'palindrome originel : ',L[k]//26

#Exercice_5_5_1()
#Exercice_5_5_2()
#Exercice_5_5_3()
#Exercice_5_5_4()
#Exercice_5_5_5()
#Exercice_5_5_6()
#Exercice_5_5_7()
#Exercice_5_5_8()
#Exercice_5_5_9()
#Exercice_5_5_12()
#Exercice_5_5_13()
#Exercice_5_5_14()
#Exercice_5_5_14b()
#Exercice_5_5_14c()
Exercice_5_5_15()