Write a function pythagorean that takes three integers $a$, $b$, $c$, and returns the boolean whose value is whether they constitute a Pythagorean triple, meaning that equality $a^2 + b^2 = c^2$ is satisfied. For example pythagorean(3,4,5) should return true, and pythagorean(2,4,6) should return false. This function does not output anything. You don't need to define a prototype. Test your function in your main function with the following values: Sample output1: Enter 3 numbers: 3 4 5 true Sample output2: Enter 3 numbers: 2 4 6 false

Write a function pythagorean that takes three integers $a$, $b$, $c$, and returns the boolean whose value is whether they constitute a Pythagorean triple, meaning that equality $a^2 + b^2 = c^2$ is satisfied. For example pythagorean(3,4,5) should return true, and pythagorean(2,4,6) should return false. This function does not output anything. You don't need to define a prototype. Test your function in your main function with the following values: Sample output1: Enter 3 numbers: 3 4 5 true Sample output2: Enter 3 numbers: 2 4 6 false

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 17PE

See similar textbooks

Similar questions

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 a function that receives 3 assignment grades, a1, a2, a3, and a final grade, f, for a student and returns the corresponding letter grade of the student. The weights for the assignments and the final are 0.2, 0.2, 0.2, and 0.4, respectively. You can use the following table for matching grades to letters: 95-100 -> A1 90-94 -> A2 85-89 -> A3 80-84 -> B1 75-79 -> B2 70-74 -> B3 65-69 -> C1 60-64 -> C2 55-59 -> C3 40-54 -> D 0-39 -> F For example, compute_letter(80, 60, 40, 70) returns "C2" because 80 * 0.2 + 50 * 0.2 + 40 * 0.2 + 70 * 0.4 = 62 and 62 corresponds to C2. Note that, you are expected to do rounding. For example, 39.4 is F, whereas 39.5 is D. You can use the builtin round() function for this. Please google this function and learn how to use it. """
A function k whose domain is the set of positive integers is defined as k(1)=4 and k(n)=k(n-1)-2. Function k was evaluated for several numbers. Select each statement below that is true. A - k(0)=−2 B - k(2)=2 C - k(3)=0 D - k(6)=3 E - k(−1)=−4
Write a complete C program for the X O Game which is played by two Players. Player 1 has the X symbol and Player 2 has the O symbol. Each time a player inserts X or O in the matrix, the game checks for a wining case using a function called CheckCase that takes the matrix as a parameter and return the winning player if a winning case is achieved. If no winning case is achieved the function returns -1 and the game continue until it is finished. Note: 1) A winning case happens when three cells in the matrix have a similar symbol vertically, horizontally or on the main or auxiliary diagonals. 2) The Matrix size is 3X3 3) Player 1 could add max 5 symbols and player 2 4 symbols. 4) The game keeps on working until one player wins the game. At the end of each round the game either announces the winning player or that none of the players won the game.
Write a Paython program , without using def function Please . Let f be the function from A to B where A={1, 2, 3, 4} and B = {a, b, c, d} with f(1)=d, f(2)=b, f(3)=c, and f(4)=a, then check all the condition for f whether f is:(i) One to one function(ii) Onto function(iii) One to one correspondence function Advance Many Many Thanks dear tutor .
Interesting, intersecting def squares_intersect(s1, s2): A square on the two-dimensional plane can be defined as a tuple (x, y, r) where (x, y) are the coordinates of its bottom left corner and r is the length of the side of the square. Given two squares as tuples (x1, y1, r1) and (x2, y2, r2), this function should determine whether these two squares intersect, that is, their areas have at least one point in common, even if that one point is merely the shared corner point when these two squares are placed kitty corner. This function should not contain any loops or list comprehensions of any kind, but should compute the result using only integer comparisons and conditional statements. This problem showcases an idea that comes up with some problems of this nature; it is actually far easier to determine that the two squares do not intersect, and negate that answer. Two squares do not intersect if one of them ends in the horizontal direction before the other one begins, or if the same…
Write a function that replaces a substring with a new string. Example: >>> replace('The quick brown fox jumps over the lazy dog', 'quick', 'slow') The slow brown fox jumps over the lazy dog The first parameter is the string, second is the substring to be replaced and the third is the string to replace the substring. If there are more than one occurrence of a substring, replace it all.
Write program in python with a function occupy(n), which shows how birds are going to occupy n nests, assuming that each new bird will choose the nest in the middle of the largest unoccupied run of nests. For example, if there were 10 nests, occupy(10) would print out the following sequence, where underscore indicates an unoccupied nest, and X indicates an occupied nest. The first line of the printout is just 10 underscores showing that all the nests are unoccupied. The second line shows that a bird came to nest in position 5, since that is one the first middle positions of the unoccupied run from 0 to 9. In the third line a bird came to occupy the middle position for the longest open run of nests, from 0 to index 4.
Define a function CalcPyramidVolume with double data type parameters baseLength, baseWidth, and pyramidHeight, that returns as a double the volume of a pyramid with a rectangular base. Relevant geometry equations:Volume = base area x height x 1/3Base area = base length x base width.(Watch out for integer division). #include <iostream>using namespace std; /* Your solution goes here */ int main() { double userLength; double userWidth; double userHeight; cin >> userLength; cin >> userWidth; cin >> userHeight; cout << "Volume: " << CalcPyramidVolume(userLength, userWidth, userHeight) << endl; return 0;}
Write a function biggestBuried(s), which the parameter s is a string, and the function returns the largest integer buried in the string. If there is no integer inside the string, then return 0. For example, biggestBuried('abcd51kkk3kk19ghi') would return 51, and biggestBuried('kkk32abce@@-33bb14zzz') would return 33, since the '-' character is treated like any other non digit. Note that a character is a digit if it is greater than or equal to '0' and less than or equal to '9'. Alternatively, you can use string.isdigit() to check if the string is a digit. Use the function in a program to test that it works properly by saying print(biggestBuried('abcd51kkk3kk19ghi')) answer should be 51 print(biggestBuried('kkk32abce@@-33bb14zzz')) answer should be 33 print(biggestBuried('this15isast22ring-55')) answer should be 55
Write a function numRolls that simulates the following dice game: a player repeatedly rolls a pair ofdice until the second time that doubles is rolled. The function then returns the total number of rollsmade. For example, suppose the player rolls the following pairs: (3,2), (3,3), (1,5), (5,5). The game thenstops because the player has rolled doubles twice, (3,3) and (5,5). The function returns 4, the totalnumber of rolls made: Use python
Write a function rps in Python that returns the result of a game of "Rock,Paper, Scissors". The function accepts two arguments, each one of 'R','P','S' , that represents the symbol played by each of the two players. The function returns: -1 if the first player wins0 if a tie1 if the second player winsScissors beats Paper beats Rock beats Scissors Sample usage: >>> rps('R','P') # player 2 wins, return 11