In this HackerEarth Fitting circles problem solution, you are given a rectangle of length a and width b. You are required to determine a circle that contains the maximum circumference that fits inside the rectangle. This type of circle is called a big circle. Your task is to determine the maximum number of big circles that can fit inside the rectangle.


HackerEarth Fitting circles problem solution


HackerEarth Fitting circles problem solution.

#include <bits/stdc++.h>
using namespace std;

int main()
{
int t; cin>>t;
while(t--)
{
int a, b;
cin >> a >> b;
int ans = max(a, b) / min(a, b);
cout << ans << endl;
}
return 0;
}


Second solution

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 1e5 + 14;

int a, b;
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int t;
cin >> t;
while(t--){
cin >> a >> b;
cout << max(a, b) / min(a, b) << '\n';
}
}