Given a number n, find two pairs that can represent the number as sum of two cubes. In other words, find two pairs (a, b) and (c, d) such that given number n can be expressed as
n = a^3 + b^3 = c^3 + d^3
where a, b, c and d are four distinct numbers.
Input: N = 1729 Output: (1, 12) and (9, 10) Explanation: 1729 = 1^3 + 12^3 = 9^3 + 10^3 Input: N = 4104 Output: (2, 16) and (9, 15) Explanation: 4104 = 2^3 + 16^3 = 9^3 + 15^3 Input: N = 13832 Output: (2, 24) and (18, 20) Explanation: 13832 = 2^3 + 24^3 = 18^3 + 20^3
Any number n that satisfies the constraint will have two distinct pairs (a, b) and (c, d) such that a, b, c and d are all less than n1/3. The idea is very simple. For every distinct pair (x, y) formed by numbers less than the n1/3, if their sum (x3 + y3) is equal to given number, we store them in a hash table using sum as a key. If pairs with sum equal to given number appears again, we simply print both pairs.
1) Create an empty hash map, say s. 2) cubeRoot = n1/3 3) for (int x = 1; x < cubeRoot; x++) for (int y = x + 1; y <= cubeRoot; y++) int sum = x3 + y3; if (sum != n) continue; if sum exists in s, we found two pairs with sum, print the pairs else insert pair(x, y) in s using sum as key
Below is the implementation of above idea –
(2, 24) and (18, 20)
Time Complexity of above solution is O(n2/3) which is much less than O(n).
Can we solve the above problem in O(n1/3) time? We will be discussing that in next post.
This article is contributed by Aditya Goel. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Find Cube Pairs | Set 2 (A n^(1/3) Solution)
- Find initial integral solution of Linear Diophantine equation if finite solution exists
- Percentage increase in volume of the cube if a side of cube is increased by a given percentage
- Count of pairs in an Array whose sum is a Perfect Cube
- Find the Largest Cube formed by Deleting minimum Digits from a number
- Find the diagonal of the Cube
- Find Cube root of a number using Log function
- Find the concentration of a solution using given Mass and Volume
- Josephus problem | Set 1 (A O(n) Solution)
- Compute nCr % p | Set 1 (Introduction and Dynamic Programming Solution)
- Volume of cube using its space diagonal
- Centered cube number
- Count all triplets whose sum is equal to a perfect cube
- Program for cube sum of first n natural numbers
- C Program for cube sum of first n natural numbers
- C++ Program for cube sum of first n natural numbers
- Java Program for cube sum of first n natural numbers
- Python Program for cube sum of first n natural numbers
- Program for Volume and Surface Area of Cube
- N-th number which is both a square and a cube
Improved By : princiraj1992