Help needed in Packing Rectangles (Binary Search)

→ Pay attention

Before contest
Codeforces Round 1003 (Div. 4)
2 days
Register now »

→ Streams

By aryanc403

Before stream 23:54:09

View all →

→ Top rated

#	User	Rating
1	jiangly	3898
2	tourist	3840
3	orzdevinwang	3706
4	ksun48	3691
5	jqdai0815	3682
6	ecnerwala	3525
7	gamegame	3477
8	Benq	3468
9	Ormlis	3381
10	maroonrk	3379

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	cry	167
2	-is-this-fft-	165
3	Dominater069	160
4	atcoder_official	159
4	Um_nik	159
6	djm03178	156
7	adamant	153
8	luogu_official	149
8	awoo	149
10	TheScrasse	146

View all →

→ Find user

→ Recent actions

Detailed →

Help needed in Packing Rectangles (Binary Search)

Revision en1, by coder__12345, 2024-02-04 00:07:51

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)