G. Plural Form of Nouns

Codeforces

IDCF10050G

Time1000ms

Memory64MB

Difficulty—

English · Original

Formal · Original

In the English language, nouns are inflected by grammatical number — that is singular or plural. In this problem we use a simple model of constructing plural from a singular form. This model doesn't always make English plural forms correctly, but it works in most cases. Forget about the real rules you know while solving the problem and use the statement as a formal document. You are given several nouns in a singular form and your program should translate them into plural form using the following rules: The first line of input contains a single positive integer n (1 ≤ n ≤ 10) — the number of words to be processed. The following n lines contain one word each. A word consists from 2 to 25 lowercase Latin letters. It is not guaranteed that the given words are real English words from vocabulary. Print n given words in their plural forms on separate lines. Keep the words in the same order as they are given in the input. ## Input The first line of input contains a single positive integer n (1 ≤ n ≤ 10) — the number of words to be processed. The following n lines contain one word each. A word consists from 2 to 25 lowercase Latin letters. It is not guaranteed that the given words are real English words from vocabulary. ## Output Print n given words in their plural forms on separate lines. Keep the words in the same order as they are given in the input. [samples]

**Definitions** Let $ n \in \mathbb{Z} $ be the number of words, with $ 1 \leq n \leq 10 $. Let $ W = (w_1, w_2, \dots, w_n) $ be a sequence of strings, where each $ w_i $ is a word of length $ \ell_i $, $ 2 \leq \ell_i \leq 25 $, consisting of lowercase Latin letters. **Rules for Pluralization** For each word $ w_i $, its plural form $ p_i $ is determined by: - If $ w_i $ ends in `s`, `x`, `ch`, or `sh`, then $ p_i = w_i + \texttt{"es"} $. - Else if $ w_i $ ends in `y` and the preceding letter is not a vowel (`a`, `e`, `i`, `o`, `u`), then $ p_i = \text{prefix} + \texttt{"ies"} $, where prefix is $ w_i $ without the final `y`. - Else, $ p_i = w_i + \texttt{"s"} $. **Objective** For each $ i \in \{1, \dots, n\} $, output $ p_i $, the plural form of $ w_i $, following the above rules.

API Response (JSON)

{
  "problem": {
    "name": "G. Plural Form of Nouns",
    "description": {
      "content": "In the English language, nouns are inflected by grammatical number — that is singular or plural. In this problem we use a simple model of constructing plural from a singular form. This model doesn't a",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 65536
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10050G"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "In the English language, nouns are inflected by grammatical number — that is singular or plural. In this problem we use a simple model of constructing plural from a singular form. This model doesn't a...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ n \\in \\mathbb{Z} $ be the number of words, with $ 1 \\leq n \\leq 10 $.  \nLet $ W = (w_1, w_2, \\dots, w_n) $ be a sequence of strings, where each $ w_i $ is a word of length $ \\e...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments