12393번 - Equal Sums (Large) 스페셜 저지다국어

I have a set of positive integers S. Can you find two non-empty, distinct subsets with the same sum? 

Note: A subset is a set that contains only elements from S, and two subsets are distinct if they do not have exactly the same elements.

The first line of the input gives the number of test cases, T. T test cases follow, one per line. Each test case begins with N, the number of positive integers in S. It is followed by Ndistinct positive integers, all on the same line.

Limits

• No two numbers in S will be equal.
• 1 ≤ T ≤ 10.
• N is exactly equal to 500.
• Each number in S will be a positive integer less than 10¹².

For each test case, first output one line containing "Case #x:", where x is the case number (starting from 1).

• If there are two different subsets of S that have the same sum, then output these subsets, one per line. Each line should contain the numbers in one subset, separated by spaces.
• If it is impossible, then you should output the string "Impossible" on a single line.

If there are multiple ways of choosing two subsets with the same sum, any choice is acceptable.