Shrek has guessed three positive integers a, b, and c. He keeps these numbers in secret, but he writes down four numbers on a board in arbitrary order their pairwise sums (three numbers) and sum of all three numbers (one number). So, there are four numbers on a board in random order: a + b, a+ c, b + c and a+b+c. You have to guess three numbers a, b, and c using given numbers. Print three guessed integers in any order. Pay attention that some given numbers a, b and c can be equal (it is also possible that a-b=c). Instruction: Create a Java program that will perform the algorithm that will solve the problem using inheritance as shown in the figure. It must satisfy the 3-sample output as shown below. Explain your codes using comments.

Shrek has guessed three positive integers a, b, and c. He keeps these numbers in secret, but he writes down four numbers on a board in arbitrary order their pairwise sums (three numbers) and sum of all three numbers (one number). So, there are four numbers on a board in random order: a + b, a+ c, b + c and a+b+c. You have to guess three numbers a, b, and c using given numbers. Print three guessed integers in any order. Pay attention that some given numbers a, b and c can be equal (it is also possible that a-b=c). Instruction: Create a Java program that will perform the algorithm that will solve the problem using inheritance as shown in the figure. It must satisfy the 3-sample output as shown below. Explain your codes using comments.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Write a program that prints a multiplication table, like this: 1 8 9 10 16 18 20 18 21 24 27 30 123…

A: Using two loops we can print multiplication table easily. int i,j - i is used to access outer loop…

Q: Let's begin with a lesson in roulette. Roulette is a casino game that involves spinning a ball on a…

A: Given The answer is given below.

Q: 4. Let A = {a, b,c, d}. Suppose R is an equivalence relation on A. Suppose R has three equivalence…

A: Answer: Let A = {a, b, c, d, e} so R = {(a, a), (b, b), (c, c), (d, d), (e, e), (a, d), (d, a), (b,…

Q: Write a java program to find the area of a polygon and in which you have you take number if side…

A: Required:- Approach:- Take the number of sides and length of side from the user and then using the…

Q: Write, Compile and Execute a Java method that computes whether a given number is happy or sad.

A: public static int HappyNumber(int num){ int rem = 0, sum = 0;…

Q: A school has been selling raffle tickets to raise funds for the school library. Each ticket is sold…

A: Raffles are a popular fundraising method for schools and organizations, as they can generate…

Q: Children often play a memory game in which a deck of cards containing matching pairs is used.The…

A: The objective of the question is to create a program that simulates a memory game. The game involves…

Q: Need help in writing a backtracking code that finds a path in a given maze. The problem is that the…

A: If I Define the problem as given a maze with obstacles, what will be the number of paths to reach…

Q: A logarithm is kind of like reverse exponents. There is a base and a number in a logarithm. The…

A: Start define a function "logarithm" import math module find math.log(value, base) print the log…

Q: The Monty Hall game is a statistical problem: there is a TV show (like the Monty Hall show) that…

A: a. win=0;loss=0;game=1;while game < 31 fprintf(['Game: ',num2str(game),'\n']) car =…

Q: This challenge is based on the classic videogame "Snake". Assume the game screen is an n * n square,…

A: Algorithm - First take input from. Store the input and process through the below logic. logic -…

Q: Kinetic energy can be calculated with the following formula: KE 1 -mv² همون روز 2 • m is mass in kg…

A: #include <iostream> using namespace std; int main() { float m,v,k,tk=0,n=0; while(1){…

Q: This challenge is based on the classic videogame "Snake". Assume the game screen is an n * n square,…

A: Algorithm - Take input from the user. Now use the below logic - res = 1 count = 0 while…

Q: In mathematics, a prime number is a natural number greater than 1 that is not a product of two…

A: The answer given as below:

Q: At Chef's house there are apples lying on the floor. These apples are numbered from 1 (left one…

A: Input/Output Explanation: The first line of input contains two space-separated integers N and K,…

Q: Jack, a 7-year-old child, is playing with 7 sticks with lengths 1,2,…,7, which can be connected…

A: Below you can find the answer of above stated question:

Q: O First Player

A: First player option A is the correct answer of the given question

Q: Can you help me trying to do this code because I am struggling big time with this. question that i…

A: A class is a blueprint used in object-oriented programming to create objects, or instances. It…

Q: The Monty Hall game is a statistical problem: there is a TV show (like the Monty Hall show) that…

A: a. win=0;loss=0;game=1;while game < 31 fprintf(['Game: ',num2str(game),'\n']) car =…

Q: Idiot’s Delight is a fairly simple game of solitaire, yet it is difficult to win. The goal is to…

A: The scope of this question is to create a Python module named "idiots_delight.py" and define several…

Question

Shrek has guessed three positive integers a, b, and c. He keeps these numbers in secret, but he
writes down four numbers on a board in arbitrary order their pairwise sums (three numbers) and sum
of all three numbers (one number). So, there are four numbers on a board in random order: a + b, a+
c, b + c and a+b+c.
You have to guess three numbers a, b, and c using given numbers. Print three guessed integers in any
order. Pay attention that some given numbers a, b and c can be equal (it is also possible that a-b=c).
Instruction: Create a Java program that will perform the algorithm that will solve the problem using
inheritance as shown in the figure. It must satisfy the 3-sample output as shown below. Explain your codes
using comments.
Main class Creates an instance of "Number"
class and call the methods. in
Input
sequence as shown in the figure.
numl, num2, num3, num4 :int
●
Main
Input class - It contains a method in() that ask
four positive integers for the numbers
on the board in random order.
in()
obj. int()
obj.getnum()
●
Number
a,b,c: int
Number class It contains a method getnum()
that computes and displays the
positive integers a, b and c that four
numbers written on a board are values
a+b, a+c, b + c and a + b + c written
in some order. Print a, b and c in any order.
getnum()
Sample Output:
run:
Enter the four positive integers in any order:
3
6
5
4
The values of 'a', 'b', and 'c' in any order: 1 2 3
BUILD SUCCESSFUL (total time: 5 seconds)

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Input.java

Number.java

Main.java

Output

Step by step

Solved in 4 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Can you help me with this code because I am struggling. The Lights Out puzzle consists of an m x n grid of lights, each of which has two states: on and off. The goal of the puzzle is to turn all the lights off, with the caveat that whenever a light is toggled, its neighbors above, below, to the left, and to the right will be toggled as well. If a light along the edge of the board is toggled, then fewer than four other lights will be affected, as the missing neighbors will beignored. In this section, you will investigate the behavior of Lights Out puzzles of various sizes by implementing a LightsOutPuzzle class. Once you have completed the problems in this section, you can test your code in an interactive setting using the provided GUI. See the end of the section for more details. Task: A natural representation for this puzzle is a two-dimensional list of Boolean values, where True corresponds to the on state and False corresponds to the off state. In the LightsOutPuzzle class, write an…
Java Only Solution: John's barn has a fence consisting of N consecutive sections numbered from left to right from 1 to N. Each part is first painted in one of two colors: red or green, your information is given with string C. The color of the I-th part Ci will be equal to 'R' if the color of the part is red and 'G' if it is green. John decided to paint the whole fence green. To make the normal drawing process more fun he decided to do it using the following process. Every minute (until the whole fence is painted green) you will do the following steps: Select any part of the phone that is painted red. Let's show the index of this section as X. In each section with references X, X + 1, ..., min (N, X + K - 1), flip the color of the corresponding part from red to green and from green to red by re-painting. John wonders how quickly he can paint the phone. Please help her find the minimum number of minutes needed to repaint. Input: 1 73 RGGRGRG Output: 4
One variation on the game of nim is described in Luger. The game begins with a single pile of stones. The move by a player consists of dividing a pile into two piles that contain an unequal number of stones. For example, if one pile contains six stones, it could be subdivided into piles of five and one, or four and two, but not three and three. The first player who cannot make a move loses the game. (5.1) Draw the complete game tree for this version of Nim if the start state consists of six stones. (5.2) Perform a minimax evaluation for this game. Let 1 denote a win and 0 a loss.
This challenge is based on the classic videogame "Snake". Assume the game screen is an n * n square, and the snake starts the game with length 1 (i.e. just the head) positioned on the top left corner. For example, if n = 7 the game looks something like this: BEGINNING In this version of the game, the length of the snake doubles each time it eats food (e.g. if the length is 4, after eating it becomes 8). Create a function that takes the siden of the game screen and returns the number of times the snake can eat before it runs out of space in the game screen. Examples FIRST MOVE snakefill (3) snakefill (6) - 5 snakefill (24) → 9 3
1. Both mergesort and quicksort uses divide and conquer paradigm to sort unsorted list. (a) Imagine you want to write the quicksort algorithm to sort an array into non-increasing order. Write down the partition algorithm that is used in the divide phase in the quicksort algorithm. Show that the time complexity of this algorithm is 0(n). (b) Identify the worst case situation in the naive quicksort algorithm and show that in the worst case situation its time complexity is O(n2)
Correct answer will be upvoted else downvoted. Computer science. You have w white dominoes (2×1 tiles, the two cells are hued in white) and b dark dominoes (2×1 tiles, the two cells are shaded in dark). You can put a white domino on the board in case both board's cells are white and not involved by some other domino. Similarly, you can put a dark domino if the two cells are dark and not involved by some other domino. Would you be able to put all w+b dominoes on the board if you can put dominoes both on a level plane and in an upward direction? Input The main line contains a solitary integer t (1≤t≤3000) — the number of experiments. The primary line of each experiment contains three integers n, k1 and k2 (1≤n≤1000; 0≤k1,k2≤n). The second line of each experiment contains two integers w and b (0≤w,b≤n). Output For each experiment, print YES in case it's feasible to put all w+b dominoes on the board and negative, in any case. You might print each letter…
The classic Eight Queens puzzle is to place eight queens on a chessboard such that no two queens can attack each other (i.e., no two queens are in the same row, same column, or same diagonal). There are many possible solutions. Write a program that displays one such solution.
Please read the thickened sentences below In this game, one flyand three frogs are placed randomly on a board with the size 7x7.In each iteration, they move randomlywithin the board, and the simulation stops when one of the frogs eats the fly.Fly and frogs are essentially creatures that can move, make noise, and eat. Frogs can move up to 2squares in any direction, and flies can move up to 1. Frogs make the "Croak! Croak!" sound, and fliesmake "ZzzZZz!". Since frogs should not eat their kind, a function of "isEatable" should also beimplemented in decision making. A variable or function to check if the fly is alive is also required as aterminate condition for simulation.In each iteration, an 'f' character represents frogs' position on board, and an '*' character is used torepresent the position of fly. Java language please I dont want the survival game starting with the code below I want in Java language and like in photos please #functions def GenerateRandomScene(): scenes =…
I'm developing a card game that requires one deck of 52 cards using Java. The 52 card has 4 suits from top to bottom: diamonds (d), clubs (c), hearts (h), and spades (s). Each card has a point. The rest of the instructions are in the images. Based on the code below, it outputs the maximum points of all 5 sorted cards. Instead, I need the total point chosen from the suit that gives the highest point. The images shown are for reference purposes. import java.util.HashMap; import java.io.*; public class CardPointsList { static HashMap<String,Integer> Code = new HashMap<>(); static HashMap<Character,Integer> Order = new HashMap<>(); static String[][] hand= {{ "c5","s6","sK","dK","dA"},{"s7","s4","dJ","sA","h5"},{"sQ","d3","c9","hK","d5"}}; static int[] scores={0,0,0}; public static void sortHand() { String temp; for (int h=0;h<3;h++) {for (int i=0;i<5;i++) { for (int j=i+1;j<5;j++) { if (hand[h][j].charAt(0)…
In cpp Room contains nx n cubes (in rows and in columns). Each cube is white or black. You can get out of a white cube by going in one of the four directions horizontally or vertically (but you can't go outside the room). You can enter a black cube, but you can't exit it. There is a mouse and a piece of cheese in the room. The mouse is in a cube (0,0) - white, and the cheese in a cube (n-1, n-1) - black. The mouse can move from cube to cube according to the rules described above. Write a program that finds all the ways in which the mouse can move to the cheese, and if any, display it with ‘*’.
Write a program that plays the tic-tac-toe game. Two players take turns clicking an available cell in a grid with their respective tokens (either X or O). When one player has placed three tokens in a horizontal, vertical,or diagonal row on the grid, the game is over and that player has won. A draw (no winner) occurs when all the cells in the grid have been filled with tokens and neither player has achieved a win. Figure 12.17 shows the representative sample runs of the example. Assume that all the cells are initially empty, and that the first player takes the X token and the second player the O token. To mark a cell, the player points the mouse to the cell and clicks it. If the cell is empty, the token (X or O) is displayed. If the cell is already filled, the player’s action is ignored.Define a custom class named Cell that extends Label for displaying a token and for responding to the button-click event. The class contains a data field token with three possible values—' ', X, and…
Mastermind is a code-breaking game for two players. In the original real-world game, one player A selects 4 pegs out of 6 colors and puts them in a certain fixed order; multiples of colors are possible (for example, red-green red-green). His opponent B does not know the colors or order but has to find out the secret code. To do so, B makes a series of guesses, each evaluated by the first player. A guess consists of an ordered set of colors which B believes is the code. The first player A evaluates the guess and feeds back to B how many positions and colors are correct. A position is correct ("black") if the guess and the secret code have the same color. Additional colors are correct ("white"), if they are in the guess and the code, but not at the same location. For example1 2 3 4secret: red-green red greenguess: red blue green purpleresults in one correct position ("black = 1") for the red peg at position one and one additional correct color ("white=1") for the green peg in the guess.…