Solution 4 for Scaler Topics Fortnightly Contest - 26
Rectangle Cutting
This article is part of the Scaler Topics Fortnightly Contest - 26
Build an AI-First Career, Master the Complete Skillset
Choose from our industry-leading programs designed for career success
Modern Software and AI Engineering Program
Master full-stack development with AI integration
+1000 moreModern Data Science and ML with specialisation in AI
Advanced data science techniques with AI specialization
+1000 moreAdvanced AIML with Specialisation in Agentic AI
Deep dive into AIML with focus on Agentic systems
+1000 moreDevOps, Cloud & AI Platform Engineering
Build and manage AI-powered cloud infrastructure
+1000 moreAI Engineering Advanced Certification by IIT-Roorkee
Premier AI engineering certification from IIT-Roorkee
AI Forward Deployed Engineer Program
Full-stack engineering, production AI and client-facing consulting
+1000 moreSolution Approach
We can store all the factors of B and sort them. We go through all the factors of A and consider each one of them as the length of the rectangle. By binary search we can find the highest factor B less than the length, then we can check if the corresponding breadth of the inner rectangle is lower than or equal to the breadth of the rectangle X. If it satisfies the condition, we can simply consider this case and consider the perimeter of this rectangle into minimum.
**Time Complexity: O(sqrt(A) + sqrt(B)) Space Complexity: O(1)
C++ Implementation
Java Implementation
How Scaler Transformed Careers in Different Fields
Scaler learners achieved 2.5x salary growth with average post-Scaler CTC reaching ₹23L.
Google
Amazon
Microsoft
Flipkart
Adobe1200+ more
