ANARC05H  Chop Ahoy! Revisited!
Given a nonempty string composed of digits only, we may group these digits into subgroups (but maintaining their original order) if, for every subgroup but the last one, the sum of the digits in a subgroup is less than or equal to the sum of the digits in the subgroup immediately on its right. Needless to say, each digit will be in exactly one subgroup.
For example, the string 635 can only be grouped in one subgroup [635] or in two subgroups as follows: [635] (since 6 < 8.) Another example is the string 1117 which can be grouped in one subgroup [1117] or as in the following: [1117], [1117], [1117], [1117], [1117] and [1117] but not any more, hence the total number of possibilities is 7.
Write a program that computes the total number of possibilities of such groupings for a given string of digits.
Input
Your program will be tested on a number of test cases. Each test case is speciﬁed on a separate line. Each line contains a single string no longer than 25, and is made of decimal digits only.
The end of the test cases is identiﬁed by a line made of the word "bye" (without the quotes.) Such line is not part of the test cases.
Output
For each test case, write the result using the following format:
k. n
where k is the test case number (starting at 1,) and n is the result of this test case.
Example
Input: 635 1117 9876 bye Output: 1. 2 2. 7 3. 2
hide comments
nk17kumar:
20160715 18:54:14
Ac ... Take care of input and output format. 

singh1495:
20160629 16:16:02
take time but intesting problem....................... 

blueranger:
20160621 17:43:55
only 5 line recursion function ... easy one!


sarvesh_19:
20160331 16:34:47
took time ...nice one :)


SHOBHIT SHEKHAR:
20160330 23:25:08
would have been a better question if it had strict constraints 

Bhuvnesh Jain:
20160126 14:23:43
Bad test cases. Brute force passes as well. Should either improve test cases or increase the length of string. 

anshal dwivedi:
20151226 10:09:10
another DP! 

naruto09:
20151219 18:13:37
same time with and without dp..;) 

priyank:
20151212 10:46:14
time limit is too weak 

Prateek Agarwal:
20151204 08:38:54
Wthout memoization! 
Added by:  ~!(*(@*!@^& 
Date:  20090705 
Time limit:  1s2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ANARC 2005 