- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Suppose we have a list of positive numbers, representing ribbons length and also have one value k. We can cut the ribbons as many times as we want, we have to find the largest length r such that we can have k ribbons of length r. If we cannot find such solution, return -1.

So, if the input is like ribbons = [1, 2, 5, 7, 15] k = 5, then the output will be 5, as we can cut the ribbon of size 15 into 3 pieces of length 5 each. Then cut the ribbon of size 7 into size 2 and 5. And there is another ribbon of size 5, so we are getting 5 ribbons in total of size 5.

To solve this, we will follow these steps −

- left := 0
- right := maximum of ribbons
- while left < right, do
- mid := floor of (left + right + 1) / 2
- if sum of all elements present in the list containing (floor of ribbonLen / mid for each ribbonLen in ribbons which are at least k), then
- left := mid

- otherwise,
- right := mid - 1

- if left is non-zero, then
- return left

- return -1

Let us see the following implementation to get better understanding −

def solve(ribbons, k): left = 0 right = max(ribbons) while left < right: mid = (left + right + 1) // 2 if sum((ribbonLen // mid for ribbonLen in ribbons)) >= k: left = mid else: right = mid - 1 if left: return left return -1 ribbons = [1, 2, 5, 7, 15] k = 5 print(solve(ribbons, k))

[1, 2, 5, 7, 15], 5

5

- Related Questions & Answers
- Find maximum average subarray of k length in C++
- Maximum count of substrings of length K consisting of same characters in C++
- Program to find maximum length of non-sharing words in Python
- Program to find length of longest matrix path length in Python
- Program to find length of shortest sublist with maximum frequent element with same frequency in Python
- Program to find min length of run-length encoding after removing at most k characters in Python
- Program to find maximum length of subarray with positive product in Python
- Program to find minimum length of lossy Run-Length Encoding in Python
- Program to find number of K-Length sublists whose average is greater or same as target in python
- Remove Tuples of Length K in Python
- Program to find length of longest set of 1s by flipping k bits in Python
- Python program to omit K length Rows
- Program to find maximum profit after cutting rods and selling same length rods in Python
- Program to find length of shortest supersequence in Python
- Program to find length of longest substring which contains k distinct characters in Python

Advertisements