TJU Problem 2548 Celebrity jeopardy

下次不要被长题目吓到,其实不一定难。

先看输入输出,再揣测题意。

原文:

2548.   Celebrity jeopardy


Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 1306   Accepted Runs: 898



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 celebrities, 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. Specifically, you have to write 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

Source: Southeastern
European 2006

源代码:

 1 #include <iostream>
 2 #include <string>
 3 using namespace std;
 4
 5 int main()    {
 6     string aaa;
 7     while (getline(cin, aaa))    {
 8         cout << aaa << endl;
 9     }
10     return 0;
11 }
时间: 2024-11-05 21:53:44

TJU Problem 2548 Celebrity jeopardy的相关文章

Poj 3062 Celebrity jeopardy

1.Link: http://poj.org/problem?id=3062 2.Content: Celebrity jeopardy Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 15015   Accepted: 8471 Description It's hard to construct a problem that's so easy that everyone will get it, yet still

Problem C: Celebrity Split

题目描写叙述 Problem C: Celebrity Split Jack and Jill have decided to separate and divide their property equally. Each of their N mansions has a value between 1,000,000 and 40,000,000 dollars. Jack will receive some of the mansions; Jill will receive some

TJU Problem 1065 Factorial

注意数据范围,十位数以上就可以考虑long long 了,断点调试也十分重要. 原题: 1065.   Factorial Time Limit: 1.0 Seconds   Memory Limit: 65536KTotal Runs: 6067   Accepted Runs: 2679 The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceiver

TJU Problem 2520 Quicksum

注意: for (int i = 1; i <= aaa.length(); i++) 其中是“ i <= ",注意等号. 原题: 2520.   Quicksum Time Limit: 0.5 Seconds   Memory Limit: 65536KTotal Runs: 2964   Accepted Runs: 1970 A checksum is an algorithm that scans a packet of data and returns a single

TJU Problem 1015 Gridland

最重要的是找规律. 下面是引用 http://blog.sina.com.cn/s/blog_4dc813b20100snyv.html 的讲解: 1 做这题时,千万不要被那个图给吓着了,其实这题就是道简单的数学题. 2 3 首先看当m或n中有一个为2的情况,显然,只需要算周长就OK了.即(m+n-2)*2,考虑到至少其中一个为2,所以答案为2 *m或2*n,亦即m*n.注意这里保证了其中一个数位偶数. 4 当m,n≥3时,考虑至少其中一个为偶数的情况,显然,这种情况很简单,可以得出,结果为m*

TJU Problem 2857 Digit Sorting

原题: 2857.   Digit Sorting Time Limit: 1.0 Seconds   Memory Limit: 65536KTotal Runs: 3234   Accepted Runs: 1704 Several players play a game. Each player chooses a certain number, writes it down (in decimal notation, without leading zeroes) and sorts t

TJU Problem 2101 Bullseye

注意代码中: result1 << " to " << result2 << ", PLAYER 1 WINS."<< endl; 和 result1 << " to " << result2 << ", PLAYER 1 WINS. "<< endl; 虽然只在WINS后只差一个空格,但会导致PE. 原题: 2101.   Bul

TJU Problem 1100 Pi

注: 1. 对于double计算,一定要小心,必要时把与double计算相关的所有都变成double型. 2. for (int i = 0; i < N; i++)         //N 不可写为N - 1,否则当N为1时无法进行: 原题: 1100.   Pi Time Limit: 1.0 Seconds   Memory Limit: 65536KTotal Runs: 5683   Accepted Runs: 2317 Professor Robert A. J. Matthews

【水】TJU Problem 1805 Electrical Outlets

没看懂题,直接看了INPUT,原来真的可以猜出来. 原题: 1805.   Electrical Outlets Time Limit: 1.0 Seconds   Memory Limit: 65536KTotal Runs: 3321   Accepted Runs: 2575 Roy has just moved into a new apartment. Well, actually the apartment itself is not very new, even dating ba