Ways to sum to N using Natural Numbers up to K with repetitions allowed

Total count of sorted numbers upto N digits in range [L, R] (Magnificent necklace combinatorics problem)

Number of arrays of size N whose elements are positive integers and sum is K

Count possible splits of sum N into K integers such that the minimum is at least P

Generate a combination of minimum coins that sums to a given value

Count numbers present in partitions of N

Count of Ways to Choose N People With at Least X Men and Y Women from P Men and Q Women | Set 2

Rencontres Number (Counting partial derangements)

Count ways to place M objects in distinct partitions of N boxes

Count Derangements (Permutation such that no element appears in its original position)

Calculate Stirling numbers which represents the number of ways to arrange r objects around n different circles

Count of ways to convert 2 into N by squaring, adding 1 or multiplying with 2

Count ways to remove objects such that exactly M equidistant objects remain

Count of Ways to Choose N People Containing at Least 4 Boys and 1 Girl from P Boys and Q Girls | Set 2

Number of ways to write N as a sum of K non-negative integers

Count all N-length arrays made up of distinct consecutive elements whose first and last elements are equal

Expected number of moves to reach the end of a board | Dynamic programming

Count of sequence of length K in range [1, N] where every element is a multiple of its previous one

Minimum number of days in which no task is performed

C++ Program for Ways to sum to N using Natural Numbers up to K with repetitions allowed

Last Updated : 27 Jan, 2022

Given two integers N and K, the task is to find the total number of ways of representing N as the sum of positive integers in the range [1, K], where each integer can be chosen multiple times.

Examples:

Input: N = 8, K = 2
Output: 5
Explanation: All possible ways of representing N as sum of positive integers less than or equal to K are:

{1, 1, 1, 1, 1, 1, 1, 1}, the sum is 8.

{2, 1, 1, 1, 1, 1, 1}, the sum is 8.

{2, 2, 1, 1, 1, 1}, the sum is 8.

2, 2, 2, 1, 1}, the sum is 8.

{2, 2, 2, 2}}, the sum is 8.

Therefore, the total number of ways is 5.

Input: N = 2, K = 2
Output: 2

Suggest improvement

Minimum number of days in which no task is performed

C++ Program to Count rotations which are divisible by 10

Share your thoughts in the comments

Similar Reads

Ways to sum to N using Natural Numbers up to K with repetitions allowed

Represent N as sum of K odd numbers with repetitions allowed

Represent N as sum of K even or K odd numbers with repetitions allowed

Pick maximum sum M elements such that contiguous repetitions do not exceed K

Smallest character in a string having minimum sum of distances between consecutive repetitions

Sum of Manhattan distances between repetitions in a String

Ways to sum to N using array elements with repetition allowed

Find ways an Integer can be expressed as sum of n-th power of unique natural numbers

Check if an Array is made up of Subarrays of continuous repetitions of every distinct element

Maximize minimum distance between repetitions from any permutation of the given Array

GeeksforGeeks

Article Tags :

Practice Tags :