BUCTOJ程序设计——生日相同

#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
char a[200][200];
int b[200], c[200];
int d[13][32][200];
int e[13][32] = { 0 };
void an(int ok) { if (ok == 0)printf("None"); }
int main() {
    int n;
    cin>>n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i]>>b[i]>>c[i];
      
        e[b[i]][c[i]]++;
        d[b[i]][c[i]][e[b[i]][c[i]]] = i;
        if (e[b[i]][c[i]] == 1)continue;
        int l1 = d[b[i]][c[i]][e[b[i]][c[i]] - 1];
        int l2 = d[b[i]][c[i]][e[b[i]][c[i]]];
        int len2 = strlen(a[l2]);
        int len1 = strlen(a[l1]);
        if (len1 > len2 || (len1 == len2 && strcmp(a[l1], a[l2])