Submission #2172757

---

Source Code Expand

#include <iostream>

using namespace std;
typedef long long  ll;
#define rep(i,s,n)for(ll i = s;i<n;i++)

struct Node {
	char name[51];
	int count = 0;
	Node* next;
	Node* prev;
};

Node* nil;

void init() {
	nil = (Node *)malloc(sizeof(Node));
	nil->count = -1;
	nil->next = nil;
	nil->prev = nil;
}

bool ifExist(char* name, Node* node) {
	while (true) {
		rep(i, 0, 51) {
			if (name[i] == '\0' && node->name[i] == '\0') {
				return true;
			}
			else if (name[i] == '\0' || node->name[i] == '\0' || name[i] != node->name[i]) {
				return false;
			}
		}
	}
	return true;
}
void addLast(char* name) {
	Node* node = new Node;
	rep(i, 0, 51) {
		node->name[i] = name[i];
		if (name[i] == '\0') {
			break;
		}
	}
	node->count++;

	node->next = nil;
	nil->prev->next = node;
	node->prev = nil->prev;
	nil->prev = node;
}

void countName(char* name) {
	Node* node = nil->next;

	bool isExist = false;
	while (true) {
		if (node->count == -1)break;
		if (ifExist(name, node)) {
			isExist = true;
			node->count++;
			break;
		}
		node = node->next;
	}

	if (!isExist) {
		addLast(name);
	}
}

int main() {
	int N; cin >> N;
	char n[51];
	init();

	rep(i, 0, N) {
		cin >> n;
		countName(n);
	}

	int maxName = 0;
	Node* maxNode;
	Node* countNode = nil->next;

	while (true) {
		if (maxName < countNode->count) {
			maxNode = countNode;
			maxName = countNode->count;
		}
		countNode = countNode->next;
		if (countNode->count == -1) {
			break;
		}
	}

	cout << maxNode->name << endl;
	return 0;
}

Submission Info

Judge Result