We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Given a sum of positive integers S and a their number n, find the number of distinct arrays under these conditions:
S
n
In each array, there are n elements whose sum is equal to S.
In each array, each element should be greater than or equal to the element on its left.
The elements formed in each array are distinct
E.g. 1.:
<=
The text was updated successfully, but these errors were encountered:
hamidgasmi
No branches or pull requests
Given a sum of positive integers
S
and a their numbern
, find the number of distinct arrays under these conditions:In each array, there are
n
elements whose sum is equal toS
.In each array, each element should be greater than or equal to the element on its left.
The elements formed in each array are distinct
E.g. 1.:
n
) elements a sum of 8 (S
) with each element on the left<=
element on the right. There are 5 possible distinct options.The text was updated successfully, but these errors were encountered: