Given two integers N and K, the task is to represent N as sum of K even number. If it is not possible to represent the number, print -1.
Note: The representation may contain duplicate even numbers.
Input: N = 6, K = 3
Output: 2 2 2
The given number 6 can be represented as 2 + 2 + 2 = 6
Input: N = 8, K = 2
Output: 2 6
The given number 3 can be represented as 2 + 6 = 8
Approach: To solve the problem mentioned above a simple solution is to maximise the occurrence of 2 which is the smallest even number. Necessary condition to represent N as sum of K numbers are:
- (K – 1) * 2 must be less than N.
- N – (K – 1) * 2 must be Even.
Below is the implementation of the above approach:
Time Complexity: O(K)
- Represent K^N as the sum of exactly N numbers
- Represent K as sum of N-bonacci numbers
- Represent N as sum of K odd numbers with repetitions allowed
- Represent the given number as the sum of two composite numbers
- Represent N as sum of K even or K odd numbers with repetitions allowed
- Represent a number as sum of minimum possible psuedobinary numbers
- Represent the fraction of two numbers in the string format
- Minimum count of numbers required from given array to represent S
- Sort numbers based on count of letters required to represent them in words
- Represent a number as a sum of maximum possible number of Prime Numbers
- Represent n as the sum of exactly k powers of two | Set 2
- Different ways to represent N as sum of K non-zero integers
- Represent a given set of points by the best possible straight line
- Count of sticks required to represent the given string
- Represent (2 / N) as the sum of three distinct positive integers of the form (1 / m)
- Count of matchsticks required to represent the given number
- Count of integers up to N which represent a Binary number
- Count of ways to represent N as sum of a prime number and twice of a square
- Maximum number of distinct positive integers that can be used to represent N
- Number of distinct ways to represent a number as sum of K unique primes
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.