题目： A. Way Too Long Words
time limit per test: 1 second
memory limit per test: 256 megabytes
input: standard input
output:standard 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
| input |
|---|
|
4 word localization internationalization pneumonoultramicroscopicsilicovolcanoconiosis |
| output |
|
word l10n i18n p43s |
思路：
用string接收字符串，如果该字符串长度小于等于10，则原样输出；否则输出首字符+（length-2）+尾字符；
代码：
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
string s;
cin>>s;
if(s.length()<=10) printf("%s
",s.c_str());
else printf("%c%d%c
",s[0],s.length()-2,s[s.length()-1]);
}
return 0;
}