Answer to Question #211089 in Python for raj

Question

Triplet Sum

Given an array n integers, find and print all the unique triplets (a, b, c) in the array which give the sum K. (a+b+c=K).Input

The first line of the input will be space separated integers, denoting the elements of the array. The second line of the input will be an integer denoting the required sum KOutput

The output should be multiple lines, each line containing a unique triplet. The elements of the triple must be sorted in increasing order and all the triplets printed must be sorted in increasing order. Print "No Matching Triplets Found" if there are no triplets with the given sum.Explanation

Sample Output 1

(0, 8, 21)

(0, 12, 17)

(8, 9, 12)

Sample Input 2

0 1 2 3 5 7 13 17 19 19

22

Sample Output 2

(0, 3, 19)

(0, 5, 17)

(1, 2, 19)

(2, 3, 17)

(2, 7, 13)

Answer 1

a = sorted(map(int, input().split()))
k = int(input())
n = len(a)
res = set()
for i in range(n):
    for j in range(i + 1, n):
        for z in range(j + 1, n):
            tmp_sum = a[i] + a[j] + a[z]
            if tmp_sum == k:
                res.add((a[i], a[j], a[z]))
            elif tmp_sum > k:
                break
for elem in sorted(res):
    print(f'({elem[0]}, {elem[1]}, {elem[2]})')