[字符串] CF-71A. Way Too Long Words

标签：proc   spec   let   too long   length   rac   lca   ict   under   

题目链接：http://codeforces.com/contest/71/problem/A

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

Examples output

word
l10n
i18n
p43s

题目大意：

有一些单词太长了，写起来太累了。如果有一些单词长度（字母个数）超过十，我们就用[首字母+中间字母个数+尾字母]的格式书写，如果不超过十，就按照原来单词书写。输入一个整数n，表示单词个数，接下来有n个单词，请你正确书写单词。

问题分析：

字符数组或字符串都可以做，只需要求出字符串长度，判断长度就可以了。

#include <bits/stdc++.h>
using namespace std;int main(){
	char s[110];
	int n;
	cin >> n;
	for(int i=1; i<=n; i++){
		cin >> s;
		int len = strlen(s);
		if(len>10)
			cout << s[0] << len-2 << s[len-1] << endl;
		else
			cout << s << endl;
	}
	return 0;
} 

[字符串] CF-71A. Way Too Long Words

标签：proc   spec   let   too long   length   rac   lca   ict   under   

原文地址：https://www.cnblogs.com/gdgzliu/p/13367600.html