MY Code2

2072：

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

int end(string str)
{
    for(int i = 0; i < str.size(); ++i)
        if(str[i] == '#')
            return 1;
    return 0;
}
/*
int count(string str)
{
    bool flag = true;
    int n = 0;
    for(int i = 1; i < str.size(); ++i)
        if(flag && str[i] != ' ')
        {
            n++;
            flag = false;
        }
        else if(str[i] == ' ')
            flag = true;
    return n;
}
*/
void get_next(string str, int& beg, int& end)
{
    for(; str[beg] == ' '; ++beg);
    for(end = beg+1; end < str.size() && str[end] != ' '; ++end);
}

int count(vector<string> s)
{
    int n = 1;
    if(s.size() == 0)
        n = 0;
    for(int i = 1; i < s.size(); ++i)
        if(s[i] != s[i-1])
            n++;
    return n;
}

int main()
{
    string str;
    while(getline(cin, str))
    {
        if(end(str))
            break;
        int beg  = 0, end = 0;
        vector<string> s;
        while(end < str.size())
        {
            get_next(str, beg, end);
            string ss(str.begin()+beg, str.begin()+end);
            if(beg != str.size())
                s.push_back(ss);
            beg = end;
        }
        sort(s.begin(), s.end());
        cout << count(s) << endl;
    }
    return 0;
}