Problem
Given an array of N integers (1 ≤ N ≤ 16), print all non-empty subsets where the sum of elements is unique (no two subsets have the same sum).
Input format
Input
input.txt
- The first line contains N - The second line contains N integers
Output format
Output
output.txt
- Each subset as space-separated numbers (order of numbers in subset doesn't matter)
Example
input
3 1 2 3
output
1 2 3 1 2 1 3 2 3 1 2 3
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
3 1 2 3
Expected output
1 2 3 1 2 1 3 2 3 1 2 3
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc