HARDP - Hard Problem
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 10 Output: 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)
hide comments
neha1824:
2017-03-01 18:49:30
Unable to understand the problem, is there any hint?
|
|
kjsisco:
2016-04-04 22:43:26
This is a really unbalanced equation. It cannot be solved |
|
[Rampage] Blue.Mary:
2013-03-24 09:21:33
@Francky: I think this one is somewhat different from problems in "riddle" section now. Of course the solver must guess what the author really wants to, but after that the problem is not solved immediately. (This is why this problem is called "Hard Problem".)
|
|
Francky:
2013-03-23 10:33:53
@Blue Mary (and other solvers of the task) : what is your sentiment about riddle section for this one ? I really waiting for. Thanks in advance.
|
|
(Tjandra Satria Gunawan)(曾毅昆):
2013-03-18 08:10:18
@Francky: I agree.. This problem doesn't have clear task, It's riddle type.. |
|
Francky:
2013-03-17 22:55:48
There is a new "riddle" section, after "classical", "challenge", ...
|
|
(Tjandra Satria Gunawan)(曾毅昆):
2012-06-05 06:57:30
What is this... I don't understand the problem... ~_~ |
Added by: | Fudan University Problem Setters |
Date: | 2007-07-14 |
Time limit: | 0.100s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: C99 ERL JS-RHINO |
Resource: | Based on a problem from an ACM/ICPC Regional Contest |