CFRAC2  Continuous Fractions Again
A simple continuous fraction has the form:
where the ai’s are integer numbers.
The previous continuous fraction could be noted as [a1, a2, . . . , an]. It is not difficult to show that any rational number p / q , with integers p > q > 0, can be represented in a unique way by a simple continuous fraction with n terms, such that p / q = [a1, a2, . . . , an−1, 1], where n and the ai’s are positive natural numbers.
Now given a simple continuous fraction, your task is to calculate a rational number which the continuous fraction most corresponds to it.
Input
Input for each case will consist of several lines. The first line is two integer m and n,which describe a char martrix,then followed m lines,each line cantain n chars. The char martrix describe a continuous fraction The continuous fraction is described by the following rules:
The end of the input is indicated by a line containing 0 0.
Output
Output will consist of a series of cases, each one in a line corresponding to the input case. A line describing a case contains p and q, two integer numbers separated by a space, and you can assume that 10^20 > p > q > 0.
Example
Input: 9 17 ..........1...... 2.+. ............1.... ....4.+. ..............1.. ........1.+. ................1 ............5.+. ................1 5 10 ......1... 1.+. .........1 ....11.+. .........1 0 0 Output: 75 34 13 12
hide comments
prudhvi_495:
20190616 23:02:40
easy one!!


nadstratosfer:
20180606 18:44:04
Like CFRAC, fun while breaking down, very easy afterwards. Thumbs up!


sky_scraper:
20180128 16:33:48
to make it clear just get the numbers separately and think for a formula/pattern the result follows 

nidhi_061:
20170623 10:31:38
can anyone explain the problem please? I am not getting it. Last edit: 20170623 10:32:09 

prakash:
20161109 14:17:22
very easy accept in 1go use long long int


darol:
20150403 09:43:24
for numerator / denominator use long in java 

Daniel Carvalho:
20150311 03:29:24
For those getting WA, here's a nice test case:


Anubhav Gupta:
20150102 12:59:39
long long!!! 

Bharath Reddy:
20140404 15:37:01
Very easy problem..

Added by:  Camilo Andrés Varela León 
Date:  20070131 
Time limit:  0.250s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  HNU Contest 