>>> diophantine(10,6,14) (-7.0, 14.0) >>> diophantine(391,299,-69) (9.0, -12.0) But above equation has one more solution i.e.,

Function to display queue elements */

* Print the graph */

Function to check if the heap is empty or not

Note that if n is not large enough, i.e. at least 255, then there might be clashes due to 2+ ascii codes giving out same encrypted value.

Function to insert elements in a queue */

>>> extended_euclid(10, 6) (-1, 2) >>> extended_euclid(7, 5) (-2, 3)

Based on the fact that: b % a = b - (b // a) * a\\ gcd(a, b) = gcd(b%a, a)

>>> extended_gcd(10, 6) (2, -1, 2) >>> extended_gcd(7, 5) (1, -2, 3) ** extended_gcd function is used when d = gcd(a,b) is

>>> extended_gcd(10, 6) (2, -1, 2) >>> extended_gcd(7, 5) (1, -2, 3)

Function to find if there exists a triplet in the array A[] which sums up to X.

Function to find the candidate for Majority */

This function prints common elements in ar1

Function to find the longest common prefix (LCP) between a given set of strings