2.魔王语言

-tcy-

已于 2023-04-11 23:34:31 修改

阅读量73

点赞数

分类专栏：算法分析与设计文章标签： c语言算法蓝桥杯

于 2023-04-11 23:31:36 首次发布

本文链接：https://blog.csdn.net/weixin_63356368/article/details/130096251

版权

算法分析与设计专栏收录该内容

8 篇文章 0 订阅

订阅专栏

#include "stdio.h"
#include "string.h"
char c[10010];
char str[10010];
int j = 0;
void A() {
    str[j++] = 's';
    str[j++] = 'a';
    str[j++] = 'e';
}
void B() {
    str[j++] = 't';
    str[j++] = 's';
    str[j++] = 'a';
    str[j++] = 'e';
    str[j++] = 'd';
    str[j++] = 's';
    str[j++] = 'a';
    str[j++] = 'e';
}
void solve() {
    j = 0;
    int i;
    scanf("%s", c);
    for (i = 0; i < strlen(c); i++) {
        if (c[i] == 'A') {
            A();
        } else if (c[i] == 'B') {
            B();
        } else if (c[i] == '(') {
            i++;
            int f = i;
            if (c[f] == 'A')
                A();
            else if (c[i] == 'B') {
                B();
            } else
                str[j++] = c[i];
            for (; c[f] != ')'; f++)
                ;
            int h = f;
            f--;
            for (; f > i; f--) {
                if (c[f] == 'A')
                    A();
                else if (c[f] == 'B')
                    B();
                else
                    str[j++] = c[f];
                str[j++] = c[i];
            }
            i = h;
        } else
            str[j++] = c[i];
    }
    puts(str);
    for (i = 0; i < j; i++) {
        switch (str[i]) {
        case 't':
            printf("天");
            break;
        case 'd':
            printf("地");
            break;
        case 's':
            printf("上");
            break;
        case 'a':
            printf("一只");
            break;
        case 'e':
            printf("鹅");
            break;
        case 'z':
            printf("追");
            break;
        case 'g':
            printf("赶");
            break;
        case 'x':
            printf("下");
            break;
        case 'n':
            printf("蛋");
            break;
        case 'h':
            printf("恨");
            break;
        }
    }
}

int main() {
    int t;
    scanf("%d", &t);
    while (t--)
        solve();
    return 0;
}