Given two integers n and g, the task is to generate an increasing sequence of n integers such that:
- The gcd of all the elements of the sequence is g.
- And, the sum of all the elements is minimum among all possible sequences.
Input: n = 6, g = 5
Output: 5 10 15 20 25 30
Input: n = 5, g = 3
Output: 3 6 9 12 15
Approach: The sum of the sequence will be minimum when the sequence will consist of the elements:
g, 2 * g, 3 * g, 4 * g, ….., n * g.
Below is the implementation of the above approach:
5 10 15 20 25 30
- Number of ways to divide string in sub-strings such to make them in lexicographically increasing sequence
- Count the number of non-increasing subarrays
- Count permutations that are first decreasing then increasing.
- Check if an array is increasing or decreasing
- Increasing permutation of first N natural numbers
- Sum of array elements that is first continuously increasing then decreasing
- Print all non-increasing sequences of sum equal to a given number x
- Print all increasing sequences of length k from first n natural numbers
- Number of Permutations such that no Three Terms forms Increasing Subsequence
- Generate k digit numbers with digits in strictly increasing order
- Length of the longest increasing subsequence such that no two adjacent elements are coprime
- Minimum increment operations to make the array in increasing order
- Minimum value of X to make all array elements equal by either decreasing or increasing by X
- Sum of the sequence 2, 22, 222, .........
- Aronson's Sequence
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.