Help needed in Packing Rectangles (Binary Search)

→ Pay attention

Before contest
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
14:08:16
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	3993
2	jiangly	3743
3	orzdevinwang	3707
4	Radewoosh	3627
5	jqdai0815	3620
6	Benq	3564
7	Kevin114514	3443
8	ksun48	3434
9	Rewinding	3397
10	Um_nik	3396

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	cry	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	155
8	TheScrasse	154
9	Dominater069	153
10	djm03178	152

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.me/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)