Golden rectangles
Practice
3.4 (125 votes)
Algorithms
Easy
Searching
Problem
36% Success 35147 Attempts 20 Points 1s Time Limit 256MB Memory 1024 KB Max Code
You have \(N\) rectangles. A rectangle is golden if the ratio of its sides is in between \([1.6, 1.7]\), both inclusive. Your task is to find the number of golden rectangles.
Input format
- First line: Integer \(N\) denoting the number of rectangles
- Each of the \(N\) following lines: Two integers \(W, H\) denoting the width and height of a rectangle
Output format
- Print the answer in a single line.
Constraints
\(1 \le N \le 10^5\)
\(1 \le W, H \le 10^9\)
Sample Input
5 10 1 165 100 180 100 170 100 160 100
Sample Output
3
Explanation
There are three golden rectangles: (165, 100), (170, 100), (160, 100).
Code Editor
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Submissions
Please login to view your submissions
Similar Problems
Points:20
10 votes
Tags:
MathLinear SearchAlgorithms
Points:20
13 votes
Tags:
Linear SearchImplementationAlgorithmsGreedy algorithm
Points:20
17 votes
Tags:
AlgorithmsGreedy algorithmLinear Search
Editorial
Login to unlock the editorial
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor