10815 - 安迪的第一个字典 Andy's First Dictionary(stringstream+set+迭代器)
来源:互联网 发布:地理 知乎 编辑:程序博客网 时间:2024/06/06 00:54
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 Disneyland
Two blondes were going to Disneyland when they came to a fork in the
road. The sign read: "Disneyland Left."
So they went home.
Sample Output
a
adventures
blondes
came
disneyland
fork
going
home
in
left
read
road
sign
so
the
they
to
two
went
were
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 Disneyland
Two blondes were going to Disneyland when they came to a fork in the
road. The sign read: "Disneyland Left."
So they went home.
Sample Output
a
adventures
blondes
came
disneyland
fork
going
home
in
left
read
road
sign
so
the
they
to
two
went
were
when
把读到的单词放入set中会自动排序,然后用迭代器按序输出即可,代码如下:
#include <iostream>#include <string>#include <sstream>#include <set>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 i=dict.begin();i!=dict.end();++i) cout<<*i<<endl; return 0;}
0 0
- 10815 - 安迪的第一个字典 Andy's First Dictionary(stringstream+set+迭代器)
- 例题 5-3 安迪的第一个字典(Andy's First Dictionary) UVa 10815
- 安迪的第一个字典(Andy's First Dictionary, UVa 10815)
- 10815 - Andy's First Dictionary(set和stringstream的应用)
- UVA 10815 Andy's First Dictionary 安迪的字典 stl应用 set+string做法
- UVA 10815 Andy's First Dictionary(stringstream,set等)
- 《算法竞赛入门经典2ndEdition 》例题5-3 安迪的第一个字典(Andy's First Dictionary, Uva10815)
- UVa10815,Andy's First Dictionary, set,stringstream
- UVA 10815 Andy's First Dictionary(set的应用)
- UVa 10815 Andy's First Dictionary 【set】【字典序】
- UVa 110815 Andy’s First Dictionary(set,stringstream)
- Andy's First Dictionary(set)
- uvaoj 10815 Andy's First Dictionary set的基本使用
- Andy's First Dictionary(uva 10815) set用法
- UVA 10815 Andy's First Dictionary(stl,set)
- set---Andy's First Dictionary
- Uva 10815 Andy's First Dictionary (字典序)
- set的应用:UVa10815-Andy's First Dictionary
- drawArrayFloat
- 数据库应用-半结构化数据模型1
- Windows API (与磁盘信息相关)
- 【Android】安卓学习笔记之服务的基本用法(二)
- 面试题三 C/C++面试秘笈 查找单链表的中间元素 --程序员面试题
- 10815 - 安迪的第一个字典 Andy's First Dictionary(stringstream+set+迭代器)
- 10个基于 Ruby on Rails 构建的顶级站点
- 让这世界再多一份GNU m4 教程 (全文整理)
- java做的基于vlcj的视频播放器 不能播放视频 黑屏问题
- 博客搬家
- IOS之导航控制器传值
- webkit windows编译经验分享
- Android集成有米广告,简单几步就可以让app为你赚钱!
- Android 中常用的单位