Editorial for DMOPC '15 Contest 1 P3 - Itami and Cipher

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: cheesecake

As mentioned in the problem statement, there are only 26 possible shifts (0 \le \text{shift} \le 25). Knowing this, we can simply search for string T in every single shift of string S in increasing order and output the first viable shift.

Time Complexity: \mathcal{O}(|S| \times |T|), proof is left as an exercise for the reader.


There are no comments at the moment.