#abc315a. A - tcdr

A - tcdr

Score : 100100 points

问题描述

你将得到一个由小写英文字母组成的字符串 SS
SS 中移除所有出现的 aeiou,并打印出处理后的字符串。
SS 至少包含一个不是 aeiou 的字符。

以上为通义千问 qwen-max 翻译,仅供参考。

Problem Statement

You are given a string SS consisting of lowercase English letters.
Remove all occurrences of a, e, i, o, u from SS and print the resulting string.
SS contains at least one character other than a, e, i, o, u.

Constraints

  • SS is a string of length between 11 and 100100, inclusive, consisting of lowercase English letters.
  • SS contains at least one character other than a, e, i, o, u.

Input

The input is given from Standard Input in the following format:

SS

Output

Print the answer.

Sample Input 1

atcoder

Sample Output 1

tcdr

For S=S = atcoder, remove the 11-st, 44-th, and 66-th characters to get tcdr.

Sample Input 2

xyz

Sample Output 2

xyz

Sample Input 3

aaaabbbbcccc

Sample Output 3

bbbbcccc

update @ 2024/3/10 09:00:06