Create a C++ game that would have an output that is given in the picture.First loop in the game needs to include: the user to choose a number between 1 and 100. and the user is only allowed 6 tries in the game. Second loop needs to ask the player if they want to play again answering with a character 'Y' or 'N'. The second game is a guessing game. A sample run for the game follows, and user input is shownin boldface in the sample run.Welcome to the game of Guess It!I will choose a number between 1 and 100.You will try to guess that number. If you guess wrong, I will tell you ifyou guessed too high or too low.You have 6 tries to get the number.OK, I am thinking of a number. Try to guess it.Your guess? 50Too high!Your guess? 112Illegal guess. Your guess must be between 1 and 100.Try again. Your guess? 23**** CORRECT ****Want to play again? NGood bye, it was fun. Play again soon.

#include <iostream> #include <cstdlib> #include <ctime> using namespace std; int…

Create a C++ game that would have an output that is given in the picture. First loop in the game needs to include: the user to choose a number between 1 and 100. and the user is only allowed 6 tries in the game. Second loop needs to ask the player if they want to play again answering with a character 'Y' or 'N'.

Create a C++ game that would have an output that is given in the picture. First loop in the game needs to include: the user to choose a number between 1 and 100. and the user is only allowed 6 tries in the game. Second loop needs to ask the player if they want to play again answering with a character 'Y' or 'N'.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 1GZ

See similar textbooks

Similar questions

AGU Computer Engineering Department created a new mathematical game that can be played with two people. In this game, you are given a list of random integers. At each round, the first player takes two numbers from the list and calculates the sum of these numbers. Then, the second player takes two numbers and makes the same calculation. The higher one is going to take the round and increment the score by 1. At the end of the game, who has the better score will win the game. Here are the rules for the game: There are always an even number of items on the list There are two colors for the players: Green and Red Green starts the game At each round, green plays and then red plays The player takes the first and the last numbers The game can end Tie when the scores are the same. The game will end when there is no element to take from the list Your program will simulate the rounds and find out the winner, Green or Red or Tie. The input will be two lines. Input Format…
AGU Computer Engineering Department created a new mathematical game that can be played with two people. In this game, you are given a list of random integers. At each round, the first player takes two numbers from the list and calculates the sum of these numbers. Then, the second player takes two numbers and makes the same calculation. The higher one is going to take the round and increment the score by 1. At the end of the game, who has the better score will win the game. Here are the rules for the game: There are always an even number of items on the list There are two colors for the players: Green and Red Green starts the game At each round, green plays and then red plays The player takes the first and the last numbers The game can end Tie when the scores are the same. The game will end when there is no element to take from the list Your program on java will simulate the rounds and find out the winner, Green or Red or Tie. The input will be two lines. Input…
Nim is a two-player game played with several piles of stones. You can use as many piles and as many stones in each pile as you want, but in order to better understand the game, we'll start off with just a few small piles of stones (see figure 1 below). Pile 1 Pile 1 Pile 2 The two players take turns removing stones from the game. On each turn, the player removing stones can only take stones from one pile, but they can remove as many stones from that pile as they want (please note, a player must remove atleast 1 stone from a pile during his/her turn). If they want, they can even remove the entire pile from the game! The winner is the player who removes the final stone (avoid taking the last stone - see figure 2 below). Pile 2 Pile 3 Pile 3 Let's say its Max (player 1) turn to play. Then Max can win by simply removing a stone from Pile 2 or Pile 3 Draw a game tree (upto depth level 2) for the given version of the Nim game. Please consider figure 1 as your initial game configuration/state…
Write a game of rock paper scissors, one of the choices will be from the user and the other from the computer (use random) Print results for each game.Play the games in a row until you exit the game. Explain each step as comment.Game rules:Rock crushes scissors, you win.Paper covers rock, you win.Scissors cut paper, you win
There are a dozen eggs in a basket; some are hard boiled and some are raw. The object of this game is for the user to guess the number of hard-boiled eggs prior to playing the game. The computer then simulates cracking all 12 eggs, using a random number 0 or 1 to simulate raw or hard boiled. The number 0 should represent raw eggs and the number 1 should represent hard boiled. The computer must keep track of the number of hard-boiled eggs. At the conclusion of cracking all 12 eggs, the actual number of hard boiled is compared to the user’s guess, and whether the user won or lost is given as output. PreviousNext
You have a maze with obstacles and non-zero digits in it: 9+ 7 8 + 4 1 2 3 4 5 You can start from any square, walk in the maze, and finally stop at some square. Each step, you may only walk into one of the four neighbouring squares (up, down, left, right) and you cannot walk into obstacles or walk into a square more than once. When you finish, you can get a number by writing down the digits you encounter in the same order as you meet them. For example, you can get numbers 9784, 4832145, etc. The biggest number you can get is 791452384, shown in the picture above. Your task is to find the biggest mumber you can get. Input There will be at most 25 test cases. Each test begins with two integers R and C (2 < R,C < 15, R+C < 30), the number of rows and columns of the maze. The next R rows represent the maze. Each line contains exactly C characters (without leading or trailing spaces), each of them will be either # or one of the nine non-zero digits. There will be at least one non-obstacle…
Correct answer will be upvoted else downvoted. Computer science. After painting the white cells of the board, you want to place the maximum number of dominoes on it, according to the following rules: each domino covers two adjacent cells; each cell is covered by at most one domino; if a domino is placed horizontally (it covers two adjacent cells in one of the rows), it should cover only red cells; if a domino is placed vertically (it covers two adjacent cells in one of the columns), it should cover only blue cells. Let the value of the board be the maximum number of dominoes you can place. Calculate the sum of values of the board over all 2w possible ways to paint it. Since it can be huge, print it modulo 998244353. Input The first line contains two integers n and m (1≤n,m≤3⋅105; nm≤3⋅105) — the number of rows and columns, respectively. Then n lines follow, each line contains a string of m characters. The j-th character in the i-th string is * if the j-th cell in the i-th row…
You are hired by a game design company and one of their most popular games is The Journey. The game has a ton of quests, and for a player to win, the player must finish all the quests. There are a total of N quests in the game. Here is how the game works: the player can arbitrarily pick one of the N quests to start from. Once the player completes a quest, they unlock some other quests. The player can then choose one of the unlocked quests and complete it, and so on. For instance, let’s say that this game had only 4 quests: A, B, C, and D. Let’s say that after you complete • quest A, you unlock quests [B, D]. • quest B, you unlock quests [C, D]. • quest C, you unlock nothing [ ]. • quest D, you unlock quest [C]. Is this game winnable? Yes, because of the following scenario: The player picks quest A to start with. At the end of the quest A, the unlocked list contains [B, D]. Say that player chooses to do quest B, then the…
In this homework assignment, you are going to code a java program which uses random numbers to create a guessing game. This will give you practice with random numbers and loops while allowing you to explore and understand a little more Java code. You will also need to test out this program to ensure the correctness of the algorithm and code. You will need to develop test data that will represent all possible kinds of data that the user may enter. You are going to write a program that allows the user to play a simple guessing game in which your program thinks up an integer between 1 and 100 and allows the user to make guesses until the user gets it right. (The program also counts how many tries it took to get the correct number). For each incorrect guess you will tell the user whether the right answer is higher or lower. Your program is required to exactly reproduce the format and behavior of the log of execution. Program should output: (Sample user output written in bold) This program…
A video player plays a game in which the character competes in a hurdle race. Hurdles are of varying heights, and the characters have a maximum height they can jump. There is a magic potion they can take that will increase their maximum jump height by unit for each dose. How many doses of the potion must the character take to be able to jump all of the hurdles. If the character can already clear all of the hurdles, return . Example The character can jump unit high initially and must take doses of potion to be able to jump all of the hurdles. Function Description Complete the hurdleRace function in the editor below. hurdleRace has the following parameter(s): int k: the height the character can jump naturally int height[n]: the heights of each hurdle Returns int: the minimum number of doses required, always or more Input Format The first line contains two space-separated integers and , the number of hurdles and the maximum height the character can jump naturally.The…
It is given 12 balls that are all the same weight except for one that is heavier or lighter. Additionally, it is provided with a two-pan balance. In each scenario, the balance is used. You may place any number of the 12 balls on the left pan and the same number on the right pan and press a button to begin weighing; three alternative results exist: the weights are equal, the balls on the left are heavier, or the balls on the left are lighter. Develop a technique for determining which ball is the odd one out and whether it is heavier or lighter than the others using the fewest feasible uses of the balance. Solve the weighing issue for the situation of 39 balls, one of which is known to be strange.
Build a simple guessing game where it will continuously ask the user to enter a number between 1 and 10. If the user's guesses matched, the user will score 10 points, and display the score. If the users' guess doesn’t match display the generated number. Also, if the user enters “q” then stop the game. my code till now. Please modify my code so that it works. import randomgame(num)if n=='q': def game(n): n= int(input("Enter a number between 1 and 10 ")) print("You entered:",n)r = random.randint(1,10)print("Random number is: ", r)score=0if n==r:print("You won!")print(" Your score: " ,score+10)else:print("You lost! Try again")