1077. Kuchiguse (20)

#include <iostream>
#include <string.h>

using namespace std;

int main()
{
	int n;
	scanf("%d", &n);

	getchar();

	char a[260];
	gets(a);

	int alen = strlen(a), min = 300, count, i, j, k, blen;
	char b[260];

	for(i = 1; i < n; i++)
	{
		gets(b);

		blen = strlen(b);
		for(j = alen - 1, k = blen - 1; j >= 0 && k >= 0; j--, k--)
		{
			if(a[j] != b[k])
			{
				break;
			}
		}

		count = alen - j - 1;
		if(count < min)
		{
			min = count;
		}
	}

	if(min == 0)
	{
		printf("nai\n");
	}
	else
	{
		for(i = alen - min; i < alen; i++)
		{
			printf("%c", a[i]);
		}

		printf("\n");
	}

	system("pause");
	return 0;
}