PKUOJ2250 Compromise
来源:互联网 发布:怎么注册手机淘宝 编辑:程序博客网 时间:2024/04/29 22:24
Compromise
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3083 Accepted: 1456 Special Judge
Description
In a few months the European Currency Union will become a reality. However, to join the club, the Maastricht criteria must be fulfilled, and this is not a trivial task for the countries (maybe except for Luxembourg). To enforce that Germany will fulfill the criteria, our government has so many wonderful options (raise taxes, sell stocks, revalue the gold reserves,...) that it is really hard to choose what to do.
Therefore the German government requires a program for the following task:
Two politicians each enter their proposal of what to do. The computer then outputs the longest common subsequence of words that occurs in both proposals. As you can see, this is a totally fair compromise (after all, a common sequence of words is something what both people have in mind).
Your country needs this program, so your job is to write it for us.
Therefore the German government requires a program for the following task:
Two politicians each enter their proposal of what to do. The computer then outputs the longest common subsequence of words that occurs in both proposals. As you can see, this is a totally fair compromise (after all, a common sequence of words is something what both people have in mind).
Your country needs this program, so your job is to write it for us.
Input
The input will contain several test cases.
Each test case consists of two texts. Each text is given as a sequence of lower-case words, separated by whitespace, but with no punctuation. Words will be less than 30 characters long. Both texts will contain less than 100 words and will be terminated by a line containing a single '#'.
Input is terminated by end of file.
Each test case consists of two texts. Each text is given as a sequence of lower-case words, separated by whitespace, but with no punctuation. Words will be less than 30 characters long. Both texts will contain less than 100 words and will be terminated by a line containing a single '#'.
Input is terminated by end of file.
Output
For each test case, print the longest common subsequence of words occuring in the two texts. If there is more than one such sequence, any one is acceptable. Separate the words by one blank. After the last word, output a newline character.
Sample Input
die einkommen der landwirte sind fuer die abgeordneten ein buch mit sieben siegeln um dem abzuhelfen muessen dringend alle subventionsgesetze verbessert werden # die steuern auf vermoegen und einkommen sollten nach meinung der abgeordneten nachdruecklich erhoben werden dazu muessen die kontrollbefugnisse der finanzbehoerden dringend verbessert werden #
Sample Output
die einkommen der abgeordneten muessen dringend verbessert werden
Source
Ulm Local 1997
这题一直没看懂,不会DP保存路径
- PKUOJ2250 Compromise
- compromise
- poj2250 - Compromise
- poj Compromise
- Compromise (p2250)
- 531 - Compromise
- UVA531- Compromise
- poj1015Jury Compromise
- Jury Compromise
- Jury Compromise
- POJ_1015_Jury Compromise
- PKU 2250 Compromise
- pku1015 Jury Compromise
- Pku acm 2250 Compromise
- POJ 1015 Jury Compromise
- pku 2250 Compromise(LCS)
- poj 1015 Jury Compromise
- Pku acm 2250 Compromise
- cwRsync之一:基本设置与使用
- PUKOJ2342 Anniversary party(没有上司的晚会)
- PKUOJ1017 Packets
- pads9.0汉化
- Geant4资源网站整理 第二批
- PKUOJ2250 Compromise
- HDUOJ1251 统计难题
- jsp中通过按钮跳转到其他页面
- 一个合格网络管理员的成长经历
- LPCTSTR类型
- RHCE考试
- 帮忙发个山寨诺基亚N98语音王软件
- UNICODE下宽字符的CString转换为const char *
- 新浪微博之忧