11058 - Encoding
Solution Description : String processing problem I explain the sample input output, then the problem is very clear for understand. Original string: ufrn a replace by: t b replace by: o c replace by: w d replace by: k e replace by: q f replace by: z g replace by: f h replace by: n i replace by: y j replace by: i k replace by: c l replace by: m m replace by: s n replace by: j o replace by: n p replace by: r q replace by: g r replace by: l s replace by: d t replace by: s u replace by: u v replace by: s w replace by: g x replace by: y y replace by: e z replace by: u 1. encoding the first char 'u'. Now position is: 0 a. Apply the rules which p=0 to encoding strategy. (i.e use the rule [0 q t], [0 j f] After use the rule the encoding strategy like this. a replace by: t b replace by: o c replace by: w d replace by: k e replace by: q f replace by: z g replace by: f h replace by: n i replace by: y j replace by: f k replace by: c l replace by: m m replace by: s n replace by: j o replace by: n p replace by: r q replace by: t r replace by: l s replace by: d t replace by: s u replace by: u v replace by: s w replace by: g x replace by: y y replace by: e z replace by: u b. Now encode the character 'u' using encode strategy. In encode strategy 'u' replace by 'u'. 2. Encoding the second char 'f'. Now position is: 1 a. Apply the rules which p=1 to encoding strategy. (i.e use the rule [1 v d], [1 f d], [1 r o]) After use the rule the encoding strategy like this. a replace by: t b replace by: o c replace by: w d replace by: k e replace by: q f replace by: d g replace by: f h replace by: n i replace by: y j replace by: f k replace by: c l replace by: m m replace by: s n replace by: j o replace by: n p replace by: r q replace by: t r replace by: o s replace by: d t replace by: s u replace by: u v replace by: d w replace by: g x replace by: y y replace by: e z replace by: u b. Now encode the character 'f' using encode strategy. In encode strategy 'f' replace by 'd'. 3. Encoding the second char 'r'. Now position is: 2 a. Apply the rules which p=2 to encoding strategy. (i.e use the rule [2 e p], [2 v e]) After use the rule the encoding strategy like this. a replace by: t b replace by: o c replace by: w d replace by: k e replace by: p f replace by: d g replace by: f h replace by: n i replace by: y j replace by: f k replace by: c l replace by: m m replace by: s n replace by: j o replace by: n p replace by: r q replace by: t r replace by: o s replace by: d t replace by: s u replace by: u v replace by: e w replace by: g x replace by: y y replace by: e z replace by: u b. Now encode the character 'r' using encode strategy. In encode strategy 'r' replace by 'o'. 4. Encoding the second char 'n'. Now position is: 3 a. Apply the rules which p=3 to encoding strategy. (i.e use the rule [3 y p], [3 t m], [3 u k]) After use the rule the encoding strategy like this. a replace by: t b replace by: o c replace by: w d replace by: k e replace by: p f replace by: d g replace by: f h replace by: n i replace by: y j replace by: f k replace by: c l replace by: m m replace by: s n replace by: j o replace by: n p replace by: r q replace by: t r replace by: o s replace by: d t replace by: m u replace by: k v replace by: e w replace by: g x replace by: y y replace by: p z replace by: u b. Now encode the character 'n' using encode strategy. In encode strategy 'r' replace by 'j'. I think the problem now the problem is very easy for you. |
||||||||||
11049 - Basic wall maze