ZOJ 3406 Another Very Easy Task
2013-08-22 21:03
351 查看
水题啊、、字符串处理啊、、
Another Very Easy Task
Time Limit: 2 Seconds Memory Limit: 65536 KB
This task is so easy that the description is omitted.
Another Very Easy Task
Time Limit: 2 Seconds Memory Limit: 65536 KB
This task is so easy that the description is omitted.
Sample Input
A numeronym is a number-based word. Most commonly, a numeronym is a word where a number is used to form an abbreviation (albeit not an acronym or an initialism). Pronouncing the letters and numbers may sound similar to the full word: "K9" for "canine" (phonetically: "kay" + "nine"). A similar example in French is "K7" for "cassette" (phonetically: "ka" + "sept"). Alternatively, the letters between the first and last are replaced by a number representing the number of letters omitted, such as "i18n" for "internationalization". Sometimes the last letter will also be counted and omitted. According to Tex Texin, the first numeronym of this kind was "S12n", the electronic mail account name given to DEC employee Jan Scherpenhuizen by a system administrator because his surname was too long to be an account name. Colleagues who found Jan's name unpronounceable often referred to him verbally as "S12n". The use of such numeronyms became part of DEC corporate culture.
Sample Output
A n7m is a n4r-b3d w2d. M2t c6y, a n7m is a w2d w3e a n4r is u2d to f2m an a10n (a4t n1t an a5m or an i8m). P9g t1e l5s a1d n5s m1y s3d s5r to t1e f2l w2d: "K9" f1r "c4e" (p10y: "k1y" + "n2e"). A s5r e5e in F4h is "K7" f1r "c6e" (p10y: "ka" + "s2t"). A11y, t1e l5s b5n t1e f3t a1d l2t a1e r6d by a n4r r10g t1e n4r of l5s o5d, s2h as "i18n" f1r "i18n". S7s t1e l2t l4r w2l a2o be c5d a1d o5d. A7g to T1x T3n, t1e f3t n7m of t2s k2d w1s "S12n", t1e e8c m2l a5t n2e g3n to D1C e6e J1n S12n by a s4m a11r b5e h1s s5e w1s t1o l2g to be an a5t n2e. C8s w1o f3d J1n's n2e u13e o3n r6d to h1m v6y as "S12n". T1e u1e of s2h n8s b4e p2t of D1C c7e c5e.
#include <stdio.h> #include <string.h> int main() { char s[1010]; int i, t, k; while(gets(s)) { k = strlen(s); t = 0; int flag = 0; for(i = 0; i < k; i++) { if((('a' <= s[i] && s[i] <= 'z') || ('A' <= s[i] && s[i] <= 'Z')) && !flag) { printf("%c",s[i]); flag = 1; } else if((('a' <= s[i] && s[i] <= 'z') || ('A' <= s[i] && s[i] <= 'Z')) && flag == 1) { if(i+1 < k && (('a' <= s[i+1] && s[i+1] <= 'z') || ('A' <= s[i+1] && s[i+1] <= 'Z'))) t++; else { if(t > 0) printf("%d",t); t = 0; flag = 0; printf("%c",s[i]); } } else { printf("%c",s[i]); flag = 0; } } printf("\n"); } return 0; }
相关文章推荐
- zoj 3406 Another Very Easy Task
- zoj 3406 Another Very Easy Task
- Another Very Easy Task
- Easy 2048 Again - ZOJ 3802 状压dp
- zoj 2480 Simplest Task in Windows(水~)
- A. Appleman and Easy Task( brute force implementation)
- An Easy Task
- hdu 1076 An Easy Task
- Codeforces Beta Round #95 (Div. 2) -- E. Yet Another Task with Queens(STL)
- hdu1076——An Easy Task
- hdu 1076 An Easy Task
- 问题九十四: An Easy Task
- ZOJ 3791 An Easy Game[dp]
- ZOJ 3437 Very Hard Problem
- FZU 1753 Another Easy Problem 解题报告(素因子统计)
- Running "uglify:generated" (uglify) task takes a very long time.
- 杭电1047 An Easy Task - java 解读
- [hdoj试题]An Easy Task
- zoj 3610 Yet Another Story of Rock-paper-scissors 忽悠。。
- fzu 1753 Another Easy Problem