杂码之纸老虎：Celebrity jeopardy POJ 3062

/*

Celebrity jeopardy

http://poj.org/problem?id=3062

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Submit
 
Status
Description
It's hard to construct a problem that's so easy that everyone will get it, yet still difficult enough to be worthy of some respect. Usually, we err on one side or the other. How simple can a problem really be? 


Here, as in Celebrity Jepoardy, questions and answers are a bit confused, and, because the participants are elebrities, there’s a real need to make the challenges simple. Your program needs to prepare a question to be solved --- an equation to be solved --- given the answer. Specifica lly ,  you have to w rite a program which finds the simplest possible equation to be solved given the answer, considering all possible equations using the standard mathematical symbols in the usual manner. In this context, simplest can be defined unambiguously several different ways leading to the same path of resolution. For now, find the equation whose transformation into the desired answer requires the least effort. 


For example, given the answer X = 2, you might create the equation 9 - X = 7. Alternately, you could build the system X > 0; X^2 = 4. These may not be the simplest possible equations. Solving these mind-scratchers might be hard for a celebrity.
Input
Each input line contains a solution in the form <symbol> = <value>
Output
For each input line, print the simplest system of equations which would to lead to the provided solution, respecting the use of space exactly as in the input.
Sample Input
Y = 3
X=9
Sample Output
Y = 3
X=9
FAQ | About Virtual Judge | Forum | Discuss | Open Source Project
All Copyright Reserved 2010-2012 HUST ACM/ICPC TEAM 
Anything about the OJ, please ask in the forum, or contact author:Isun
Server Time: 

*/

/*

题意：
对于给出一个表达式值，寻找一个最简单的方程，使得他的解是所给出的表达式；

例如：

x=2;方程可以使9-x=7;x^2=4;x+2=4~~~~~~等等

思路：

最简单方程就是赋值表达式，按照原模原样输出。

*/

#include<cstdio>
#include<string.h>
#include<stdlib.h>
#define  M 100
char a[M];
int main()
{
memset(a,0,sizeof(a));
while(gets(a)!=NULL)
{
puts(a);
}
return 0;
}