2021-07-21

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

---

一.题目

A. Way Too Long Words

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Examples
inputCopy
4
word
localization
internationalization
pneumonoultramicroscopicsilicovolcanoconiosis
outputCopy
word
l10n
i18n
p43s

二.AC代码

#include

#include
#include
using namespace std;
int main()
{
int n;
cin>>n;
while(n–)
{
string s;
cin>>s;
int t=s.size();
if(t<=10)
{cout<<s<<endl;}
else
{cout<<s[0]<<t-2<<s[t-1]<<endl;}
}
return 0;
}

总结

简单题
题意为字符串的长度如果大于10就输出第一个字符和总字符长度-2和最后一个字符否则就输出原字符串