text: In the second line print a correct function g(t).The set of the points (xt = f(t), yt = g(t)) (0 ≤ t ≤ 50) must satisfy the condition, that there is at least one point inside or on the border of each of the circles, Ruslan thinks of at the beginning.Examples Input 3 0 10 4 10 0 4 20 10 4 Output t abs((t-10)) Note Correct functions: 1.10 2.(1+2) 3.((t-3)+(t*4)) 4.abs((t-10)) 5.(abs((((23-t)*(t*t))+((45+12)*(t*t))))*((5*t)+((12*t)-13))) 6.abs((t-(abs((t*31))+14)))) Incorrect functions: 1.3+5+7 (not enough brackets, it should be ((3+5)+7) or (3+(5+7))) 2.abs(t-3) (not enough brackets, it should be abs((t-3)) 3.2+(2-3 (one bracket too many) 4.1(t+5) (no arithmetic operation between 1 and the bracket) 5.5000*5000 (the number exceeds the maximum) <image> The picture shows one of the possible solutions # Solution def f(x): if x == n: return "0" if x == 0: return "(" + str(X[0]) + "+" + f(1) + ")" ss = "(abs((t-" + str(x-1) + "))-abs((t-" + str(x) + ")))" tmp = (X[x] - X[x - 1]) // 2 re = (X[x] - X[x - 1]) - 2 * tmp X[x] -= re if tmp < 0: tmp = "(0" +str(tmp)+")" ss = "((" + str(tmp) + "*" + ss + ")" + "+" + str(tmp) + ")" return "(" + ss + "+" + f(x + 1) + ")" n = int(input()) #c = [(int(_) for _ in input().split()) for i in range(n)] c = [[int(x) for x in input().split()] for i in range(n)] #print(n, c) X = [c[i][0] for i in range(n)] Y = [c[i][1] for i in range(n)] #print(X) #print(Y) print(f(0)) #print(X) X = Y print(f(0)) # Made By Mostafa_Khaled