uva 10815 Andy's First Dictionary stl 函数
来源:互联网 发布:0501网络热门事件水仙 编辑:程序博客网 时间:2024/04/29 14:21
Andy's First Dictionary
DESCRIPTION
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
when
题目的意思是这样的:从文章中输入一段话,将其中的单词按字典序排序输出,不计重复单词~~
自己想到的实用set<string> 来解决这类问题,因为这个函数包含有两个效果,1是不计重复单词,2是排序
刚好满足这两个条件
#include<stdio.h>#include<string>#include<iostream>#include<string.h>#include<set>#include<string.h>using namespace std;set<string> my;set<string>::iterator k;char a[500];char b[210];string ans;void change() //大写转小写{ int len=strlen(b); for(int i=0;i<len;i++) if(b[i]>='A'&&b[i]<='Z')b[i]+=32; }int main(){ my.clear(); while(gets(a)){ int len,i,j=0; len=strlen(a); a[len]=' '; a[len+1]='\0'; for(i=0;i<=len;i++){ if( ( (a[i]<='z') && (a[i]>='a') ) || ( (a[i]<='Z') && (a[i]>='A') ) ){ b[j++]=a[i]; } else { b[j]='\0'; j=0; change(); ans=b; my.insert( ans ); //将小写单词输入集合中 } } //for } k=my.begin(); //依次输出 k++; for(;k!=my.end();k++) cout<<*k<<endl; }
- uva 10815 Andy's First Dictionary stl 函数
- UVA 10815 Andy's First Dictionary(STL)
- UVa - 10815 Andy's First Dictionary(STL)
- UVa - 10815 - Andy's First Dictionary(STL - 集合set)
- UVA 10815 Andy's First Dictionary(stl,set)
- UVa 10815 Andy's First Dictionary 【STL】【set】
- uva-10815-Andy's First Dictionary-stl-set
- 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
- 类.class和类对象.getClass()、Class.forName("类名")的区别
- mongo db 使用方法
- 谷歌新专利:激光投射键盘将人体变触控屏(图)
- linux I2C架构
- asp.net页面中 回车触发提交事件(转)
- uva 10815 Andy's First Dictionary stl 函数
- 工作中通过js脚本减轻httpd服务器的压力
- SQL Server 2008中SQL应用之-“死锁(Deadlocking)”
- 转载TortoiseSVN的使用详解3(http://www.cnblogs.com/xiaobaihome/archive/2012/03/20/2407610.html)
- 浅析 Java Thread.join()
- 程序员技术练级攻略[转]
- 监控SQL Server2005与sql 2008数据库的运行状况
- 百度搜索结果页面的参数 首页类型(rsv_spt)
- PowerDesigner 的4 种模型文件