h GA groklearning.comn8 Romance Novels | Page 9| NovelBuddyA How to Use a Microscope - Wisc-Online.D Looking At College Apartments | It's Gett..G Grok | CalculatorgrekCode Gym 1aacademyCalculatorDivide by 2InstructionsO Problemprogram.py >Type your answer to "Divide by 2" here.Write a program that asks the user for a number, and divides it by 2then prints out the result:Enter a number: 115.5A Submissions<> OutputYou don't have any submissions or saved code.

As per the requirement here I am providing the code. Here is the algorithm. Step 1: Start Step 2:…

Answered: Write a program that asks the user for…

Engineering

Computer Science

Write a program that asks the user for a number, and divides it by 2 then prints out the result: Enter a number: 11 5.5

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 27PE

See similar textbooks

Similar questions

A groklearning.com n8 Romance Novels | Page 9| NovelBuddy A How to Use a Microscope - Wisc-Online. O Looking At College Apartments | It's Gett.. G Grok | Calculator grek Code Gym 1a academy Calculator 100 divided by Instructions O Problem program.py > Type your answer to "100 divided by" here. Write a program that asks the user for a number and prints out 100 divided by the number: Enter a number: 5 20.0 The answer is 20.0 because 100/5 = 20. A Submissions Output You don't have any submissions or saved code.
please code in python You place a pawn at the top left corner of an n-by-n chess board, labeled (0,0). For each move, you have a choice: move the pawn down a single space, or move the pawn down one space and right one space. That is, if the pawn is at position (i,j), you can move the pawn to (i+1,j) or (i+1, j+1). Ask the user for the size of a chessboard, n (integer). Find the number of different paths starting from (0,0) that the pawn could take to reach each position on the chess board. For example, there are two different paths the pawn can take to reach (2,1). Look at the diagrams below to convince yourself of this. You can see the four paths that you can take by move 2. Start -> Move 1 -> Move 2 (0,0) -> (1,0) -> (2,1) (0,0) -> (1,0) -> (2,0) (0,0) -> (1,1) -> (2,1) (0,0) -> (1,1) -> (2,2) Print the board with the number of ways to reach each square labeled as shown below. For example: Enter a board size: 4 1 0 0 0 1 1 0 0 1 2 1 0 1 3 3 1
Extreme Fizz BuzzFizz Buzz is a classic Computer Science problem about Selection. For an integer x, print:• “Fizz” if x is only divisible by 3,• “Buzz” if x is only divisible by 5,• “FizzBuzz” if x is divisible by both 3 and 5,• the number x if it is not divisible by both 3 and 5.This problem is the extreme version of Fizz Buzz. You are given a list of K distinct integers A and a list of K characters S. Both lists are numbered from 1 to K. The integer Ai corresponds to the character Si. Denote B as the subset of A. There will be a rule for each possible subset: if an integerx is only divisible by all elements in B, print a string which is the concatenation of the corresponding character of each element in B, sorted by the index in ascending order. However, if B is an empty subset, print the first digit of x instead. Does it look complicated? Do not worry, as it is just a generalization of the regular Fizz Buzz. For example, if A = [3, 5] and S = [F, B], you will get the normal Fizz…
python Geography Grades 2Make a copy of your program for the problem Geography Grades 1 and change the code in such a way that your program nolonger prints the average grade, but the final grade.The final grade is calculated by rounding the average grade to the nearest multiple of a half. So, for example, a 7.2becomes a 7.0 and 7.3 becomes a 7.5. If this calculation results in a 5.5, the final grade becomes a 6.0.Your assignment is to make the report for the geography course of group 2b, that, with the same example input as forthe problem Geography Grades 1, should look like this:Report for group 2bAnne Adema has a final grade of 6.0Bea de Bruin has a final grade of 7.0Chris Cohen has a final grade of 7.5Dirk Dirksen has a final grade of 4.5End of report"""
Python Assignment: In India McDonald's has the n number of customers and they are famous for their taste and quality so they plan to Organise the challenge for foody people. What is the challenge is?| you have taken a food challenge from the Chef and now you have to eat directly the Y burgers. You will eat as follows: At the first minute you will eat exactly the X burgers and every minute after that you will eat twice the number of burgers you ate the minute before. As you can get tired of food, Chef also lets you take a break from eating for one minute. When you start eating again after a break, your food streaks are reset, which means that in the first minute after the break you will eat X burgers and every minute after that you will eat the burgers you ate twice the last minute. Allow a1, a2, ., let it be your meal length in minutes. The cook needs to have all the ai different in pairs. Get the minimum number of minutes you need to eat Y burgers directly or decide that it is not…
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…
Scylla or Charybdis? def scylla_or_charybdis(moves, n): This problem was inspired by the article "A Magical Answer to the 80-Year-Old Puzzle" in Quanta Magazine. Thanks to your recent cunning stunts, your nemesis in life is trapped inside a devious game where, for a refreshing change from the usual way of things, you get to be the Final Boss. (Everyone is the hero in their own story until they become a villain in somebody else's, after all.) This final level is a one-dimensional video game platform that reaches n-1 steps from its center to both directions. At each end of this platform exactly n steps away from the center, your two lethal friends Scylla and Charybdis are licking their lips in anticipation of a tasty morsel. Your nemesis starts at the center of this platform. To start this deadly combat of wits, she must immediately commit to her entire sequence of future moves, given to this function as a string of characters '+' (“� just a step to the ri-i-i-i-ight � ”) and '-' (move…
Two bugs are positioned a given distance apart. The first bug moves halfway towards the other. The second bug moves halfway to the first. The first bug again moves halfway to the second. Compute and print the positions of the bugs. The initial position will change with each program run. // Declare position 2... /* Your code goes here */ double distance = initial_distance; 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27} // Update distance and position1 distance distance * 0.5; position1= distance; cout << position1 << " " << position2 << endl; // Update distance and position2 /* Your code goes here */ cout << position1 << " " << position2 << endl; // Update distance and position1 /* Your code goes here */ cout << position1 << return 0; "1 << position2 << endl;
1. task: Introduction and basics. Peter Zmeda is really lucky. He often finds parts of code and he then asks himself if he could use them anywhere. This time he has found the following code: int FooBar (A) { n= len (A); B= newArray (n) for j:= 0 to n-1 { } B[j] = 0 for i:= j to 0 step -1 { if A[i]
Transcribed Image Text Python Development Lab In Merworld there exists 2 coins of different denominations types 5-peso coins and 10- peso coins, both having two faces with image of – Elon Musk and a dog. You are assigned a task to find out the number of ways to arrange these coins so that their sum is N pesos. Arrangement should be done in such a way that the first coin in the arrangement should always have Elon Musk image up. Other coins could have any image. Input Output 1 60 5 LO
java code please unique solution plzzz Purpose: In this homework you will practice loops. This homework will also continue your practice of previously learned concepts, such as branching and obtaining user input via keyboard. Problem 1. In crypt-arithmetic puzzles, mathematical equations are written using letters. Each letter can be a digit from 0 to 9, but no two letters can be the same. Here is a sample problem: SEND + MORE = MONEY A solution to the puzzle is S = 9, R = 8, O = 0, M = 1, Y = 2, E = 5, N = 6, D = 7.In a class called H4P1, write a program that finds and prints all solutions to the crypt-arithmetic puzzle of the following: TOO + TOO + TOO + TOO = GOOD //Need to make sure answer has reasonable comment Uses For-loops Has Break Condition
Knight's Tour: The Knight's Tour is a mathematical problem involving a knight on a chessboard. The knight is placed on the empty board and, moving according to the rules of chess, must visit each square exactly once. There are several billion solutions to the problem, of which about 122,000,000 have the knight finishing on the same square on which it begins. When this occurs the tour is said to be closed. Your assignment is to write a program that gives a solution to the Knight's Tour problem recursively. You must hand in a solution in C++ AND Java. The name of the C++ file should be "main.cc" and the name of the Java file should be "Main.java". Write C++ only with a file name of main.cc Please run in IDE and check to ensure that there are no errors occuring Output should look similar to: 1 34 3 18 49 32 13 16 4 19 56 33 14 17 50 31 57 2 35 48 55 52 15 12 20 5 60 53 36 47 30 51 41 58 37 46 61 54 11 26 6 21 42 59 38 27 64 29 43 40 23 8 45 62 25 10 22 7 44 39 24 9 28 63