算典05_例题_03_UVA-10815

Andy’s First Dictionary

题意

题解

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>

using namespace std;
const int maxn = 1e2 + 5;
const int INF = (1<<31)-1;
#define met(a, b) memset(a, b, sizeof(a));
#define IN freopen("in.txt", "r", stdin);
typedef long long LL;

string s, a;
set<string> Set;

int main(){
#ifdef _LOCAL
IN;
#endif // _LOCAL

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 >> a) Set.insert(a);
}
set<string>::iterator it = Set.begin();
for(; it!= Set.end(); ++it) {
cout << (*it) <<endl;
}
return 0;
}