Problem:
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.

Solution in C (GCC 9.2.1) (judge verdict: Accepted)

#include <math.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;

int main(void) {
  int scan; // scanf result
  int k; // to input 
  char s[102]; // to input 

  scan = scanf("%d", &k);
  scan = scanf("%s", s);

  int slen;
  slen = strlen(s);

  char answer[105];

  if (slen <= k) {
    printf("%s", s);
  } else {
    for (int n = 0; n < k; n++) {
      answer[n] = s[n];
    }
    answer[k] = '.';
    answer[k + 1] = '.';
    answer[k + 2] = '.';
    printf("%s", answer);
  }

  return (0);
}