C. Cheering

Codeforces

IDCF10152C

Time1000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

To boost contestants' performances in the 20th _La Salle - Pui Ching Programming Challenge_, the organizers have bought N robots to cheer for them. Each robot is supposed to display cheering slogans, letter by letter. Unfortunately, due to some technical reasons, the display screen of each robot can only display one fixed character. Therefore, the organizers decided to arrange the robots in a row, thus forming a string of N letters (What a waste!). All letters are in uppercase. The two hosting schools have abbreviated names _LSC_ and _PCMS_, as we all know. Which of the two names appear (as a substring) in the string more often? The first and only line of input consists of a string with N uppercase letters. For all test cases, N ≤ 100. Let A be the number of occurrences of _LSC_ in the given string. Let B be the number of occurrences of _PCMS_ in the given string. If A > B, output _LSC_. If A < B, output _PCMS_. If A = B, output _Tie_. ## Input The first and only line of input consists of a string with N uppercase letters.For all test cases, N ≤ 100. ## Output Let A be the number of occurrences of _LSC_ in the given string.Let B be the number of occurrences of _PCMS_ in the given string.If A > B, output _LSC_.If A < B, output _PCMS_.If A = B, output _Tie_. [samples]

**Definitions** Let $ S $ be a string of length $ N \leq 100 $, consisting of uppercase English letters. Let $ A $ be the number of occurrences of the substring "LSC" in $ S $. Let $ B $ be the number of occurrences of the substring "PCMS" in $ S $. **Constraints** $ 1 \leq N \leq 100 $ **Objective** Compute $ A = \sum_{i=1}^{N-2} \mathbf{1}[S[i:i+3] = \text{"LSC"}] $ Compute $ B = \sum_{i=1}^{N-3} \mathbf{1}[S[i:i+4] = \text{"PCMS"}] $ Output: - "LSC" if $ A > B $, - "PCMS" if $ A < B $, - "Tie" if $ A = B $.

API Response (JSON)

{
  "problem": {
    "name": "C. Cheering",
    "description": {
      "content": "To boost contestants' performances in the 20th _La Salle - Pui Ching Programming Challenge_, the organizers have bought N robots to cheer for them. Each robot is supposed to display cheering slogans, ",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10152C"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "To boost contestants' performances in the 20th _La Salle - Pui Ching Programming Challenge_, the organizers have bought N robots to cheer for them. Each robot is supposed to display cheering slogans, ...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ S $ be a string of length $ N \\leq 100 $, consisting of uppercase English letters.  \nLet $ A $ be the number of occurrences of the substring \"LSC\" in $ S $.  \nLet $ B $ be the ...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments