Help needed in Packing Rectangles (Binary Search)

→ Pay attention

Before contest
EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2)
05:38:56
Register now »

*has extra registration

→ Streams

Atcoder ABC #360 Solution Discussion

By aryanc403

Before stream 04:48:56

View all →

→ Top rated

#	User	Rating
1	tourist	3845
2	jiangly	3707
3	Benq	3630
4	orzdevinwang	3573
5	Geothermal	3569
5	cnnfls_csy	3569
7	jqdai0815	3532
8	ecnerwala	3501
9	gyh20	3447
10	Rebelz	3409

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	maomao90	168
2	awoo	163
3	adamant	162
4	maroonrk	152
5	nor	151
5	-is-this-fft-	151
7	atcoder_official	147
7	TheScrasse	147
9	Petr	145
10	pajenegod	144

View all →

→ Find user

→ Recent actions

Detailed →

Help needed in Packing Rectangles (Binary Search)

Revision en2, by coder__12345, 2024-02-04 00:12:50

Problem Link: https://codeforces.com/edu/course/2/lesson/6/2/practice/contest/283932/problem/A

Accepted Code

#include<bits/stdc++.h>

using namespace std;

#define int long long


int a,b,n;

bool isfit(int mid){
	return (mid/a)*(mid/b)>=n;
}

signed main(){
	cin>>a>>b>>n;
	int l=0,r=1;
	while(isfit(r)==false){
		r*=2;
	}
	while(r-l>1){
		int mid=l+(r-l)/2;
		if(isfit(mid)){
			r=mid;
		}
		else{
			l=mid;
		}
	}
        if(isfit(l)) cout<<l<<endl;
        else cout<<r<<endl;
}

Not Accepted Code

#include<bits/stdc++.h>

using namespace std;

#define int long long


int a,b,n;

bool isfit(int mid){
	return (mid/a)*(mid/b)>=n;
}

signed main(){
	cin>>a>>b>>n;
	int l=0,r=1;
	while(isfit(r)==false){
		r*=2;
	}
	while(r-l>1){
		int mid=l+(r-l)/2;
		if(isfit(mid)){
			r=mid;
		}
		else{
			l=mid+1;
		}
	}
        cout<<l<<endl;
}

The only change in the two code is the value being assigned to l, when i normally implement binary search i use it like in the not accepted one but why in this problem its giving wrong answer?

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en2		coder__12345	2024-02-04 00:12:50	95
	en1		coder__12345	2024-02-04 00:07:51	1141	Initial revision (published)