Submission #6544437

---

Source Code Expand

#include<stdio.h>
int main()
{
	int ans[5003];
	int i, j;
	int n, m;
	ans[0] = 0;
	n = 1;
	int p[9] = { 25,39,51,76,163,111,128,133,138 };
	for (i = 0; i < 9; i++)
	{
		m = n;
		for (j = 0; j < m; j++)
		{
			ans[n] = ans[j] + p[i];
			n++;
		}
	}
	m = n;
	for (i = 0; i < m; i++)
	{
		ans[n] = ans[i] + 136;
		ans[n + 1] = ans[i] + 58;
		n += 2;
	}
	for (i = 0; i < n - 1; i++)
	{
		if (ans[i] > ans[i + 1])
		{
			ans[i] ^= ans[i + 1];
			ans[i + 1] ^= ans[i];
			ans[i] ^= ans[i + 1];
			if (i > 0)
				i -= 2;
		}
	}
	printf("%d", ans[0]);
	for (i = 1; i < n; i++)
		if (ans[i] > ans[i - 1])
			printf("\n%d", ans[i]);
	printf("\n");
	return 0;
}

Submission Info

Judge Result