spoj#HARDP. Hard Problem
Hard Problem
[This space is intentionally left blank.]
Input
Multiple test cases. Each contains a single integer N(1<=N<=50). Input terminates by EOF.
Output
For each test case, output one line contains the answer. See the example.
Example
Input:
8 9 10Output:
8=90*(0+0+0+0+45-3+20-42+60+10) 9=20*(0-3+10-14+15+2+0+0+0+0+10) 10=66*(0+0+0+0+0+33+5-33+66-66+55+6)