101681: [AtCoder]ABC168 B - ... (Triple Dots)

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score: $200$ points

Problem Statement

We have a string $S$ consisting of lowercase English letters.

If the length of $S$ is at most $K$, print $S$ without change.

If the length of $S$ exceeds $K$, extract the first $K$ characters in $S$, append ... to the end of them, and print the result.

Constraints

  • $K$ is an integer between $1$ and $100$ (inclusive).
  • $S$ is a string consisting of lowercase English letters.
  • The length of $S$ is between $1$ and $100$ (inclusive).

Input

Input is given from Standard Input in the following format:

$K$
$S$

Output

Print a string as stated in Problem Statement.


Sample Input 1

7
nikoandsolstice

Sample Output 1

nikoand...

nikoandsolstice has a length of $15$, which exceeds $K=7$.

We should extract the first $7$ characters in this string, append ... to the end of them, and print the result nikoand....


Sample Input 2

40
ferelibenterhominesidquodvoluntcredunt

Sample Output 2

ferelibenterhominesidquodvoluntcredunt

The famous quote from Gaius Julius Caesar.

Input

题意翻译

给一段由小写字母构成的字符串 $S$ 及限制 $K$ 。如果 $S$ 的长度超过 $K$ ,就将 $S$ 的前 $K$ 个字符输出,再输出 ... 。否则,就直接输出整个字符串。

加入题单

上一题 下一题 算法标签: