Fibinary Numbers is a mashup of two concepts: binary numbers and the fibonacci sequence. Say, for the binary number 1010, the decimal equivalent is 10, because 1 x 2³ + 0x 2² + 1 x 2¹ + 0x 2⁰ = 10. In fibinary, we use the fibonacci sequence in place of the powers of two.

For reference, here’s the problem statement: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=16&page=show_problem&problem=704

The problem is rather simple. Given two fibinary numbers, output the sum in fibinary representation. So what we could do is take the two numbers, convert them to decimal, then turn the sum back to fibinary.

First thing’s…

Ultra QuickSort is a rather simple problem. You’re dealing with a certain sorting algorithm that processes a sequence of distinct integers by “swapping” two adjacent integers until the list is sorted. The task is to count how many swaps are needed in order to sort the list.

For reference, here’s the problem statement: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1751

We’re basically dealing with an Inversion Count problem. A sequence’s inversion count is a measure of the sequence’s “sortedness,” given by how many swaps are needed in order to sort the sequence. A sorted array’s count is 0. …