Write a function named `pairs(a,b,c,d)` that takes four integers as its input and checks whether the sum of any two of these integers is equal to the sum of the other two. If so, the function RETURNs this sum. Otherwise, it RETURNs -1. For example, `pairs(1,2,3,4)` should return 5, because 1 + 4 = 2 + 3 = 5. Another example, `pairs(11,22,13,20)` should return 33, because 11 + 22 = 13 + 20 = 33. Another example, `pairs(1,2,3,5)` should return -1, because no such two pairs exist among these numbers. """ def pairs(a,b,c,d): # remove the following line to solve this question return

Write a function named `pairs(a,b,c,d)` that takes four integers as its input and checks whether the sum of any two of these integers is equal to the sum of the other two. If so, the function RETURNs this sum. Otherwise, it RETURNs -1. For example, `pairs(1,2,3,4)` should return 5, because 1 + 4 = 2 + 3 = 5. Another example, `pairs(11,22,13,20)` should return 33, because 11 + 22 = 13 + 20 = 33. Another example, `pairs(1,2,3,5)` should return -1, because no such two pairs exist among these numbers. """ def pairs(a,b,c,d): # remove the following line to solve this question return

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter6: User-defined Functions

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

Write a function that keeps computing the sum of the digits of x^n, until there is only one digit left. For example, sumOfDigits(2,5) returns 5, because 2 ^ 5 = 32 = 3 + 2 = 5 Another example, sumOfDigits(2,8) returns 4, because 2 ^ 8 = 128 = 1 + 2 + 8 = 13 = 1 + 3 = 4
get_nth_comma_in_string(s, n): This function takes a string s and a non-negative integer n as input. It returns the index of the n’th comma in the string s. We will start counting at 0, so if n=0, then the index of the first comma should be returned; if n=1, then the index of the second comma should be returned, and so on. If there is no n’th comma in s, then -1 should be returned. Note: You may use the string find method in this function.
Write a function in C programming language that gets two ints x and y, and returns the sum of all ints between x and y, including them. int sum_interval(int x, int y); For example: - sum_interval(1, 4)returns 1+2+3+4=10. - sum_interval(10, 3)returns 3+4+5+6+7+8+9+10=52. - sum_interval(2, -1)returns (-1)+0+1+2=2. - sum_interval(-1, -1)returns -1. Note that we may have x>=y or x<=y. You may assume that the sum will be within the range of int.
Write the code in python to define a function has_repeat(mystr), which takes a string parameter and returns a boolean result. - If mystr has a character that is repeated (count is more than 1 for that character), return True - Otherwise, return False Hint: You can solve this problem by iterating over the characters in mystr and comparing each character's count with 1. For example: Test Result print(has_repeat("Happy")) True print(has_repeat("sad")) False print(has_repeat("salmons")) True print(has_repeat("Trouts")) False
Write a function named sum_nums() that takes two positive integers x and y as input parameters. Your program should loop from the lower number to the higher number and sum all those numbers in between that are not divisible by 5 and return the final sum. For example, if x = 13 and y = 4, your function would return the value of 4+6+7+8+9+11+12+13. Again, if x = 4 and y = 13, your function should return the same value. Call this function using different input parameters to test your code.
Write a generator function named count_seq that doesn't require any arguments and generates a sequence that starts like this: 2, 12, 1112, 3112, 132112, 1113122112, 311311222112, 13211321322112, ...To get a term of the sequence, count how many there are of each digit (in a row) in the **previous** term. For example, the first term is "one 2", which gives us the second term "12". That term is "one 1" followed by "one 2", which gives us the third term "1112". That term is "three 1" followed by "one 2", or 3112. Etc.Your generator function won't just go up to some limit - it will keep going indefinitely. It may need to treat the first one or two terms as special cases, which is fine. It should yield the terms of the sequence as **strings**, rather than numeric values, for example "1112" instead of 1112.
get_nth_word_from_string(s, n): This function takes a string s and a non-negative integer n as input. The string s may contain substrings of text separated by commas. The function should return the n’th comma-separated substring. We will start counting at 0, so if n=0, then the first substring should be returned (i.e., everything before the first comma, if there is such a comma); if n=1, then the second substring should be returned (i.e., everything between the first comma and second comma, if there is such a comma); and so on. If there is no n’th substring in s, then the empty string should be returned. Note: You may use the string count method in this function. Note: If a space follows a comma, do not include the space as part of the substring to be returned.
get_nth_word_from_string(s, n): This function takes a string s and a non-negative integer n as input. The string s may contain substrings of text separated by commas. The function should return the n’th comma-separated substring. We will start counting at 0, so if n=0, then the first substring should be returned (i.e., everything before the first comma, if there is such a comma); if n=1, then the second substring should be returned (i.e., everything between the first comma and second comma, if there is such a comma); and so on. If there is no n’th substring in s, then the empty string should be returned. Note: You may use the string count method in this function. Note: If a space follows a comma, do not include the space as part of the substring to be returned. >>> get_nth_word_from_string("dreary, pondered, weak, weary", 0) 'dreary'
In Python write a function decoding() that takes an encoded string and an integer as the parameters, and returns the original string. The encoding was performed as follows. First, the original string is reversed. Then, each character in the new string is replaced by the character that is a given number of positions away in the ASCII character encoding table. For example, the following call to yur function : encoding('ABCabc', -10) should return the encoded string 'YXW987'.
Write a function validate_date(date_string) which takes in a datestring and checks if the datestring is valid. If the string is valid, we want to return a tuple containing True and the date_string itself. If the string is invalid for a specific reason, we want to return a tuple containing False and the error code explaining what was wrong with the date string passed in. Below is the error codes for reasons why a string can be invalid (based on criteria on validity, read above): -1 --> date_string does not separate the day, month, and year with slashes. -2 --> day, month, or year are not numeric. -3 --> month out of range (not between 1 and 12) -4 --> day is out of range (not between 1 and last day of the month) For instance, if validate_date(date_string) is called with "01/12/2022" as the argument, the return value is (True, "01/12/2022") because "01/12/2022" is a valid string. If validate_date(date_string) is called with "01/44/2022" as the argument, the return value is…
Write a function called repeater(s1, s2, n) that given two strings s1 and s2 and an integer n returns a string that starts with an underscore ('_'), then s1 and s2 alternate n times, then ends with an underscore. Please do not use loops.
Write a program in Python with a function perfectcube(n), which returns True if n is a perfect cube and returns False otherwise. Notice that this function is not printing anything, but rather returning True or False. The function must use exhaustive enumeration to check if n is a perfect cube. Use the function in a program where you ask the user for n and you print a statement like "Yes, that is a perfect cube" or "No, that number is not a perfect cube".