程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> UVA - 10815 Andy's First Dictionary

UVA - 10815 Andy's First Dictionary

編輯:C++入門知識

UVA - 10815 Andy's First Dictionary


Andy's First Dictionary Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu

Submit Status

Description

Download as PDF

Problem B: Andy's First Dictionary

Time limit: 3 seconds


\

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

Joke and image taken from the Web

輸入一個文本,找出所有不同單詞(連續的字母序列),按字典序從小到大輸出,單詞不區分大小寫。

就是用set,不過有個大坑,一開始不明所以的wrong了,看了一個大神的博客才明白的,就是:

輸入345abc6d時 要輸出

abc

下面貼下代碼。

 

#include
#include
#include
#include
#include
using namespace std;
int main()
{
	setdict;
	string s;
	while (cin >> s)
	{
		string temp = "";
		int p = 0;
		for (int i = 0; i < s.length(); i++)
		{		
			if (isalpha(s[i]))
			{
				p = 1;
				if (s[i] >= 'A'&&s[i] <= 'Z') s[i] = s[i] + 32;
				temp = temp + s[i];
			}
			else 
			{
				if (p)   // p==1 表示前面輸入的是字母  p==0 表示前面輸入的不是字母 
				{
					dict.insert(temp);
					p = 0;
					temp = "";
				}
			}
		}
		if (p)
		dict.insert(temp);
	}
	for (set::iterator it = dict.begin(); it != dict.end(); it++)
		cout << *it << endl;
}


 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved