B - WatermelonOne hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest andthe ripest one, in their opinion. After that the watermelon was weighed, and the scales showed w kilos.They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.Pete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such away that each of the two parts weighs even number of kilos, at the same time it is not obligatory thatthe parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that'swhy you should help them and find out, if they can divide the watermelon in the way they want. Forsure, each of them should get a part of positive weight.InputThe first (and the only) input line contains integer number w (1s ws 100) – the weight of thewatermelon bought by the boys. OutputPrint YES, if the boys can divide the watermelon into two parts, each of them weighing even number ofkilos; and NO in the opposite case.ExamplesInput8OutputYESNoteFor example, the boys can divide the watermelon into two parts of 2 and 6 kilos respectively (anothervariant – two parts of 4 and 4 kilos).

- We need to solve the given watermelon split problem. - We are using C++ here.

Answered: One hot summer day Pete and his friend…

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

A chemistry teacher asked her class to answer the following question: If I put 10 bacteria on the classroom doorknob tonight, how many bacteria will be on the doorknob by the time we come to school tomorrow? In order to answer this question, you need to know a few things: Each bacterium (a single bacteria) can create 2 more bacteria every hour This means that after one hour, the doorknob will have 10 + 10 * 2 = 30 bacteria, since we started with 10 bacteria and each of those created 2 more. This means that after two hours, the doorknob will have 30 + 30 * 2 = 90, since there were 30 bacteria at the beginning of hour two, and during that hour each bacteria created 2 more bacteria. Continuing this pattern, the number of bacteria on the doorknob after N hours is numberOfBacteriaLastHour + numberOfBacteriaLastHour * 2 However, if we wanted to know how many bacteria are alive after 12 hours, we need to know how many bacteria were alive at hour 11. To find out how many bacteria are alive at…
The Ibra College of Technology has an automated system that calculates the overall grade for each student of a class. The system gets to know the number of students in a class from the teacher. For each student, it asks their name and the number of subjects they took. For each subject, they ask the score. They then take the average of the scores of all the subjects, divide it by 10 and display the name and GPA for each student. Read the number of students in a class, the name and the number of subjects for each student. Then read the scores of each subject for each student, calculate the GPA by averaging the scores and dividing the average by 10. Finally, display the name and GPA for each student.
Fibonacci numbers have a lot of numerical properties. A few can be mentioned is that the squares of the Fibonacci numbers added together by the consecutive number you get the next Fibonacci number, and when you add the squares together it also results to the Fibonacci sequence. Another is when adding the squares of the Fibonacci numbers for example one plus one plus four is six. Add nine to that, we get 15. Add 25, we get 40. Add 64, we get 104. Fibonacci shows here. Six is two times three, 15 is three times five and so on. Last to be mentioned is when you divide 13 by eight, you get 1.625 and if you dividde this larger number by the smaller number, the ratios get closer and closer to about 1.618. Now the question is, what other numerical properties can you identify in the Fibonacci sequence ASIDE from those mentioned above and verify your assumptions.
Question-1 Friend's Party Circle: There are a few friends living in the same area. They have a party every weekend and the place of party change each week. It is always a lifficult task to select a place which is nearest for everyone. They advantage of Computer Science to solve this problem. all decided to take Names of friends are Ahmed, Rehman, Careem, Basit, Dawood, Ghani, and Farid. Ahmed lives at 5 minutes' walk from rehman and at 10 minutes' walk from Careem. Careem lives at 3 minutes' walk from Dawood. Rehman lives at 4 minutes' walk from Basit and 2 minutes' walk from Dawood. Dawood lives at two minutes' walk from Farid. Ghani lives at 2 minutes' walk from Basit. a. If we represent a graph G = V (V, E) in which set of vertices are home of each Friend and an edge represents a path between two homes. Provide the adjacency matrix of directed graph of the graph G. b. In above directed graph G. You are required to devise an algorithm to find all possible paths.
Moon effect. Some people believe that the Moon controls their activities. If the Moon moves from being directly on the opposite side of Earth from you to being directly overhead, by what percentage does (a) the Moon's gravitational pull on you increase and (b) your weight (as measured on a scale) decrease? Assume that the Earth-Moon (center-to-center) distance is 3.82 x 10° m, Earth's radius is 6.37 x 106 m, Moon's mass is 7.36 x 1022 kg, and Earth's mass is 5.98 x 1024 kg. (a) Number 6.89 Units percent (b) Number i 6.8713e-4 Units percent
Rahul is a maths genius so he came up with a game and as raj is Rahul's best friend so Rahul decided to play the game with raj. Rahul gives raj two numbers LL and RR and asks raj to find the count of numbers in the range from LL to RR (LL and RR inclusive) which are a digit palindromic. A number is a digit palindromic if its first digit is the same as its last digit. As raj is not very good at maths so your task is to help Raj find out how many numbers are a digit palindromic in the range LL to RR. For example if LL = 88 and RR = 2525 .The following numbers are a digit palindromic in the range of LL to RR: 8, 9, 11, and 22. If LL = 12511251 and RR = 12661266. The digit palindromic numbers are 1251 and 1261. Input format The first line contains an integer denoting the number of test cases. Each test case is described by a single line that contains two integers LL and RR. Output format For each test case output, an integer denoting how many a digit palindromic numbers are there in the…
So not everything is about getting 20+ decimal places of precision. Integers are great, sometimes they are enough, sometimes they are *ALMOST* enough (and, well, sometimes they aren't enough). For example, in music I can have notes that take one beat, notes that take up multiple beats...or notes that take a beat and a half, or others that take a half a beat. I don't ever need to worry about a note that takes 3.071253 beats. If I could represent fractions down to maybe 1/16 of a beat, that would be plenty. That was kind of a side track. What I'd like is numbers that fit in a 16 bit int. I want to be able to represent numbers that can represent about 3 places past the decimal point (about 10 bits past the binary point), and I need to have at least +/- 2PI of range. Let's go for 5 bits on the left of the binary point and 11 bits to the right...so we can represent numbers from 15something to -16 range with a resolution of 1/2048. For this numbering scheme, find the four digit…
A school has been selling raffle tickets to raise funds for the school library. Each ticket is sold for $5,and the school has sold many such tickets. Each ticket has a code. When a ticket is presented at thelibrary book sale, it can be redeemed for $1, $5, or $10. The dollar amount being assigned to each ticketis determined by a lottery before the book sale. Heidi is wondering whether the school is actually losing money out of the raffle.(a) Formulate the null and alternative hypotheses that can be used to determine whether the school islosing money out of the raffle. Note that the issue is whether the school is losing money, not whetherthe school is breaking even. Please think about what the implication is when formulating the null andalternative hypotheses
our friend Maria has come to you and said that she has been playing the higher/lower game with her three-year-old daughter Bella. Maria tells Bella that she is thinking of a number between 1 and 10, and then Bella tries to guess the number. When Bella guesses a number, Maria tells her whether the number she is thinking of is higher or lower or if Bella guessed it. The game continues until Bella guesses the right number. As much as Maria likes playing the game with Bella, Bella is very excited to play the game all the time. Maria thought it would be great if you could create a program that allows Bella to play the game as much as she want
Friend’s Party Circle: There are a few friends living in the same area. They have a party every weekend and the place of party change each week. It is always a difficult task to select a place which is nearest for everyone. They all decided to take advantage of Computer Science to solve this problem. Names of friends are Ahmed, Rehman, Careem, Basit, Dawood, Ghani, and Farid. Ahmed lives at 5 minutes’ walk from rehman and at 10 minutes’ walk from Careem. Careem lives at 3 minutes’ walk from Dawood. Rehman lives at 4 minutes’ walk from Basit and 2 minutes’ walk from Dawood. Dawood lives at two minutes’ walk from Farid. Ghani lives at 2 minutes’ walk from Basit. If we represent a graph G = V (V, E) in which set of vertices are home of each Friend and an edge represents a path between two homes. Provide the adjacency matrix of directed graph of the graph G. In above directed graph G. You are required to devise an algorithm to find all possible paths.
Little Frank loves mathematics. Every day, he solves some mathematical problems to improve his skill. A few days ago, he found a popular problem about turtles. The problem is as follows. Little Frank is given R rectangles, numbered 1 through R. The width and height of the i-th rectangle are Ni and M¡ unit respectively. There is a turtle located on the top-left corner of each rectangle. For each rectangle, count the number of ways the turtle can reach the bottom-right corner, if each turtle can only move right or down 1 unit at any time. The turtle is not allowed to move outside the rectangle, but, of course, the turtle can move on the boundary of the rectangle. In less than one second, this problem was solved for all rectangles. He felt that the problem was too easy. This morning, Little Frank wanted more challenges. Thus, for each rectangle į, he cut and removed a rectangle of A¡ x Bị unit from the top-right corner. See the following figure for detail. Bị Mi He could not solve this…
You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. Miles between Adjacent Towns Town A B C DE Destination Origin A 40 60 50 10 70 B 20 55 40 50 10 D 60 E 80 (a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. (b) Use the Dijkstra's algorithm to solve this shortest path problem.

SEE MORE QUESTIONS

Recommended textbooks for you

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

SEE MORE TEXTBOOKS