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
Rajat (1307086):
20141008 01:26:56
Solved using top down DP style......with tabulation.


abhi:
20140809 11:34:33
little bit like assembly line problem 

aqfaridi:
20140614 21:36:59
@Rav why should we use scanf ??


Rav:
20140603 20:23:51
@aqfarid u r right a got my mistake Last edit: 20140703 08:15:01 

Ruslan:
20140424 13:47:57
Are there any tricky cases for DP solution? Last edit: 20140424 13:52:03 

Adamos Ttofari:
20140422 09:06:12
forgot the k. n part costed me a WA (feeling stupid) 

Abdullah Enes ÖNCÜ:
20130119 12:20:03
Recursion solution is faster than DP solution. 

Srijan Khare:
20121224 16:55:51
simple recursive solution got AC,no dp needed...small enough constraints :) 

张翼德:
20121219 07:14:52
easy 2D dp :D :D


avinash kumar:
20121215 19:29:47
i am trying to solve it by recursion with for loop.

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 