我是靠谱客的博主 追寻口红,这篇文章主要介绍CodeForces 71A Way Too Long Words,现在分享给大家,希望可以做个参考。

思路:水题


复制代码
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h> using namespace std; int main() { int n; scanf("%d",&n); for (int i = 0;i<n;i++) { string s; cin >> s; if (s.size()<=10) cout << s << endl; else { string ss; ss+=s[0]; // cout << s[0] << " " << ss[0] << endl; int num = s.size()-2; string temp; stringstream sss; sss << num; sss >> temp; ss+=temp; ss+=s[s.size()-1]; cout << ss << endl; } } }

Description

Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome.

Let's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.

This abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.

Thus, "localization" will be spelt as "l10n", and "internationalization» will be spelt as "i18n".

You are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.

Input

The first line contains an integer n (1 ≤ n ≤ 100). Each of the following n lines contains one word. All the words consist of lowercase Latin letters and possess the lengths of from 1 to 100 characters.

Output

Print n lines. The i-th line should contain the result of replacing of the i-th word from the input data.

Sample Input

Input
复制代码
1
2
3
4
5
4 word localization internationalization pneumonoultramicroscopicsilicovolcanoconiosis
Output
复制代码
1
2
3
4
word l10n i18n p43s



最后

以上就是追寻口红最近收集整理的关于CodeForces 71A Way Too Long Words的全部内容,更多相关CodeForces内容请搜索靠谱客的其他文章。

本图文内容来源于网友提供,作为学习参考使用,或来自网络收集整理,版权属于原作者所有。
点赞(73)

评论列表共有 0 条评论

立即
投稿
返回
顶部