Skip to content

Commit

Permalink
Update Fillup_buckets.cpp
Browse files Browse the repository at this point in the history
STREIN-11 authored Oct 17, 2023

Verified

This commit was created on GitHub.com and signed with GitHub’s verified signature.
1 parent f7bc60a commit 468fc37
Showing 1 changed file with 1 addition and 0 deletions.
1 change: 1 addition & 0 deletions Daily/Fillup_buckets.cpp
Original file line number Diff line number Diff line change
@@ -2,6 +2,7 @@
Given n buckets and infinite number of balls. The maximum capacity of each bucket is given in an array capacity[].
Find the number of ways to fill the buckets with balls such that each bucket has atleast 1 ball and all the buckets have distinct number
of balls in them.Note: Since the answer may be very large, calculate the answer modulo 10^9+7.
Input:
n = 1
capacity = [6]

0 comments on commit 468fc37

Please sign in to comment.