Created by cahier-algo-2de-indice2019
Created on November 27, 2018
133 Bytes
def puits(H): M=100 S=100 N=1 while N<H: M=M+40 S=S+M N=N+1 return(S)