HDU-2072 单词数 水题一枚

//STATUS:G++_AC_0MS_376KB
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define LL long long
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define mem(a,b) memset(a,b,sizeof(a))
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
const int MAX=100010,INF=0x3f3f3f3f;

map<string,int> q;
char s[MAX];

int main()
{
//    freopen("in.txt","r",stdin);
int i,j,len,ans;
while(gets(s)!=NULL && s[0]!='#')
{
ans=0;
q.clear();
len=strlen(s);
for(i=0;i<len;i=j+1){
while(s[i]==' ' && i<len)i++;
if(i==len)break;
for(j=i;s[j]!=' ' && j<len;j++);
s[j]='\0';
if(!q[s+i]){
q[s+i]=1;
ans++;
}
}

printf("%d\n",ans);
}
return 0;
}