During Eid, it is a tradition for every father to give his children money to spend on entertainment. Chef has N coins; denote the value of the coin i by vi. Since today is Eid, Chef gives one coin to each of his two children. He wants the absolute value of the difference between the values of the coins given to the two children to be as small as possible to be as fair as possible. Help the chef by telling him the minimum possible difference between the values of the coins given to the two children. Of course, the chef cannot give the same coin to both children. Note: Please answer in C++ Programming language.

During Eid, it is a tradition for every father to give his children money to spend on entertainment. Chef has N coins; denote the value of the coin i by vi. Since today is Eid, Chef gives one coin to each of his two children. He wants the absolute value of the difference between the values of the coins given to the two children to be as small as possible to be as fair as possible. Help the chef by telling him the minimum possible difference between the values of the coins given to the two children. Of course, the chef cannot give the same coin to both children. Note: Please answer in C++ Programming language.

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

In practical life, the employees get salaries and pay taxes honestly. Sometimes, the process of drawing salariesand payment of taxes may lead to some interesting situation. Suppose, a person draws salary of Rs. 10,000 permonth. A certain percentage of tax is charged on that amount, which is deducted every month. But if the salaryof the person is more than Rs. 10,000 per month, then the tax rate is different. Similarly if a person is getting Rs.20,000 per month, he/she would be charged more under a different tax rate slab. The interesting situationdevelops if there is an anomaly in the tax rates i.e. a person who is getting higher salary takes home lesser moneyas compared to the other person with less gross salary.To further elaborate it, we suppose that there is company 'C' where 100 or less than 100persons are employed. The salaries of the employees and their tax rates are known to us.We are required to list those unlucky persons, who are getting lesser take-home salary(net salary)…
Required: Amitabh had a magical cat. That cat once fell down an empty well. As the walls of the well were not completely vertical, the cat could climb up the well. In one day, the cat can climb 1 unit height and the height of the well is h units. The cat starts at the bottom. Every day, a cat would divide into 2 cats. One of them would climb up 1 unit. The other would wait for help. But while waiting it would fall asleep and roll down 1 unit, unless it is already at the bottom, in which case it just remains there. When a cat would reach the top, it would run home toAmitabh. (Schrodinger doesn't know that some of the cats are in a well and so he can't rescue them). It has been d days since the cat fell into the well. How many cats would come out of the well today? You would notice that the number of cats grows very large with each passing day, so output the answer modulo 10^9+7. d = 0 means that the cat has fallen just now and so there's just one cat at the bottom of the well. So you…
PYTHON CODE: In order to beat AlphaZero, Grandmaster Hikaru is improving her chess calculation skills.Today, Hikaru took a big chessboard with N rows (numbered 1 through N) and N columns (numbered 1 through N). Let's denote the square in row r and column c of the chessboard by (r,c). Hikaru wants to place some rooks on the chessboard in such a way that the following conditions are satisfied:• Each square of the board contains at most one rook.• There are no four rooks forming a rectangle. Formally, there should not be any four valid integers r1, c1, r2, c2 (≠r2,c1≠c2) such that there are rooks on squares (r1,c1), (r1,c2 (r2,c1)and (r2,c2).• The number of rooks is at least 8N.Help Hikaru find a possible distribution of rooks. If there are multiple solutions, you may find any one. It is guaranteed that under the given constraints, a solution always exists.InputThe first line of the input contains a single integer T denoting the number of test cases. The first and only line of each test…
Five members of an obesity club want to know how much they have lost or gained weight since the last time they met. To do this, they carry out a weighing ritual where each one is weighed on ten different scales in order to have a more accurate average of their weight. If there is a positive difference between this average weight and the weight of the last time they met, it means that they gained weight. But if the difference is negative, it means that they lost weight. What the problem requires is that for each person a sign is printed that says "went up" or "under" and the amount of pounds Write a program in c++ using for, do while or while. Initial weights 230, 240, 180, 300 and 350. Do not use arrays
Five members of an obesity club want to know how much they have lost or gained weight since the last time they met. To do this, they carry out a weighing ritual where each one is weighed on ten different scales in order to have a more accurate average of their weight. If there is a positive difference between this average weight and the weight of the last time they met, it means that they gained weight. But if the difference is negative, it means that they lost weight. What the problem requires is that for each person a sign is printed that says "went up" or "under" and the amount of pounds. Write a program in C++ that uses a function. The user must enter the initial weight and the 10 weights of the scales. Please do not use arrays or vector
Five members of an obesity club want to know how much they have lost or gained weight since the last time they met. To do this, they carry out a weighing ritual where each one is weighed on ten different scales in order to have a more accurate average of their weight. If there is a positive difference between this average weight and the weight of the last time they met, it means that they gained weight. But if the difference is negative, it means that they lost weight. What the problem requires is that for each person a sign is printed that says "went up" or "under" and the amount of pounds Write a program in c++ using for, do while or while. Initial weights 230, 240, 180, 300 and 350
Five members of an obesity club want to know how much they have lost or gained weight since the last time they met. To do this, they carry out a weighing ritual where each one is weighed on ten different scales in order to have a more accurate average of their weight. If there is a positive difference between this average weight and the weight of the last time they met, it means that they gained weight. But if the difference is negative, it means that they lost weight. What the problem requires is that for each person a sign is printed that says "went up" or "under" and the amount of pounds Write a program in c++ using a function. Initial weights 230, 240, 180, 300 and 350. Do not use arrays
Use following series to do the given task; 135 79 11 13 15 1719 21 23 25 27 29 31 ... Given the number N of odd numbers in a certain line, your task is to determine the sum of the last three numbers of that line. For example N = 5 means, the third line, the last three numbers are 13, 15 and 17. The summation of these three numbers is 45. InputThe first line tells the number of test cases. From the next line, the input is a sequence of lines, one odd number N (1 < N <1000000000) per line. OutputFor each input line write the sum of the last three odd numbers written in that line of series with N numbers.
Transcribed Image Text Alex is playing Poker card game. He starts with a deck of N cards, where for each valid (i), the ith card has an integer A¡ written on it. Now the dealer starts dealing the cards one by one in the order from card 1 to card N. Alex wins if at some moment in time, the sum of all the cards dealt so far is between X and Y inclusive; if this never happens, Alex loses. You are now helping Alex to win the game, so without him noticing, you will swap some pairs of cards before the game starts. Develop a python script to find the smallest number of swaps we need so that Alex would win the game, or find that it is impossible to make Alex win. Display a single line containing one integer i.e., the smallest required number of swaps or -1 if Alex cannot win.
The game Capture is played by two players, First and Second, who take turns to move towards one another on a narrow bridge. Initially, the two players are at opposite ends of the bridge, at a distance of n feet from each other. (Here n is an arbitrary positive integer.) When it is their turn, they are allowed to jump 1, 2, or 3 feet toward each other. The game starts by First making a move first; the game is over when one player is able to capture (jump on top of) the other player. Generalize the problem further to the case when the initial distance is n feetand the players are allowed to jump any (positive) integer number of feet up to k feet. (Here n and k are arbitrary natural numbers.)
Computer Science There is an n × n grid of squares. Each square is either special, or has a positive integer costassigned to it. No square on the border of the grid is special.A set of squares S is said to be good if it does not contain any special squares and, starting fromany special square, you cannot reach a square on the border of the grid by performing up, down,left and right moves without entering a cell belonging to S. 5 3 4 9 4 X 3 6 1 9 X 4 1 2 3 5 - Design an algorithm which receives an arbitrary n × n grid, runs in time poly-nomial in n and determines a good set of squares with minimum total cost.
Blackout Math is a math puzzle in which you are given an incorrect arithmetic equation. The goal of the puzzle is to remove two of the digits and/or operators in the equation so that the resulting equation is correct. For example, given the equation 6 - 5 = 15 ^ 4/2 we can remove the digit 5 and the / operator from the right-hand side in order to obtain the correct equality 6 - 5 = 1 ^ 42. Both sides of the equation now equal to 1. Observe how removing an operator between two numbers (4 and 2) causes the digits of the numbers to be concatenated (42). Here is a more complicated example: 288 / 24 x 6 = 18 x 13 x 8 We can remove digits and operators from either side of the equals sign (either both from one side, or one on each side). In this case, we can remove the 2 from the number 24 on the left-hand side and the 1 from the number 13 on the right-hand side to obtain the correct equality 288 / 4 x 6 = 18 x 3 x 8 Both sides of the equation now equal to 432. Here is another puzzle for you…