No.3701 SUKEN -> SSSSS
問題文最終更新日: 2026-09-10 17:27:59
English (AI translation)
This statement was translated by AI (claude-opus-5-5, effort medium) and may contain errors or differ in nuance from the original. The original statement takes precedence.
Back to the original
Problem Statement
You are given a string $S$ consisting only of uppercase English letters. Output the string of the same length as $S$ in which every character is the same as the first character of $S$.
Input
$S$
- $S$ is a string of length at least $1$ and at most $100$
- The characters in $S$ are uppercase English letters only
Output
Output the string satisfying the condition.
Do not output anything other than the answer. (Do not output text such as prompts for input, either.)
For the answer format, you may refer to the practice problems and their sample solutions, but note that no links are provided.
Sample
Sample 1
Input
SUKEN
Output
SSSSS
Sample 2
Input
A
Output
A
Sample 3
Input
JAPANESEOLYMPIADININFORMATICS
Output
JJJJJJJJJJJJJJJJJJJJJJJJJJJJJ
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。