Kth tuple from the combination?

Правка en2, от somnath796, 2022-01-10 15:47:10

Wael wrote on a single paper all different possible tuples (x,y,z) such that 1<=x,y,z<=N.Then ,he sorted them in the following order. First sort in increasing order according to their sum(x,y,z) . If two tuples have same sum ,then the tuple with smaller value of x is put first. Output the kth tuple from the sequence in format (x+2*y+3*z).

Input N= 2 K= 1

Output 6

Input N= 2 K= 3

Output 8

Input N= 50 K= 67

Output 19

Can anyone explain me the approach?

Теги combinations, backtracking

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский somnath796 2022-01-10 15:47:10 42
en1 Английский somnath796 2022-01-10 15:43:34 500 Initial revision (published)