UVa 10815 Andy's First Dictionary (分离字符串)
来源:互联网 发布:淘宝怎么看第几名下单 编辑:程序博客网 时间:2024/05/01 01:18
10815 - Andy's First Dictionary
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=96&page=show_problem&problem=1756
Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all the words himself, he has a briliant idea. From his bookshelf he would pick one of his favourite story books, from which he would copy out all the distinct words. By arranging the words in alphabetical order, he is done! Of course, it is a really time-consuming job, and this is where a computer program is helpful.
You are asked to write a program that lists all the different words in the input text. In this problem, a word is defined as a consecutive sequence of alphabets, in upper and/or lower case. Words with only one letter are also to be considered. Furthermore, your program must be CaSe InSeNsItIvE. For example, words like "Apple", "apple" or "APPLE" must be considered the same.
Input
The input file is a text with no more than 5000 lines. An input line has at most 200 characters. Input is terminated by EOF.
Output
Your output should give a list of different words that appears in the input text, one in a line. The words should all be in lower case, sorted in alphabetical order. You can be sure that he number of distinct words in the text does not exceed 5000.
Sample Input
Adventures in DisneylandTwo blondes were going to Disneyland when they came to a fork in theroad. The sign read: "Disneyland Left."So they went home.
Sample Output
aadventuresblondescamedisneylandforkgoinghomeinleftreadroadsignsothetheytotwowentwerewhen
STL实现:(set实现)
/*0.029s*/#include<cstdio>#include<string>#include<set>using namespace std;set<string>s;set<string>::iterator it;string str;int main(void){char ch;while (~(ch = getchar())){if (!isalpha(ch)){if (str != "")s.insert(str);str = "";}elsestr += tolower(ch);}for (it = s.begin() ; it != s.end() ; ++it)puts((*it).c_str());return 0;}
非STL实现:(但是会RE,不知道为什么)
#include<cstdio>#include<cctype>#include<cstring>#include<algorithm>using namespace std;char word[5010][210], *p[5010], ch;inline bool getword(char *s){while (!isalpha(ch = getchar()))if (ch == -1) return false;int i = 0;s[i++] = tolower(ch);while (isalpha(ch = getchar()))s[i++] = tolower(ch);s[i] = '\0';return true;}bool cmp(char *a, char *b){return strcmp(a, b) < 0;}int main(void){int n;for (n = 0; getword(word[n]); ++n)p[n] = word[n];sort(p, p + n, cmp);if (n) puts(p[0]);for (int i = 1; i < n; ++i)if (strcmp(p[i], p[i - 1]))puts(p[i]);return 0;}
- UVa 10815 Andy's First Dictionary (分离字符串)
- UVA 10815 - Andy's First Dictionary(字符串)
- uva 10815 Andy's First Dictionary(字符串排序)
- UVA 10815 (暑假-字符串(2) -D - Andy's First Dictionary)
- 字符串训练 ----- UVA 10815题目Andy's First Dictionary
- UVa OJ 10815-Andy's First Dictionary
- uva 10815 Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- UVA 10815 - Andy's First Dictionary
- uva-10815 - Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- UVa-10815 - Andy's First Dictionary
- UVA 10815 - Andy's First Dictionary
- uva -- 10815 Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- c++计时函数比较
- 我的FPGA入门学习计划
- 深入linux设备驱动程序内核机制(第八章) 读书笔记
- LauncherActivity
- The development of e-commerce
- UVa 10815 Andy's First Dictionary (分离字符串)
- SQL数据库还原时错误:操作系统返回了错误 '5(拒绝访问)'的解决办法
- AJAX跨域访问——XMLHttpRequest代理实现
- ActiveX控件进行注册
- >>与>>>
- 图片轮换
- ASP.NET MVC 4应用程序文件夹
- java private成员 无法被继承
- java 空字符串与null区别