1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <stack>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while((found = str.find_first_of(delim, current)) != string::npos) {
res.push_back(string(str, current, found - current));
current = found + 1;
}
res.push_back(string(str, current, str.size() - current));
return res;
}
int main() {
int n;
while(cin >> n && n) {
vector<string> s(n);
rep(i, n) cin >> s[i];
map<string, set<string> > m;
map<string, int> id;
vector<string> res[n];
rep(i, n) {
vector<string> ret = split(s[i], ':');
id[ret[0]] = i;
string t = "";
rep(j, ret[1].size()) {
if(ret[1][j] == ',' || ret[1][j] == '.') {
m[ret[0]].insert(t);
res[i].push_back(t);
t = "";
} else {
t += ret[1][j];
}
}
}
set<string> S;
stack<string> st;
bool used[105];
memset(used, 0, sizeof(used));
used[0] = true;
rep(i, res[0].size()) {
st.push(res[0][i]);
while(st.size()) {
string tp = st.top();
st.pop();
if(m.count(tp) == 0) {
S.insert(tp);
} else if(!used[id[tp]]){
used[ id[tp] ] = true;
set<string>::iterator ite;
for(ite = m[tp].begin(); ite != m[tp].end(); ite++) {
st.push(*ite);
}
}
}
}
cout << S.size() << endl;
}
return 0;
}
|