No.2460 #Emphasis#
問題文最終更新日: 2021-05-28 19:13:31
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
yukicoder contest 404
(順位表)
の他の問題:
Problem Statement
You are given a string $S$.
$S$ contains exactly $2$ # characters.
Print the part enclosed between the $2$ # characters.
Input
The input is given in the following format.$S$
The input satisfies the following constraints.
- The length of $S$ is at least $2$ and at most $100$.
- $S$ contains exactly $2$
#characters. - $S$ consists only of
#and lowercase English letters.
Output
Print the answer on $1$ line, followed by a newline.
Sample
Sample 1
Input
abc#efgh#j
Output
efgh
Sample 2
Input
#abcdefghijklmnopqrstuvwxyz#
Output
abcdefghijklmnopqrstuvwxyz
This input contains every type of character that can appear in $S$.
Sample 3
Input
void##
Output
If the $2$ # characters are adjacent, print nothing and just output a newline.
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。
Nachia
mine691