标签：
Hard to force the CET4&6 is imminent, which makes most of the students a headache. This does not, Liu is trying his best to prepare for the CET6, trying to do a variety of previous year’s problem. But the most helpless for Liu is a quick read of this topic, so he thought of a thing does not make sense is that the statistical article the total number in different words. Here your task is to help Liu solve this problem.
Multiple sets of data, each row is an article. Each article is consisted by lowercase letters and spaces, no punctuation, encounter # when the input end.
Each group output only an integer, which alone make the trip, the integer representing the total number of different words in an article.
you are my friend
can you can a can as a canner can can a can
#
4
5
求一个句子中的不同单词的个数。用string数组保存单词个数然后排序然后比较得出个数。//有一个条件没写纠结了好久orz
AC代码：
#include <stdarg.h> #include <iostream> #include <math.h> #include <iomanip> #include <cctype> #include <cstring> #include <cstdio> #include <algorithm> using namespace std; int main(){ string s;char t; while(getline(cin,s)&&s!="#"){ string p[1000]; int len=s.length(),i=0,count=0,z; while(i<len){ while(s[i]!=' '&&i<len){//忘记加i<len导致最后一个单词变的无限长orz。 t=s[i++]; p[count]+=t; } ++count; i++; } sort(p,p+count); int oo=count,k=0; for(i=1;i<count;++i){ k=0; while(p[i]==p[i-1]){ k++;i++; } oo-=k; } cout<<oo<<'\12'; } return 0; }
标签：
原文地址：http://blog.csdn.net/zp___waj/article/details/46124113
