Author: | A. Klenin | Time limit: | 1 sec | |
Input file: | input.txt | Memory limit: | 64 Mb | |
Output file: | output.txt |
Your program must calculate the value of limx ↦ ∞a1x + a2x2 + … + anxnb1x + b2x2 + … + bnxn.
All coefficients are integers, so the answer must be calculated exactly and presented in the form of irreducible fraction.
1 ≤ n ≤ 100, 0 ≤ ai, bi ≤ 109, ∑i (bi + ai) > 0
No. | Input file (input.txt ) |
Output file (output.txt ) |
---|---|---|
1 |
|
|
2 |
|
|