Clean IDE, a function on Clean language. 20/* Write a function `coinProblem` that takes* 3 arguments: N, M and K; and solves following* problem:* If you have exactly 1 coin value N and infinite* amount of coins value M, is it possible to choose* coins so that, sum of their value is equal to K?* Return true if it is possible, false otherwise.2122232425262728** For example:1, М %3D 3, К %3D 72930* N =31* 3+3+1 => Yes32* N = 1, M =* Answer is No. As we have only one (N=1) coin andM coins* have value higher than K.*/3310, K = 73435363738coinProblem :: Int Int Int -> Bool39// Start = coinProblem 1 3 7 // True// Start = coinProblem 1 10 7 // False// Start = coinProblem 3 10 3 // True// Start = coinProblem 5 10 50 // True// Start = coinProblem 3 4 21 // False404142434445

PROGRAM EXPLANATION: Include the header file. Define a function coin problem(), this function will…

/* Write a function `coinProblem` that takes * 3 arguments: N, M and K; and solves following * problem: * If you have exactly 1 coin value N and infinite * amount of coins value M, is it possible to choose * coins so that, sum of their value is equal to K? * Return true if it is possible, false otherwise. * * For example: * N = 1, M = 3, K = 7 * 3+3+1 => Yes %3D * * N = 1, M = 10, K = 7 * Answer is No. As we have only one (N=1) coin and M coi * have value higher than K. */ %3D %3D coinProblem :: Int Int Int -> Bool // Start = coinProblem 1 3 7 // True // Start = coinProblem 1 10 7 // False // Start = coinProblem 3 10 3 // True // Start = coinProblem 5 10 50 // True // Start = coinProblem 3 4 21 // False %3D

/* Write a function `coinProblem` that takes * 3 arguments: N, M and K; and solves following * problem: * If you have exactly 1 coin value N and infinite * amount of coins value M, is it possible to choose * coins so that, sum of their value is equal to K? * Return true if it is possible, false otherwise. * * For example: * N = 1, M = 3, K = 7 * 3+3+1 => Yes %3D * * N = 1, M = 10, K = 7 * Answer is No. As we have only one (N=1) coin and M coi * have value higher than K. */ %3D %3D coinProblem :: Int Int Int -> Bool // Start = coinProblem 1 3 7 // True // Start = coinProblem 1 10 7 // False // Start = coinProblem 3 10 3 // True // Start = coinProblem 5 10 50 // True // Start = coinProblem 3 4 21 // False %3D

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 44SA

See similar textbooks

Similar questions

1.) Write a function double power(double x, int n) that will compute xn
How do I implement a function that calculates the score for a single word using the following code: def test_get_word_score(): """ Unit test for get_word_score """ failure=False # dictionary of words and scores words = {("", 7):0, ("it", 7):2, ("was", 7):54, ("weed", 6):176, ("scored", 7):351, ("WaYbILl", 7):735, ("Outgnaw", 7):539, ("fork", 7):209, ("FORK", 4):308} for (word, n) in words.keys(): score = get_word_score(word, n) if score != words[(word, n)]: print("FAILURE: test_get_word_score()") print("\tExpected", words[(word, n)], "points but got '" + \ str(score) + "' for word '" + word + "', n=" + str(n)) failure=True if not failure: print("SUCCESS: test_get_word_score()")
7. Write a function password_check() that takes as input two stringsnewpassword and oldpassword, and that accepts the new password (i.e., returnsTrue) if newpassword is different from oldpassword and newpassword is atleast 6 letters long. If the new password fails the check, your functions should returnFalse.>>> password_check('E10-s2ff', 'E10.s2ff')True>>> password_check('E10sf', 'E10.s2ff')False>>> password_check('E10-s2ff', 'E10-s2ff')False(Extra Credit) For extra credit, extend your password function so that it also checks thatthe new password contains a digit.>>> password_check('E10-s2ff', 'E10.s2ff') True>>> password_check('Eej-sdff', 'E10.s2ff')False
function myCompose(f,g){// TODO: return (f o g);// that is, a function that returns f(g(x)) when invoked on x.}
Transcribed Image Text About initial programming in python: Consider the series: 8. 1)" 1 = 1- 3 1 1 1 2n | 1 n=0 whose sum converges ton/4 That is: П lim s, = a) Write a function that, given n, calculates the sum of the series up to term n. b) Write a function that calculates the sum of the series with an error of less than O.01, that is, calculate the sum of the series series such that |Sn-N/4| < O. 01. Your function must also return the number of terms necessary to reach this error, that is, your function will return a tuple with the two calculated values. Important: It is mandatory to use the function defined in the previous item. Hint: math.fabs(number) returns the absolute value (module) of a number.
Write and test the “digit” function: Function Prototype: int digit(int n,int k)This function returns the kth digit of the positive integer n. For example, if n is the integer 29,415 that is entered by user , then the call digit(n,0) would return the digit 2, and the call digit(n,2) would returnthe digit 4. do this only by using functions and loops. arrays are not allowed. example :Input: n = 29415 , k = 1 output: 9 Input: n = 2 , k = 1 output: index out of bound (return -1)
Create a function sumofAllOdd(s,e) that will return the sum of all odd numbers in a range of inputted numbers s (starting number), e(ending number). For example: Test Result sumofAllOdd(22,55) sumofAllOdd(5,10) Answer:(penalty regime: 10, 20, ... %)
def rectangle_overlap(rect1_bl_x,rect1_bl_y, rect1_tr_x,rect1_tr_y, rect2_bl_x,rect2_bl_y, rect2_tr_x,rect2_tr_y): """ (int,int,int,int,int,int,int,int) -> str Function determines whether two rectangles overlap. When rectangles overlap, the function checks for the following scenarios 1. The two rectangles share the same coordinates 2. The first rectangle is contained within the second 3. The second rectangle is contained within the first 4. The rectangles have overlapping area, but neither is completely contained within the other Function inputs represent x and y coordinates of bottom left and top right corners of rectangles (see lab document) The function return one of the following strings corresponding to the scenario "no overlap" "identical coordinates" "rectangle 1 is contained within rectangle 2" "rectangle…
3. Write the appropriate function definition for each of the following situations:b) Write a function that computes two sums from the elements of an array of integers. Each element of the array contributes to one of the two sums, depending on whether the element itself is even or odd. Your function definition should look like this:void sum(int x[ ]){ int n;int sum_even;int sum_odd;::}
code in python (A) please Solve the so-called "Birthday Problem". Write a program that takes an integer ?N and uses the function np.random.randint (low = 0, high = N) from numpy to generate a random sequence of integers between 00 and ?−1N−1. Run experiments to validate the hypothesis that the number of integers generated until the first repeated value is approximately ?∗?2⎯⎯⎯⎯⎯⎯⎯√π∗N2. a) Write a function birthday(N) that returns the number of values generated until a value is repeated as a function of the range of possible values ?N (from 00 to ?−1N−1); b) Write a function birthday_sim(N) that repeats birthday(N) a total of n_sim = 20000 times and returns the average of all the numbers generated; c) Show on one plot that as ?N increases (with a doubling experiment), from ?=2N=2 to ?=1000N=1000, the value of birthday_sim(N) approaches ?∗?2⎯⎯⎯⎯⎯⎯⎯√π∗N2.
1. Write a function maxCubeVolume in F# that takes a list of floating-point tuples that represent dimensions of a cube (length, width, and height) and returns the volume of the cube that has the largest volume. Each tuple consists of three floating point values that are all greater than zero. The volume of the cube is computed using (length*width*height). If the list is empty, return 0.0. Do not use F# system functions or methods (such as map or max). Examples in F# Interactive: > maxCubeVolume [(2.1, 3.4, 1.8); (4.7, 2.8, 3.2); (0.9, 6.1, 1.0); (3.2, 5.4, 9.9)];;val it : float = 171.072> maxCubeVolume [(0.33, 0.66, 2.75)];;val it : float = 0.59895> maxCubeVolume [];;val it : float = 0.0
Develop a code that gets two integers from the user and calculates and prints their least common multiplier or LCM. LCM is the smallest number that divides both given integers. Example. lcm (10, 15) = 30, lcm (5,7) = 35 and lcm (12, 24) = 24Hint: we know that lcm(x,y) = xy/gcd(x,y) where gcd is the greatest common divisor (discussed in class). Develop a gcd function in your code, get the two numbers from the user, call your function to calculate their gcd and then use the formula above to calculate and display their lcm GOOD LUCK! Reference This is a list of function prototypes of the C library functions presented in class. You may use any of these functions in your solutions (unless the requirements explicitly indicate otherwise). As you have been provided the function prototypes, you are expected to use the functions correctly in your solutions. double atof(char *string); int atoi(char *string); long atol(char *string); int fclose(FILE *filePointer); char *fgets(char…