Editorial for Max's Anger Contest Series 2 P2 - Password Anger

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: maxcruickshanks

Brute force all possible passwords with recursion (or through iteration) that have length N and count the number that hash to M with the given function.

Time Complexity: \mathcal{O}(26^{N}N)


There are no comments at the moment.