zoukankan      html  css  js  c++  java
  • Automatic Poetry

    考虑到每段串中字母顺序不能反序,没有使用栈;

    为了方便,也没有在输入的同时输出;

    感觉虽然麻烦点,但是如果加上思考的时间,是比较省时的做法。

     1 /* UVa 10361 - Automatic Poetry */
    2 # include <stdio.h>
    3
    4 # define N 105
    5
    6 char L1[N], L2[N];
    7 int m[2], n[2];
    8
    9 int main()
    10 {
    11 int T, i;
    12
    13 scanf("%d", &T);
    14 getchar();
    15 while (T--)
    16 {
    17 gets(L1);
    18 gets(L2);
    19
    20 i = 0;
    21 while (L1[i] != '<') putchar(L1[i++]);
    22 m[0] = i++;
    23 while (L1[i] != '>') putchar(L1[i++]);
    24 m[1] = i++;
    25 while (L1[i] != '<') putchar(L1[i++]);
    26 n[0] = i++;
    27 while (L1[i] != '>') putchar(L1[i++]);
    28 n[1] = i++;
    29 while (L1[i]) putchar(L1[i++]);
    30 putchar('\n');
    31
    32 for (i = 0; L2[i] != '.'; ++i)
    33 putchar(L2[i]);
    34 for (i = n[0]+1; i < n[1]; ++i)
    35 putchar(L1[i]);
    36 for (i = m[1]+1; i < n[0]; ++i)
    37 putchar(L1[i]);
    38 for (i = m[0]+1; i < m[1]; ++i)
    39 putchar(L1[i]);
    40 for (i = n[1]+1; L1[i]; ++i)
    41 putchar(L1[i]);
    42 putchar('\n');
    43 }
    44
    45 return 0;
    46 }



  • 相关阅读:
    [BZOJ3257]树的难题
    [BZOJ4987]Tree
    [NOI2015][洛谷P2150]寿司晚宴
    P2221 [HAOI2012]高速公路
    BUG全集(我遇到的)
    NOIP2018游记
    BZOJ1103
    Google Chrome 优化
    特殊空格
    Ant Design Vue 使用
  • 原文地址:https://www.cnblogs.com/JMDWQ/p/2397922.html
Copyright © 2011-2022 走看看