forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA.cpp
More file actions
33 lines (28 loc) · 1.01 KB
/
A.cpp
File metadata and controls
33 lines (28 loc) · 1.01 KB
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
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
using namespace std;
int main() {
int n;
while (cin >> n) {
map<string,int> f;
f["polycarp"] = 1;
int res = 0;
FOR(i,1,n) {
string a, tmp, b;
cin >> a >> tmp >> b;
REP(i,a.length()) if (a[i] >= 'A' && a[i] <= 'Z') a[i] ^= ' ';
REP(i,b.length()) if (b[i] >= 'A' && b[i] <= 'Z') b[i] ^= ' ';
f[a] = f[b] + 1;
res = max(res, f[a]);
}
cout << res << endl;
}
return 0;
}