% Définitions récursives traditionnelles

fac(0, 1):- !.
fac(N, F) :- P is N-1, fac(P, G), F is N*G.

bin(P, 0, 1):- !.
bin(Q, Q, 1):- !.
bin(P, Q, R) :- P1 is P-1, Q1 is Q-1, 
                bin(P1, Q1, R1), bin(P1, Q, R2),
                R is R1+R2.
                
liliste([X|S]):- read(X), not( X ='F'), !, liliste(S).
liliste([]). 
