Most of the children in the kindergarten have been picked up by their parents, and there are only a few children left. The teacher has some candy in his hand, and now he wants to give the children a point, but he does not want the children to eat too much sugar. The teacher came up with the idea of adding 1 to the remainder of each child's age divided by 2. Enter: Number of children n(1<=n<=10) and age of n children Output: Total number of candies Sample input: 3 656 Example output: 4 | Try to write a program (C)

Most of the children in the kindergarten have been picked up by their parents, and there are only a few children left. The teacher has some candy in his hand, and now he wants to give the children a point, but he does not want the children to eat too much sugar. The teacher came up with the idea of adding 1 to the remainder of each child's age divided by 2. Enter: Number of children n(1<=n<=10) and age of n children Output: Total number of candies Sample input: 3 656 Example output: 4 | Try to write a program (C)

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

See similar textbooks

Similar questions

(This is a version of Programming Project 2.1 from Chapter 2.) The Babylonianalgorithm to compute the square root of a positive number n is as follows:1. Make a guess at the answer (you can pick n/2 as your initial guess).2. Compute r = n / guess.3. Set guess = (guess +r) / 2.4. Go back to step 2 until the last two guess values are within 1% of each other. Write a program that inputs a double for n, iterates through the Babylonian algo-rithm until the guess is within 1% of the previous guess and outputs the answer as a double to two decimal places. Your answer should be accurate even for largevalues of n.
The interest paid on a savings account is compounded daily. This means that if you start with startbal dollars in the bank, at the end of the first day you’ll have a balance ofstartbal * (1 + rate/365)dollars, where rate is the annual interest rate (0.10 if the annual rate is 10 percent). At the end of the second day, you’ll havestartbal * (1 + rate/365) * (1 + rate/365)dollars, and at the end of n days you’ll havestartbal * (1 + rate/365)ndollars. Write a program that processes a set of data records, each of which contains values for rate, startbal, and n and computes the final account balance.
Language: C Pascal’s triangle is a triangular array, useful for calculating the binomial coefficients, n k , that are used in expanding binomials raised to powers, combinatorics and probability theory. 0 0 1 0 1 1 2 0 2 1 2 2 3 0 3 1 3 2 3 3 4 0 4 1 4 2 4 3 4 4 Evaluating the values of the binomial coefficients, you get the following pattern, 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 The number of the entries in each row is increased by one, as we move down. Each number in the triangle, is constructed by adding the number above it and to the left, with the number above it and to the right. The blank entries as treated as 0. Using the recursion, implement the function that computes the Pascal’s triangle. Pr
Find an error in the following code and fix it. int x = 23;int* p = x; Group of answer choices int* x = 23;int* p = x; int x = 23;int& p = *x; int x = 23;int* p = *x; int x = 23;int* p = &x;
This is my code for a random guess game and whoever has the shortest distance to number 21 wins the game. I need help with looping this game so that it would show these things:Numbers of hands played:Dealer Wins: Player Wins:and if the player randon guess is 21 the code would then exit and say thanks for playing. import random win = 21 dealer = 50 print('Player pick a number between 1-100') guess = random.randint(0,100) print('Player Guess:') print(guess) dealerdist = abs(dealer-win) playerdist = abs(guess-win) if (playerdist > dealerdist): print('Dealer Wins!') if (playerdist < dealerdist): print('Player Wins!')
mplement a Java program that applies the Newton-Raphson's method xn+1 = xn – f(xn) / f '(xn) to search the roots for this polynomial function ax6 – bx5 + cx4 – dx3+ ex2 – fx + g = 0. Fill out a, b, c, d, e, f, and g using the first 7 digits of your ID, respectively. For example, if ID is 4759284, the polynomial function would be 4x6 – 7x5 + 5x4 – 9x3+ 2x2 – 8x + 4 = 0. The program terminates when the difference between the new solution and the previous one is smaller than 0.00001 within 2000 iterations. Otherwise, it shows Not Found as the final solution.
int const MULTIPLIER = 5; is a valid way to declare a constant integer variable. Group of answer choices True False ------- Given the following code segment, what is output to the screen? int num1 = 6; int num2 = 4 * num1++; cout << "num1=" << num1 << " num2=" << num2; Group of answer choices num1=7 num2=24 num1=6 num2=24 num1=6 num2=28 Nothing, because the code does not compile.
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. anglers have recently gotten back from a fishing excursion. The I-th angler has gotten a fish of weight man-made intelligence. Anglers will flaunt the fish they got to one another. To do as such, they initially pick a request where they show their fish (every angler shows his fish precisely once, in this way, officially, the request for showing fish is a stage of integers from 1 to n). Then, at that point, they show the fish they discovered by the picked request. At the point when an angler shows his fish, he may either become glad, become dismal, or stay content. Assume an angler shows a fish of weight x, and the most extreme load of a formerly shown fish is y (y=0 if that angler is quick to show his fish). Then, at that point: in the event that x≥2y, the angler becomes cheerful; in the event that 2x≤y, the angler becomes miserable; in the event that none of these two…
IN JAVA Alice and Bob are playing a board game with a deck of nine cards. For each digit between 1 to 9, there is one card with that digit on it. Alice and Bob each draw two cards after shuffling the cards, and see the digits on their own cards without revealing the digits to each other. Then Alice gives her two cards to Bob. Bob sees the digits on Alice’s cards and lays all the four cards on the table in increasing order by the digits. Cards are laid facing down. Bob tells Alice the positions of her two cards. The goal of Alice is to guess the digits on Bob’s two cards. Can Alice uniquely determine these two digits and guess them correctly? Input The input has two integers p,q (1≤p<q≤9) on the first line, giving the digits on Alice’s cards. The next line has a string containing two ‘A’s and two ‘B’s, giving the positions of Alice’s and Bob’s cards on the table. It is guaranteed that Bob correctly sorts the cards and gives the correct positions of Alice’s cards. Output If Alice can…
Count consecutive summers def count_consecutive_summers(n): Like a majestic wild horse waiting for someone to come and tame it, positive integers can be broken down as sums of consecutive positive integers in various ways. For example, the integer 42 often used as placeholder in this kind of discussions can be broken down into such a sum in four different ways: (a) 3 + 4 + 5 + 6 + 7 + 8 + 9, (b) 9 + 10 + 11 + 12, (c) 13 + 14 + 15 and (d) 42. As the last solution (d) shows, any positive integer can always be trivially expressed as a singleton sum that consists of that integer alone. Given a positive integer n, determine how many different ways it can be expressed as a sum of consecutive positive integers, and return that count. The count of how many different ways a positive integer n can be represented as a sum of consecutive integers is also called its politeness, and can be alternatively computed by counting how many odd divisors that number has. However, note that the linked…
In python, Problem Description:Sheldon and Leonard are physicists who are fixated on the BIG BANG theory. In order to exchange secret insights they have devised a code that encodes UPPERCASE words by shifting their letters forward. Shifting a letter by S positions means to go forward S letters in the alphabet. For example, shifting B by S = 3 positions gives E. However, sometimes this makes us go past Z, the last letter of the alphabet. Whenever this happens we wrap around, treating A as the letter that follows Z. For example, shifting Z by S = 2 positions gives B. Sheldon and Leonard’s code depends on a parameter K and also varies depending on the position of each letter in the word. For the letter at position P, they use the shift value of S = 3P + K. For example, here is how ZOOM is encoded when K = 3. The first letter Z has a shift valueof S = 3 × 1 + 3 = 6; it wraps around and becomes the letter F. The second letter, O, hasS = 3 × 2 + 3 = 9 and becomes X. The last two letters…
A group of people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After x number of passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. For example: number of passes = 1 and number of players = 5, the order of elimination is 2, 4, 1, 5. Write a program for general values of X and N. Ask a user for the number of people and number of passes To speed up the input and debugging, you may wish to store the names of the people in a file. Make sure no two names start the same letter ( Alex and Ana are not OK). Alternatively, you can number the players. Output number and/or the name of a person being eliminated Output number and the name of the winner Do not expect a user to do the right thing, error check the user input; among other things, what do you think a reasonable…