• UVa 10361 Automatic Poetry


    Automatic Poetry

    Input: standard input

    Output: standard output

    Time Limit: 2 seconds

    Memory Limit: 32 MB

    “Oh God”, Lara Croft exclaims, “it’s one of these dumb riddles again!”

    In Tomb Raider XIV, Lara is, as ever, gunning her way through ancient Egyptian pyramids, prehistoric caves and medival hallways. Now she is standing in front of some important Germanic looking doorway and has to solve a linguistic riddle to pass. As usual, the riddle is not very intellectually challenging.

    This time, the riddle involves poems containing a “Schuttelreim”. An example of a Schuttelreim is the following short poem:

    Ein Kind halt seinen Schnabel nur,

    wenn es hangt an der Nabelschnur.        

    /*German contestants please forgive me. I had to modify something as they were not appearing correctly in plain text format*/

    A Schuttelreim seems to be a typical German invention. The funny thing about this strange type of poetry is that if somebody gives you the first line and the beginning of the second one, you can complete the poem yourself. Well, even a computer can do that, and your task is to write a program which completes them automatically. This will help Lara concentrate on the “action” part of Tomb Raider and not on the “intellectual” part.

    Input

    The input will begin with a line containing a single number n. After this line follow n pairs of lines containing Schuttelreims. The first line of each pair will be of the form

    s1<s2>s3<s4>s5

    where the si are possibly empty, strings of lowercase characters or blanks. The second line will be a string of lowercase characters or blanks ending with three dots “...”. Lines will we at most 100 characters long.

    Output

    For each pair of Schuttelreim lines l1 and l2 you are to output two lines c1 and c2 in the following way: c1 is the same as l1 only that the bracket marks “<” and “>” are removed. Line c2 is the same as l2 , except that instead of the three dots the string s4s3s2s5 should appear.

    Sample Input

    3

    ein kind haelt seinen <schn>abel <n>ur

    wenn es haengt an der ...

    weil wir zu spaet zur <>oma <k>amen

    verpassten wir das ...

    <d>u <b>ist

    ...

    Sample Output

    ein kind haelt seinen schnabel nur

    wenn es haengt an der nabel schnur

    weil wir zu spaet zur oma kamen

    verpassten wir das koma amen

    du bist

    bu dist

    这是一道很简单的字符串处理的题目,我是设置cin.getline()函数的第三个参数来取si的。

    注意第二个字符串后面的3个'.',其他没什么好说的。

     1 //#define LOCAL
     2 #include <iostream>
     3 #include <cstdio>
     4 #include <cstring>
     5 using namespace std;
     6 
     7 const int maxn = 105;
     8 char s1[5][maxn];
     9 char s2[maxn];
    10 
    11 int main(void)
    12 {
    13     #ifdef LOCAL
    14         freopen("10361in.txt", "r", stdin);
    15     #endif
    16     int N, i;
    17     scanf("%d", &N);
    18     while(N--)
    19     {
    20         memset(s1, 0, sizeof(s1));
    21         getchar();
    22         cin.getline(s1[0], maxn, '<');
    23         cin.getline(s1[1], maxn, '>');
    24         cin.getline(s1[2], maxn, '<');
    25         cin.getline(s1[3], maxn, '>');
    26         cin.getline(s1[4], maxn);
    27         for(i = 0; i < 5; ++i)
    28         {
    29             cout << s1[i];
    30         }
    31         cout << endl;
    32         
    33         cin.getline(s2, maxn, '.');
    34         getchar();
    35         getchar();
    36         cout << s2 <<s1[3] << s1[2] << s1[1] << s1[4] << endl;
    37         
    38     }
    39     return 0;
    40 }
    代码君
  • 相关阅读:
    [转]Java垃圾回收(GC)机制详解
    [转]java 面试题整理1
    [转]Java并发编程:Callable、Future和FutureTask
    [转]ReentrantReadWriteLock读写锁详解
    nginx -s reload 避坑指南!
    Java使用doubleCheck(双重检查) Singleton(单例模式) 重排序
    在 Docker 中生成 ProtoBuffer、gRPC 文件
    Golang MongoDB Driver 更新符合条件的数组元素的字段
    prometheus 告警 gpu 卡的ecc错误
    prometheus及gpu,k8s
  • 原文地址:https://www.cnblogs.com/AOQNRMGYXLMV/p/3817641.html
Copyright © 2020-2023  润新知