

## matrices (ou listes de listes)

### question 1 ###
def ligne(m, k):
    assert k < len(m)
    return m[k]
### / ###

### question 2 ###
def colonne(m, k):
    assert k < len(m[0])
    c = []
    for i in range(len(m)):
        c.append(m[i][k])
    return c
### / ###

### question 3 ###
m = [ [0]*15 ] * 15

for i in range(len(m)):
    m[i][i] = 1

m
### / ###


## Dessiner dans une matrice

### affichage ###
import matplotlib.pyplot as plt

def affiche(m):
    plt.matshow(m, cmap = 'Greys')
    fig = plt.show()
### / ###

### question 4 ###
def diag1(n):
    m=[ [0]*n for _ in range(n) ]
    for i in range(n):
        m[i][i]=1
    return m

def diag2(n):
    m=[ [0]*n for _ in range(n) ]
    for i in range(n):
        m[n-1-i][i]=1
    return m
### / ###

### question 5 ###
def croix(n):
    assert(n%2==1)
    m=[ [0]*n for _ in range(n) ]
    for i in range(n):
        m[n//2][i]=1
        m[i][n//2]=1
    return m
### / ###

### question 6 ###
def triangle1(n):
    m=[ [0]*n for _ in range(n) ]
    for i in range(n):
        for j in range(i+1):
            m[i][j]=1
    return m

def triangle2(n):
    m=[ [0]*n for _ in range(n) ]
    for i in range(n):
        for j in range(n-i-1,n):
            m[i][j]=1
    return m
### / ###

### question 7 ###
def triangle3(n):
    m=[ [0]*n for _ in range(n) ]
    for i in range(n):
        for j in range(n-i):
            m[i][j]=1
    return m

def triangle4(n):
    m=[ [0]*n for _ in range(n) ]
    for i in range(n):
        for j in range(i,n):
            m[i][j]=1
    return m
### / ###


## calculs de sommes et produits doubles

### question 8 ###
def somme(m):
    s = 0
    for ligne in m:
        for nb in ligne:
            s = s+nb
    return s
### / ###

### question 9 ###
def somme_double(n):
    mat = [ [1/(i**2+j**2) for j in range(1,n+1)] for i in range(1,n+1) ]
    return somme(mat)
### / ###

### question 10 ###
def somme_aux(i,n):
    s = 0
    for j in range(1,n+1):
        s = s + 1/(j**2+i**2)
    return s

def somme_double2(n):
    s = 0
    for i in range(1,n+1):
        s = s + somme_aux(i,i)
    return s

def somme_double3(n):
    s = 0
    for i in range(1,n+1):
        for j in range(1,i+1):
            s = s + 1/(j**2+i**2)
    return s
### / ###


## Deux éléments les plus proches dans une liste

### question 11 ###
def plusProches(l):
    dist=abs(l[1]-l[0])
    iopt=0
    jopt=1
    for i in range(len(l)):
        for j in range(len(l)):
            if j != i and abs(l[i]-l[j])<dist:
                dist=abs(l[i]-l[j])
                iopt=i
                jopt=j
    return iopt, jopt
### / ###
