UVa 113 - Power of Cryptography
This problem made me suffer a little bit! Given two positive integer $n$ and $p$, this problem asks to find a positive integer $k$ such...
[Read More]
UVa 530 - Binomial Showdown
From a collection of $n$ items, the number of ways we can choose $k$ items, where the order among these $k$ items doesn’t matter, is...
[Read More]
UVa 677 - All Walks of length "n" from the first node
This is a graph problem and it can be by Depth First Search (DFS) and recurisve backtracking.
[Read More]
UVa 729 - The Hamming Distance Problem
The Hamming distance between two strings of bits (binary integers) is the number of corresponding bit positions that differ. This can be found by using...
[Read More]
Maximum Value of nCr
The number of ways we can choose $H$ objects from $N$ objects where the order doesn’t matter is expressed by $\displaystyle{N \choose H}$ where $N,H$...
[Read More]