No.3647 Initial Maker
レベル :
/ AI推定難易度 : 73
/ 実行時間制限 : 1ケース 2.000秒 / メモリ制限
: 1024 MB / 標準ジャッジ問題
タグ : / 解いたユーザー数 94
作問者 :
Rino-program
/ テスター :
UT0911
gomaazarasi
👑
p-adic
とある理系大学生の日常
タグ : / 解いたユーザー数 94
作問者 :
UT0911
とある理系大学生の日常
問題文最終更新日: 2026-08-22 13:32:29
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 511 (Div.2)
(順位表)
の他の問題:
Problem Statement
You are given strings $S, T$ consisting of English letters.
The initial letters of $S$ and $T$ are always uppercase.
Let $F$ be the initial letter of $S$ and $L$ be the initial letter of $T$. Print them in the form F.L..
Constraints
- $1 \le |S|, |T| \le 30$
- $S, T$ are strings consisting of English letters.
- The initial letters of $S, T$ are uppercase English letters.
Here, $|S|$, $|T|$ denote the lengths of the strings $S$, $T$, respectively.
Input
The input is given from standard input in the following format.
$S$ $T$
Output
Let $F$ be the initial letter of $S$ and $L$ be the initial letter of $T$. Print them in the form F.L..
Print a newline at the end.
Sample
Sample 1
Input
Taro Tanaka
Output
T.T.
Join the initial letter T of Taro and the initial letter T of Tanaka with dots and print T.T..
Sample 2
Input
Ruby Python
Output
R.P.
Sample 3
Input
A Z
Output
A.Z.
When a string has length $1$, likewise take its initial letter and print it.
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。