Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
• Task You have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero the height. The removals must be performed in such a way as to maximize the height. more cylinders from the top of zero or more of the three stacks until they're all the same height, then print Note: An empty stack is still a stack. Input Format The first line contains three space-separated integers, n1, n2, and ng, describing the respective number of cylinders in stacks 1. 2. and 3. The subsequent lines describe the respective heights of each cylinder in a stack from top to bottom: • The second line contains space-separated integers describing the cylinder heights in stack. The first element is the top of the stack. The third line contains space-separated integers describing the cylinder heights in stack. The first element is the top of the stack. The fourth line contains space-separated integers describing the cylinder heights in stack. The first element is the top of the stack. Constrains •0

• Task You have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero the height. The removals must be performed in such a way as to maximize the height. more cylinders from the top of zero or more of the three stacks until they're all the same height, then print Note: An empty stack is still a stack. Input Format The first line contains three space-separated integers, n1, n2, and ng, describing the respective number of cylinders in stacks 1. 2. and 3. The subsequent lines describe the respective heights of each cylinder in a stack from top to bottom: • The second line contains space-separated integers describing the cylinder heights in stack. The first element is the top of the stack. The third line contains space-separated integers describing the cylinder heights in stack. The first element is the top of the stack. The fourth line contains space-separated integers describing the cylinder heights in stack. The first element is the top of the stack. Constrains •0

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
100%

PYTHON: Stacks and Queues

• Task You have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of the three stacks until they're all the same height, then print the height. The removals must be performed in such a way as to maximize the height. Note: An empty stack is still a stack. Input Format The first line contains three space-separated integers, n1, n2, and n3, describing the respective number of cylinders in stacks 1, 2, and 3. The subsequent lines describe the respective heights of each cylinder in a stack from top to bottom: • The second line contains space-separated integers describing the cylinder heights in stack. The first element is the top of the stack. • The third line contains space-separated integers describing the cylinder heights in stack. • The first element is the top of the stack. The fourth line contains space-separated integers describing the cylinder heights in stack. The first element is the top of the stack. Constrains • 0 < n1, n2, ng < 105 • 0< height of any cylinder < 100 Output Format Print a single integer denoting the maximum height at which all stacks will be of equal height. Sample Input 5 3 4 321 11 4 3 2 114 1 Sample Output
Transcribed Image Text:• Task You have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of the three stacks until they're all the same height, then print the height. The removals must be performed in such a way as to maximize the height. Note: An empty stack is still a stack. Input Format The first line contains three space-separated integers, n1, n2, and n3, describing the respective number of cylinders in stacks 1, 2, and 3. The subsequent lines describe the respective heights of each cylinder in a stack from top to bottom: • The second line contains space-separated integers describing the cylinder heights in stack. The first element is the top of the stack. • The third line contains space-separated integers describing the cylinder heights in stack. • The first element is the top of the stack. The fourth line contains space-separated integers describing the cylinder heights in stack. The first element is the top of the stack. Constrains • 0 < n1, n2, ng < 105 • 0< height of any cylinder < 100 Output Format Print a single integer denoting the maximum height at which all stacks will be of equal height. Sample Input 5 3 4 321 11 4 3 2 114 1 Sample Output
Explanation Initially, the stacks look like this: 1 Observe that the three stacks are not all the same height. To make all stacks of equal height, we remove the first cylinder from stacks 1 and 2, and then remove the top two cylinders from stack 3 (shown below). As a result, the stacks undergo the following change in height: 1. 8 - 3 = 5 2. 9 - 4 = 5 3.7 -1-1= 5 All three stacks now have height = 5. Thus, we print 5 as our answer.
Transcribed Image Text:Explanation Initially, the stacks look like this: 1 Observe that the three stacks are not all the same height. To make all stacks of equal height, we remove the first cylinder from stacks 1 and 2, and then remove the top two cylinders from stack 3 (shown below). As a result, the stacks undergo the following change in height: 1. 8 - 3 = 5 2. 9 - 4 = 5 3.7 -1-1= 5 All three stacks now have height = 5. Thus, we print 5 as our answer.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Stack
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS