SRM233DIV1

TLDR: While reading about SRM233DIV1, idea of dynamically modifiable input crossed my mind.

I was just reading through a topcoder tutorial from the link:

[How to find a solution](https://www.topcoder.com/community/data-science/data-science-tutorials/how-to-find-a-solution/)

While I was reading the article, there was a paragraph which was discussing about SRM 233 DIV1 problem. SmartWordToy, replace the characters in the input such a way that it goes from input to output, without passing through forbidden words.

An idea/doubt striked, when I read this sentence:

With a single button click you can change any letter to the previous or next letter in alphabetical order (for example ‘c’ can be changed to ‘b’ or ‘d’). The alphabet is circular, thus ‘a’ can become ‘z’, and ‘z’ can become ‘a’ with one click.

The italized statement is what struck me. So, if z can become a and a can become z in the alphabet. Then it is possible that in next step, z can be replaced with b and b with z, so at each step alphabet grows, so at each step, the actual rule to apply the logic changes. This would result in keeping track of each of the neighbours of a particular character in the alphabet and then applying the rule at each step.

Is it possible that a is trickling down from z towards its original position, but in the meantime, b meets z and y meets a and in the next step, b and y meet and so on so forth.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s