# SPOJ ACODE

## Contents

## 394. Alphacode[edit]

Also seen at:

- http://acm.csie.ntu.edu.tw/ntujudge/problem.php?id=105
- http://acm.tju.edu.cn/toj/showp1541.html
- http://acm.zju.edu.cn/show_problem.php?pid=2202
- http://acm.pku.edu.cn/JudgeOnline/problem?id=2033

Source: East Central North America 2004

## Summary[edit]

Two people want to send coded messages to each other. One possible encoding scheme is to simply replace each letter with its numerical value in the alphabet and then string all the digits together without spaces. Determine the number of possible ways to decode a message encoded this way.

## Explanation[edit]

This is a dynamic programming problem.

If we take a single number , the problem will be in a single state. If you want to add another number to the problem, the problem could be in one of two states:

- The two numbers printed one after another,
- The two numbers combined to form a different single number,

One or both of the above states may be valid. If the first one remains valid, the new state is . If the second remains valid then the state is . For each of the two valid states, keep track of the previous valid states that lead to it.

## Optimizations[edit]

## Gotchas[edit]

- The result is a 64-it integer - make sure intermediate calculations use that data type.
- String "110" only has one possible encoding.

## Input[edit]

25114 1111111111 3333333333 226210 0

## Output[edit]

6 89 1 3

## External Links[edit]

- Dynamic Programming - Wiki Link
- Dynamic Programming Tutorial - Topcoder.com