問題一覧 > 通常問題

No.3294 UECoder

レベル : / AI推定難易度 : 101 / 実行時間制限 : 1ケース 2.000秒 / メモリ制限 : 512 MB / 標準ジャッジ問題
タグ : (AC するまで非表示) / 解いたユーザー数 190
作問者 : hanba-gu1 / テスター : くらげ dyktr_06 sepa38 Nafmo2 おのせ
お気に入りにしたユーザー ProblemId : 12623 / 自分の提出
問題文最終更新日: 2025-10-05 14:07:13
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 MMA Contest 020 (順位表) の他の問題:

Problem Statement

You are given a string $S$ of length $N$ consisting of lowercase English letters. Here, $S$ contains exactly $1$ occurrence of the lowercase English letter c.

When the $i$-th character of $S$ is c, print the string obtained by concatenating UEC and the part of $S$ after the $i$-th character, in this order.

Constraints

  • $N$ is an integer between $1$ and $100$, inclusive
  • $S$ is a string of length $N$ consisting of lowercase English letters
  • $S$ contains exactly $1$ occurrence of the lowercase English letter c

Input

$N$ 
$S$ 

Output

When the $i$-th character of $S$ is c, print the string obtained by concatenating UEC and the part of $S$ after the $i$-th character, in this order.

Sample

Sample 1
Input
9
yukicoder
Output
UECoder

The $5$-th character of yukicoder is c, so print the string UECoder, obtained by concatenating UEC and oder, the part of yukicoder from the $6$-th character onward.

Sample 2
Input
14
summervacation
Output
UECation

Sample 3
Input
6
campus
Output
UECampus

提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。