zoukankan      html  css  js  c++  java
  • poj3366

    简单题

    View Code
    #include <iostream>
    #include
    <cstdio>
    #include
    <cstdlib>
    #include
    <cstring>
    using namespace std;

    #define maxn 25
    #define maxm 105

    char irr1[maxn][maxm], irr2[maxn][maxm];
    char st[maxm];
    int n, m;

    int getid()
    {
    for (int i = 0; i < n; i++)
    if (strcmp(st, irr1[i]) == 0)
    return i;
    return -1;
    }

    bool con()
    {
    if (strlen(st) == 1)
    return false;
    char ch = st[strlen(st) - 2];
    if (ch == 'a' ||ch == 'e' ||ch == 'u' ||ch == 'i' ||ch == 'o')
    return false;
    return true;
    }

    int main()
    {
    //freopen("t.txt", "r", stdin);
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++)
    {
    scanf(
    "%s", irr1[i]);
    scanf(
    "%s", irr2[i]);
    }
    for (int i = 0; i < m; i++)
    {
    scanf(
    "%s", st);
    int x;
    int len = strlen(st);
    if ((x = getid()) != -1)
    printf(
    "%s\n", irr2[x]);
    else if (st[len - 1] == 'y' && con())
    {
    st[len
    - 1] = 'i';
    printf(
    "%ses\n", st);
    }
    else if (st[len - 1] == 'o' || st[len - 1] == 'x' || st[len - 1] == 's'
    || (st[len - 1] == 'h' && len > 1 && (st[len - 2] == 's' || st[len - 2]
    == 'c')))
    printf(
    "%ses\n", st);
    else
    printf(
    "%ss\n", st);
    }
    return 0;
    }
  • 相关阅读:
    算法--枚举策略
    1344 走格子
    1381 硬币游戏
    POJ 2492 A Bug's Life
    零基础学并查集算法
    Codeforces 777C Alyona and Spreadsheet
    HDU 1039 Easier Done Than Said?
    Codeforces 591B Rebranding
    目录书籍
    对话机器学习大神Yoshua Bengio(上)
  • 原文地址:https://www.cnblogs.com/rainydays/p/2115039.html
Copyright © 2011-2022 走看看