3843397_ac_0ms_200k.cpp

北大大牛代码 1240道题的原代码 超级权威

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

using namespace std;

int num, len;
char str[13];
char ans[6];
bool mark;
int used[13];

void check()
{
	int a, b;
	int n[6];

	for (int i = 0; i < 5; i++)
	{
		n[i] = ans[i] - 'A' + 1;
	}
	a = n[0] + n[2] * n[2] * n[2] + n[4] * n[4] * n[4] * n[4] * n[4];
	b = num + n[1] * n[1] + n[3] * n[3] * n[3] * n[3];
	mark = (a == b);
	ans[5] = '\0';
	if (mark)
	{
		for (int i = 0; i < 5; i++)
			putchar(ans[i]);
		putchar('\n');
	}
}

void dfs(int n)
{
	int i;

	if (mark)
		return ;
	if (n == 0)
	{
		check();
		return ;
	}
	for (i = 0; !mark && i < len; i++)
	{
		if (used[i] == 1)
			continue;
		used[i] = 1;
		ans[5 - n] = str[i];
		dfs(n - 1);
		used[i] = 0;
	}
}

bool cmp(char a, char b)
{
	return a > b;
}

int main()
{
	while (true)
	{
		scanf("%d%s", &num, str);
		if (num == 0 && strcmp(str, "END") == 0)
		{
			break;
		}
		mark = false;
		len = strlen(str);
		sort(str, str + len, cmp);
		memset(used, 0, sizeof(used));
		dfs(5);
		if (!mark)
			puts("no solution");
	}
	return 0;
}