1077. Kuchiguse (20)

#include <iostream>
#include <cstdio>
#include <stack>
#include <cstring>
using namespace std;

#define N 100

int main(int argc, char **argv) {

	int n;
	scanf("%d", &n);
	getchar();
	
	char line[N][300] = {{}};
	int length[N] = {};

	int minl = 0x7fffffff;

	for(int i = 0; i < n; i ++) {
		gets(line[i]);
		length[i] = strlen(line[i]);
		if(length[i] < minl)
			minl = length[i];
	}

	stack<char> suffix;
	for(int i = 1; i <= minl; i ++) {
		char c = line[0][length[0]-i];
		int j = 1;
		for(; j < n; j ++) {
			if(line[j][length[j]-i] != c)
				break;
		}
		if(j < n)
			break;
		else
			suffix.push(c);
	}

	if(suffix.size()) {
		while(suffix.size()) {
			putchar(suffix.top());
			suffix.pop();
		}
		putchar('\n');
	}
	else {
		printf("nai\n");
	}

	return 0;
}