UVA - 10815 Andy's First Dictionary

 1 #include <iostream>
 2 #include <cstring>
 3 #include <algorithm>
 4 #include <set>
 5 using namespace std;
 6
 7 set<string> out;
 8
 9 int main()
10 {
11     string s,temp;
12     while(cin>>s)
13     {
14         int len(s.size());
15         for(int i=0;i<len;i++) s[i] = tolower(s[i]);
16         temp.clear();
17
18         for(int i=0;i<len;i++)
19         {
20             if(‘a‘<=s[i]&&s[i]<=‘z‘) temp.push_back(s[i]);
21             else
22             {
23                 if(temp.size() != 0)
24                 {
25                     out.insert(temp);
26                     temp.clear();
27                 }
28             }
29             if(i == len - 1)
30             {
31                 if(temp.size() != 0)
32                 {
33                     out.insert(temp);
34                 }
35             }
36         }
37     }
38     for(set<string>::iterator it=out.begin();it!=out.end();it++)
39         cout<<*it<<endl;
40 }

时间： 2024-10-03 02:48:17

UVA - 10815 Andy's First Dictionary的相关文章

UVa - 10815 Andy's First Dictionary(STL)

题目链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=18649 #include <iostream> #include <string> #include <set> #include <sstream> using namespace std; /******************************************************************

UVA 10815 Andy's First Dictionary（字符处理）

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 book

UVA 10815 Andy‘s First Dictionary（STL: set）

代码如下: #include <iostream> #include <sstream> #include <stdio.h> #include <set> #include <algorithm> #include <string.h> using namespace std; set<string> dict; int main(){ string s,b; while(cin>>s){ for(int i

10815 - Andy's First Dictionary解答

采用数组链表的方式,来插入读入的单词,逐个字符读入单词. #include <stdio.h> #define LEN 200 #include <string> #include <string.h> #include <stdlib.h> struct node { char word[LEN]; struct node * next; }; typedef struct node Word; int main(){ Word* Dict[30]; fo

安迪的第一个字典 Andy's First Dictionary, UVa 10815

(Time limit: 3 seconds) Andy, 8, has a dream - he wants to produce hisvery own dictionary. This is not an easy task forhim, as the number of words that he knows is,well, not quite enough. Instead of thinking up allthe words himself, he has a briliant

【UVa 10815】Andy's First Dictionary

真的只用set和string就行了. 如果使用PASCAL的同学可能就要写个treap什么的了,还要用ansistring. #include<cstdio> #include<cstring> #include<iostream> #include<string> #include<set> using namespace std; string s; string now; set<string> dict; bool is_al

Andy's First Dictionary UVA 10815

#include <stdio.h> #include <ctype.h> #include <string.h> #define MAXN 5000+5 #define MAXM 200+5 typedef struct Dic{ char str[MAXN]; struct Dic* next; }Dic; Dic *head; char word[MAXM]; int cnt=0; int get_word(); void convert_word(); void

F - Andy's First Dictionary (UVA - 10815）

- 题目大意给出一段文章,然后将其中不重复的单词拿出来(全为小写并且由a-z的顺序). - 解题思路我在网上看到的一个stringstream函数,它除了进行字符串和数字转换之外的另一个用途:分割单词.将字符串中所有非单词字符全部转换为空格,然后再用代码中的方法分割出单词.有这种方法就好做多了.结合set容器即可. - 代码 #include<iostream> #include<set> #include<string> #include<sstream&g

【UVA - 10815】Andy's First Dictionary （set）

Andy's First Dictionary Description 不提英文了直接上中文大意吧 XY学长刚刚立下了再不过CET就直播xx的flag,为了不真的开启直播模式,XY学长决定好好学习英语.于是他每天都读一篇只包含生词的英语文章,并以自己高达450的智商在一秒钟之内记忆下来. 现在给你一篇XY学长今天要读的文章,请你写一个程序,输出他都学习到了哪些单词.要求:如果文章中有相同的单词,那么仅仅输出一次:而且如果两个单词只有大小写不同,将他们视为相同的单词. Input 测试数据将输入