110303 Common Permutation

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

using namespace std;

#define MAX_CHAR_IN_LINE 1002

static void FormatStr(char* line)
{
	int len = strlen(line);
	if (line[len - 1] == '\n')
	{
		line[len - 1] = '\0';
		--len;
	}
	sort(line, line + len);
}

static void HandleCommonPermutation(char* line1, char* line2)
{
	FormatStr(line1);
	FormatStr(line2);

	int i = 0, j = 0;
	while(true)
	{
		if ((line1[i] == '\0') || (line2[j] == '\0'))
			break;

		if (line1[i] == line2[j])
		{
			cout << line1[i];
			++i;
			++j;
		}
		else
		{
			if (line1[i] < line2[j])
				++i;
			else
				++j;
		}
	}

	cout << endl;
}

static void TestAll()
{
	static char s_Line1[MAX_CHAR_IN_LINE], s_Line2[MAX_CHAR_IN_LINE];

	while(true)
	{
		if (!fgets(s_Line1, MAX_CHAR_IN_LINE, stdin))
			return;
		if (!fgets(s_Line2, MAX_CHAR_IN_LINE, stdin))
			return;

		HandleCommonPermutation(s_Line1, s_Line2);
	}
}

int main(int argc, char* argv[])
{
	TestAll();
	return 0;
}