swust.oj.319

#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
int a[9];
int vis[10];
void dfs(int count)
{
	if (count == 9)
	{
		int d, b, c;
		d = a[0] * 100 + a[1] * 10 + a[2];
		b = a[3] * 100 + a[4] * 10 + a[5];
		c = a[6] * 100 + a[7] * 10 + a[8];
		if (d + b == c&&d < b)
		{
			if (d > b)
			{
				swap(d, b);
			}
			if (d > c)
			{
				swap(d, c);
			}
			if (b > c)
			{
				swap(b, c);
			}
			printf("%d %d %d\n", d, b, c);
		}
		return;
	}
	for (int i = 1; i <= 9; i++)
	{
		if (!vis[i])
		{
			a[count] = i;
			vis[i] = 1;
			dfs(count + 1);
			vis[i] = 0;
		}
	}
}

int main()
{
	memset(a, 0, sizeof(a));
	memset(vis, 0, sizeof(vis));
	dfs(0);
	return 0;
}