You have N boxes in Samosas, where each box is a cube. To pack the box, you need to use a rubber band (pseudo-circular, elastic band) by placing it next to the box (4 faces of a cube). The rubber band A (R1, R2) has an initial radius of R1 and can be expanded in size up to R2 without breaking. You can pack a cubic box of side length L using a 4* L round rubber band (see Notes for clarity). Given the M-band bands and their first radius and the main radius, we need to match (provide) some rubber bands and boxes. The box needs at least one rubber band to pack and of course, each rubber band can be used to pack at least one box. Find the maximum number of boxes we can pack. Answer this in java programming language. Input Output 2 1 4 10 20 34 55 4 714 721 14 21 7:35

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
icon
Related questions
Question
You have N boxes in Samosas, where each box is a cube. To pack the box, you need to use a
rubber band (pseudo-circular, elastic band) by placing it next to the box (4 faces of a cube).
The rubber band A (R1, R2) has an initial radius of R1 and can be expanded in size up to R2
without breaking. You can pack a cubic box of side length L using a 4 * L round rubber band
(see Notes for clarity). Given the M-band bands and their first radius and the main radius, we
need to match (provide) some rubber bands and boxes. The box needs at least one rubber
band to pack and of course, each rubber band can be used to pack at least one box. Find the
maximum number of boxes we can pack. Answer this in java programming language.
Input
Output
2
1
4
10 20 34 55
4
714
7 21
14 21
7 35
Transcribed Image Text:You have N boxes in Samosas, where each box is a cube. To pack the box, you need to use a rubber band (pseudo-circular, elastic band) by placing it next to the box (4 faces of a cube). The rubber band A (R1, R2) has an initial radius of R1 and can be expanded in size up to R2 without breaking. You can pack a cubic box of side length L using a 4 * L round rubber band (see Notes for clarity). Given the M-band bands and their first radius and the main radius, we need to match (provide) some rubber bands and boxes. The box needs at least one rubber band to pack and of course, each rubber band can be used to pack at least one box. Find the maximum number of boxes we can pack. Answer this in java programming language. Input Output 2 1 4 10 20 34 55 4 714 7 21 14 21 7 35
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Topological Sort
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.
Similar questions
  • SEE MORE QUESTIONS
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