Score: $100$ points

问题描述

给定一个由小写英文字母和字符 . 组成的字符串 $S$。
请输出当 $S$ 以 . 进行分割时，最后一个子串。
换句话说，输出 $S$ 中不包含 . 的最长后缀。

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

Problem Statement

You are given a string $S$ consisting of lowercase English letters and the character ..
Print the last substring when $S$ is split by .s.
In other words, print the longest suffix of $S$ that does not contain ..

Constraints

• $S$ is a string of length between $2$ and $100$, inclusive, consisting of lowercase English letters and ..
• $S$ contains at least one ..
• $S$ does not end with ..

Input

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

$S$

Output

Print the answer.

Sample Input 1

atcoder.jp

Sample Output 1

jp

The longest suffix of atcoder.jp that does not contain . is jp.

Sample Input 2

translate.google.com

Sample Output 2

com

$S$ may contain multiple .s.

Sample Input 3

.z

Sample Output 3

z

$S$ may start with ..

Sample Input 4

..........txt

Sample Output 4

txt

$S$ may contain consecutive .s.

update @ 2024/3/10 01:30:39