Mobile coding works. A laptop is faster for long sessions.
Problem
Given coins of denominations A1...An (each unlimited supply) and a target amount X, find the minimum number of coins needed to make X (or -1 if not possible).
Input format
Input
input.txt
- First line: N X (1 ≤ N ≤ 10, 1 ≤ X ≤ 100) - Second line: N integers (1 ≤ Ai ≤ 50)
Output format
Output
output.txt
- The minimum number of coins or -1
Example
input
3 11 1 5 7
output
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 11 1 5 7
Expected output
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