Mobile coding works. A laptop is faster for long sessions.
Problem
Given N and K (1 ≤ K ≤ N ≤ 8), count the number of ways to partition the set {1, 2, ..., N} into K non-empty subsets using recursion.
Input format
Input
input.txt
- Two integers N and K
Output format
Output
output.txt
- The number of ways
Example
input
4 2
output
7
💬 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
4 2
Expected output
7
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