ACODE - Alphacode
Alice and Bob need to send secret messages to each other and are discussing ways to encode their messages:
Alice: “Let’s just use a very simple code: We’ll assign ‘A’ the code word 1, ‘B’ will be 2, and so on down to ‘Z’ being assigned 26.”
Bob: “That’s a stupid code, Alice. Suppose I send you the word ‘BEAN’ encoded as 25114. You could decode that in many different ways!”
Alice: “Sure you could, but what words would you get? Other than ‘BEAN’, you’d get ‘BEAAD’, ‘YAAD’, ‘YAN’, ‘YKD’ and ‘BEKD’. I think you would be able to figure out the correct decoding. And why would you send me the word ‘BEAN’ anyway?”
Bob: “OK, maybe that’s a bad example, but I bet you that if you got a string of length 5000 there would be tons of different decodings and with that many you would find at least two different ones that would make sense.”
Alice: “How many different decodings?”
For some reason, Alice is still unconvinced by Bob’s argument, so she requires a program that will determine how many decodings there can be for a given string using her code.
Input will consist of multiple input sets. Each set will consist of a single line of at most 5000 digits representing a valid encryption (for example, no line will begin with a 0). There will be no spaces between the digits. An input line of ‘0’ will terminate the input and should not be processed.
For each input set, output the number of possible decodings for the input string. All answers will be within the range of a 64 bit signed integer.
Input: 25114 1111111111 3333333333 0 Output: 6 89 1
i am new to programming and believe that it will take me at least a life time to reach the solution to this problem.
i acctually backtracked it and i was thinking about all the cases that not overlapping so i didn't memoize it and got timelimit second day i memoize it after seeing the video in the other comment and got the AC xDDD
Good question to learn new things. Might be invalid test cases (cases that can't occur,i.e, 100) are not included. Try these
For those who are beginners in DP, this is a good one.
can anyone help me with the logic? I am new in DP.
I never checked for invalid test cases. All you have to check is zeros that come in between and (note: no two consecutive zeros come together ie, test cases like these 10002 or 90 don't exist in this problem.)
I have tried all testcases from comments.. but still WA :(
wowLast edit: 2019-11-23 08:23:37
easy dp problem
Ac in 0.00s. First, hack the logic of dynamic programming then take care about zero and you are done.