Check if is possible to get given sum from a given set of elements
Given array of numbers and a integer x. Find whether it is possible or not to get x by adding elements of given array, we may pick a single element multiple times. For a given array, there can be many sum queries.
Examples:
Input : arr[] = { 2, 3}
q[] = {8, 7}
Output : Yes Yes
Explanation :
2 + 2 + 2 + 2 = 8
2 + 2 + 3 = 7
The idea is to first sort the given array and then use the concept similar to Sieve of Eratosthenes. First take a large sized array ( which is maximum size of x). Initially keep zero in all it’s indexes. Make 1 at zero index ( we can get zero whatever the array is) . Now, traverse through the whole array and make all possible values as 1.
C++
// CPP program to find if we can get given // sum using elements of given array. #include <bits/stdc++.h> using namespace std; // maximum size of x const int MAX = 1000; // to check whether x is possible or not int ispossible[MAX]; void check(int arr[], int N) { ispossible[0] = 1; sort(arr, arr + N); for (int i = 0; i < N; ++i) { int val = arr[i]; // if it is already possible if (ispossible[val]) continue; // make 1 to all it's next elements for (int j = 0; j + val < MAX; ++j) if (ispossible[j]) ispossible[j + val] = 1; } } // Driver code int main() { int arr[] = { 2, 3 }; int N = sizeof(arr) / sizeof(arr[0]); check(arr, N); int x = 7; if (ispossible[x]) cout << x << " is possible."; else cout << x << " is not possible."; return 0; } |
chevron_right
filter_none
Java
// Java program to find if we can get given // sum using elements of given array. import java.util.*; class solution { // maximum size of x int MAX = 1000; // to check whether x is possible or not static int []ispossible = new int[1000]; static void check(int[] arr, int N) { ispossible[0] = 1; Arrays.sort(arr); for (int i = 0; i < N; ++i) { int val = arr[i]; // if it is already possible if (ispossible[val] == 1) continue; // make 1 to all it's next elements for (int j = 0; j + val < 1000; ++j) if (ispossible[j]== 1) ispossible[j + val] = 1; } } // Driver code public static void main(String args[]) { int[] arr = { 2, 3 }; int N = arr.length; check(arr, N); int x = 7; if (ispossible[x]== 1) System.out.println(x+" is possible."); else System.out.println(x+" is not possible."); } } // This code is contributed by // Shashank_Sharma |
chevron_right
filter_none
Python3
# Python3 program to find if we can get given # sum using elements of the given array. def check(arr, N): ispossible[0] = 1 arr.sort() for i in range(0, N): val = arr[i] # if it is already possible if ispossible[val]: continue # make 1 to all it's next elements for j in range(0, MAX - val): if ispossible[j]: ispossible[j + val] = 1 # Driver code if __name__ == "__main__": arr = [2, 3] N = len(arr) # maximum size of x MAX = 1000 # to check whether x is possible or not ispossible = [0] * MAX check(arr, N) x = 7 if ispossible[x]: print(x, "is possible.") else: print(x, "is not possible.") # This code is contributed by # Rituraj Jain |
chevron_right
filter_none
C#
// C# program to find if we can get given // sum using elements of given array. using System; class GFG { // to check whether x is possible or not static int []ispossible = new int[1000]; static void check(int[] arr, int N) { ispossible[0] = 1; Array.Sort(arr); for (int i = 0; i < N; ++i) { int val = arr[i]; // if it is already possible if (ispossible[val] == 1) continue; // make 1 to all it's next elements for (int j = 0; j + val < 1000; ++j) if (ispossible[j] == 1) ispossible[j + val] = 1; } } // Driver code public static void Main() { int[] arr = { 2, 3 }; int N = arr.Length; check(arr, N); int x = 7; if (ispossible[x]== 1) Console.WriteLine(x + " is possible."); else Console.WriteLine(x + " is not possible."); } } // This code is contributed by // Akanksha Rai |
chevron_right
filter_none
PHP
<?php // PHP program to find if we can get given // sum using elements of given array. // maximum size of x $MAX = 1000; // to check whether x is possible or not $ispossible[$MAX] = array(); function check($arr, $N) { global $MAX; $ispossible[0] = 1; sort($arr, 0); for ($i = 0; $i < $N; ++$i) { $val = $arr[$i]; // if it is already possible if ($ispossible[$val]) continue; // make 1 to all it's next elements for ($j = 0; $j + $val < $MAX; ++$j) if ($ispossible[$j]) $ispossible[$j + $val] = 1; } } // Driver code $arr = array( 2, 3 ); $N = sizeof($arr); check($arr, $N); $x = 7; if (ispossible[$x]) echo $x . " is possible."; else echo $x . " is not possible."; // This code is contributed // by Akanksha Rai ?> |
chevron_right
filter_none
Output:
7 is possible.
Recommended Posts:
- Check if all the elements can be made of same parity by inverting adjacent elements
- Check if an array contains all elements of a given range
- Check if all elements of the array are palindrome or not
- Check if all array elements are distinct
- Check if all elements of binary array can be made 1
- Check if a given array contains duplicate elements within k distance from each other
- Check if all the elements can be made equal on dividing with X and Y
- Query to check if a range is made up of consecutive elements
- Check if the array has an element which is equal to XOR of remaining elements
- Check if elements of an array can be arranged satisfying the given condition
- Check if the array has an element which is equal to sum of all the remaining elements
- Check if array elements are consecutive | Added Method 3
- Check if elements of an array can be arranged in a Circle with consecutive difference as 1
- Queries to check whether all the elements in the given range occurs even number of times
- Check if the array has an element which is equal to product of remaining elements
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.
- Maximum number of elements without overlapping in a Line
- Longest alternative parity subsequence
- Find all unique pairs of maximum and second maximum elements over all sub-arrays in O(NlogN)
- Count number of permutation of an Array having no SubArray of size two or more from original Array
- Find the maximum sum of digits of the product of two numbers