Tabelul functiilor strict crescatoare pentru ; f :A -> B
unde ; A={1 , 2 , 3 , 4} si B={1 , 2 , 3 , 4 , 5 , 6}. Deci;
x -> 1 , 2 , 3 , 4
f(x)-> 1 , 2 , 3 , 4
f(x)-> 1 , 3 , 4 , 5
f(x)-> 1 , 2 , 4 , 5
.....e.t.c. in total , "combinari de 6 luate cate 4 notate cu C(6,4)"=(6!)/[(4!).(2!)]=15
Sau
integer n, c
read n
c ← 0
while (n <> 0) do
if (n mod 2 = 1) then
c ← c + 1
endif
n ← n div 2
endwhile
write c
