Code in python only. You are given four integer esteems a, b, c and m. Check if there exists a string that contains: a letters 'A'; b letters 'B'; c letters 'C'; no different letters; precisely m sets of nearby equivalent letters (precisely m such positions I that the I-th letter is equivalent to the (i+1)- th one). Input :The primary line contains a solitary integer t (1≤t≤104) — the number of testcases. Every one of the following t lines contains the portrayal of the testcase — four integers a, b, c and m (1≤a,b,c≤108; 0≤m≤108). Output :For each testcase print "YES" if there exists a string that fulfills every one of the necessities. Print "NO" in case there are no such strings. You might print each letter regardless you need (thus, for instance, the strings yEs, indeed, Yes and YES will all be perceived as sure reply).
Code in python only.
You are given four integer esteems a, b, c and m. Check if there exists a string that contains: a letters 'A'; b letters 'B'; c letters 'C'; no different letters; precisely m sets of nearby equivalent letters (precisely m such positions I that the I-th letter is equivalent to the (i+1)- th one).
Input :The primary line contains a solitary integer t (1≤t≤104) — the number of testcases. Every one of the following t lines contains the portrayal of the testcase — four integers a, b, c and m (1≤a,b,c≤108; 0≤m≤108).
Output :For each testcase print "YES" if there exists a string that fulfills every one of the necessities. Print "NO" in case there are no such strings. You might print each letter regardless you need (thus, for instance, the strings yEs, indeed, Yes and YES will all be perceived as sure reply).
Step by step
Solved in 4 steps with 2 images
