really need help Chess bishop moves diagonally in any number of squares. Given two different squares of the chessboard, determine whether a bishop can go from the first square to the second one in a single move. The program receives four numbers from 1 to 8 each specifying the column and the row number, first two - for the first square, and the last two - for the second square. The program should output YES if a bishop can go from the first square to the second one in a single move or NO otherwise. Define a function called bishop_move # Example input ``` 4 4 5 5 ``` # Example output ``` YES ```

really need help Chess bishop moves diagonally in any number of squares. Given two different squares of the chessboard, determine whether a bishop can go from the first square to the second one in a single move. The program receives four numbers from 1 to 8 each specifying the column and the row number, first two - for the first square, and the last two - for the second square. The program should output YES if a bishop can go from the first square to the second one in a single move or NO otherwise. Define a function called bishop_move # Example input ``` 4 4 5 5 ``` # Example output ``` YES ```

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

See similar textbooks

Similar questions

Chess bishop moves diagonally in any number of squares. Given two different squares of the chessboard, determine whether a bishop can go from the first square to the second one in a single move. The program receives four numbers from 1 to 8 each specifying the column and the row number, first two - for the first square, and the last two - for the second square. The program should output YES if a bishop can go from the first square to the second one in a single move or NO otherwise. Define a function called bishop_move # Example input ```4455``` # Example output ```YES``` #
Archery Scorer. Write a program that draws an archery target (see Pro-gramming Exercise 2 from Chapter 4) and allows the user to click five times to represent arrows shot at the target. Using five-band scoring, abulls-eye (yellow) is worth 9 points and each successive ring is worth 2fewer points down to 1 for white. The program should output a score foreach click and keep track of a running sum for the entire series.
Problem Description: In the Whimsical Library, each book is enchanted with a magical code to ensure the protection of knowledge. The validation process for these magical codes involves a combination of mathematical spells. The validation process is described as follows: Take the sum of the digits at odd positions from left to right. Take the sum of the squared digits at even positions from left to right. If the absolute difference between the results from step 1 and step 2 is a prime number, the book code is considered valid; otherwise, it is invalid. Example 1: Consider the magical book code 86420137. Step 1. Take the sum of the digits at odd positions from left to right. 8+4+0+3=15 Step 2. Take the sum of the squared digits at even positions from left to right. 6^2+2^2+1^2+7^2=36+4+1+49 = 90 Step 3. If the absolute difference between the results from step 1 and step 2 is a prime number. 115-901 75 (not a prime number) Book code 86420137 is invalid. Example 2: Now, let's examine the…
Arranging Pebbles Write a program that can arrange a group of pebbles into its designated position. We have 4 types of pebbles: Red, white, blue, and green colored pebbles. Supposed that we have an n-number of pebbles, the program should be able to check the color of the pebble and arrange them in such a way that it will look something like this: Example, if there are 9 pebbles; 1 green, 3 white, 2 blue, and 3 red, the program will output something like this: RRRWWWBBG NOTE: The program will let the user to enter the pebbles and then the program will automatically arrange it. Sample output 1: R=Red, W-White, B=Blue, G=Green Enter pebbles: rwgbrgwbrg Arranged pebbles: RRRWWBBGGG Sample output 2: R=Red, W-White, B=Blue, G=Green Enter pebbles: abcde Invalid input Notice that the arrangement of the pebbles is: Red, White, Blue, Green
See the sample outputs for more clarification. Project Specifications Input for this project: Values of the grid (row by row) Output for this project: Whether or not the grid is magic square Programmer's full name Project number Project due date Processing Requirements Use the following template to start your project: #include using namespace std; // Global constants // The number of rows in the array // The number of columns in the array // The value of the smallest number // The value of the largest number const int ROWS = 3; const int COLS = 3; const int MIN = 1; const int MAX = 9; // Function prototypes bool isMagicsquare(int arrayRow1[], int arrayRow2 [], int arrayRow3[], int size); bool checkRange (int arrayRow1[], int arrayRow2[], int arrayRow3[], int size, int min, int max); bool checkUnique(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size); bool checkRowSum (int arrayrow1[], int arrayrow2[], int arrayrow3[], int size); bool checkColiSum(int arrayrow1[], int…
Exercise III: Catalan numbers For n e N, denote by c, to be the number of ways to form a "mountain range" with n upstrokes (U) and n downstrokes (D) that all stay above a horizontal line. For instance: for n = 1, only UD is allowed, so c = 1; • for n = 2, only UUDD and UDUD are allowed, so c2 = 2. 1. Check that c3 = 5 by writing down or drawing all possible options. 2. Consider the power series +00 g(x) = 2 n=0 (by definition co = 1) called the generating function of the sequence (en). Justify that cn < 4" for each n, and deduce that the radius of convergence of g is at least 1/4. 3. It can be show that for r E (-1/4, 1/4), g(x) = 1+ xg(r)? and therefore 1- VI 4.x g(x) = 2.x Use this formula and the known power series of V1+ x to write the first terms of the power series expansion of g, in the form g(x) = co + c1x + c2x2 + C3x + c4x* + ·.. Show how you obtain a few terms, but you do not need to show all computations and you can use a calculator for fractions. Check that you recover co,…
This program should compound interest continuously. It asks the user for the number of times they want to see their $1 compounded. And the years used in the equation are 1,2,4,8,16.2^N. I. E. I want to see it compounded three times so the user enters 3. The problem is that when I run it. It computes it as though it's going through numbers like 1,2,3,4,5,6,7,8,9. But I need it to go through the numbers I have it. As in 1,2,4,8,16..2^N And the out put should read [2.0,2.25,2.44140625 HWOS.py-CAsers/kr Help 205 py (3.7A) File Edit Format Run Options Window .Evan Mar th 14 September 2019 Hamework 2 QS print (*Nodel Compound Interest Produ ct= (1 N - int (input{'Enter N: n -[1,2,4,8,116,20] tor a in range (2, N+1) : for 2, 2, 4. D , 16 .. 2-N Periods.) for 3 in range ( len (n>.. - 2 (1+1/1) Droduct.appernd (amount) amount Print (product) ...
Brute force equation solver this is python program. Numerous engineering and scientific applications require finding solutions to a set of equations. Ex: 8x + 7y = 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for x and y in the range -10 to 10. Ex: If the input is: 8 7 38 3 -5 -1 Then the output is: 3 2 Use this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so, output the solution, and finish. Ex: If no solution is found, output: No solution You can assume the two equations have no more than one solution. Note: Elegant mathematical techniques exist to solve such linear equations. However, for other kinds of equations or situations, brute force can be handy. ''' Read in first equation, ax + by = c '''a = int(input())b = int(input())c = int(input()) ''' Read in…
This program should compound interest continuously. It asks the user for the number of times they want to see their $1 compounded. And the years used in the equation are 1,2,4,8,16...2^N. I. E. I want to see it compounded three times so the user enters 3. The problem is that when I run it. It computes it as though it’s going through numbers like 1,2,3,4,5,6,7,8,9. But I need it to go through the numbers I have it. As in 1,2,4,8,16...2^N
This program should compound interest continuously. It asks the user for the number of times they want to see their $1 compounded. And the years used in the equation are 1,2,4,8,16...2^N. I. E. I want to see it compounded three times so the user enters 3. The problem is that when I run it. It computes it as though it’s going through numbers like 1,2,3,4,5,6,7,8,9. But I need it to go through the numbers I have it. As in 1,2,4,8,16...2^N And the out put should read [2.0,2.25,2.44140625
Question: 1A perfect number is an integer that is the sum of its positive proper divisors (all divisors except itself). For example, 6 is a perfect number. The divisors of 6 except itself are 1,2 and 3. The sum of the proper divisors of 6 is 6. Thus 6 is a perfect number. You have to take integers as input and continue taking input until the word “STOP” is given as input. After taking the inputs you have to classify the integers as Perfect and Imperfect and store it in a dictionary(Please see the output for better understanding).[Note: You CANNOT use any built in functions EXCEPT input(),range(),print()]Sample Input :61082528100496530STOPSample Output:(No need to follow the output format. Just print the resultant dictionary.){Perfect: [6,28,496],Imperfect: [10,8,25,100,530]}
Using C++ Dice game with varying dice (d4-d20) The game will consist of two or more players. Each player will attempt to reach a set number (say 100) By rolling dice and adding up the results of the dice roll. if the player rolls a certain number (in this case a 6) then the player gets two more tries, if they roll a 6 two more times, they lose their turn and gain no points that round. The goal to get to 100 first. During a round, each player takes a turn. At the beginning of the game, each player rolls a dice, with the higher roll going first each round. A player’s total score is the sum of their turn scores, the users will have the ability to choose either to stop or to continue after first roll, if a player decides to stop, then their turn ends and their score for that turn is their maximum roll during that turn, if the player decides to continue, they roll the dice again. At the end of the game the program should display the winner your program should have at least four of…