Uva - 10815 - Andy's First Dictionary
来源:互联网 发布:qq有linux版本吗 编辑:程序博客网 时间:2024/05/19 13:14
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
用set比较好是因为用insert插入完成,set中的元素已经从小到大排序好了
AC代码:
#include <iostream>#include <cstdio>#include <cstdlib>#include <cctype>#include <cstring>#include <string>#include <sstream>#include <vector>#include <set>#include <map>#include <algorithm>using namespace std;set<string> dict;int main(){string s, buf;while (cin >> s) {for (int i = 0; i < s.length(); i++) {if (isalpha(s[i])) {s[i] = tolower(s[i]);}else {s[i] = ' ';}}stringstream ss(s);while (ss >> buf) {dict.insert(buf);}}for (set<string>::iterator it = dict.begin(); it != dict.end(); it++) {cout << *it << endl;}return 0;}
- 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
- 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
- android_Environment类
- riot.js 学习【一】自定义标签
- 优先级队列的实现
- HttpURLConnection
- 使用VS2010时遇到的一些小问题的解决方案(从各处搜罗总结的,不定期更新,向原作者致敬)
- Uva - 10815 - Andy's First Dictionary
- UVA 10911--Forming Quiz Teams+状态压缩+记忆化搜索
- 学习
- HQL
- 项目BUG
- 杨辉三角
- 解决“Sublime Text 2”中,中文输入法不跟随的问题_PnS001
- lua--函数之多重返回值
- 【BZOJ2683】简单题