Editorial for DMOPC '17 Contest 5 P1 - IOI 101

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

One can iterate through every character of the string, and check if it is in the set \{0,1,3,4,5,6,8,9\}, and replace it with its corresponding character.

Time Complexity: \mathcal O(N)


There are no comments at the moment.