Blog

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int main(){
    int t;
    double AB,AC,BC,AD,ADE,ABC,rat;
    scanf("%d",&t);
    for(int i=1;i<=t;i++){

        scanf("%lf%lf%lf%lf",&AB,&AC,&BC,&rat);
        ABC=rat+1;
        AD=sqrt(rat/ABC)*AB;
        printf("Case %d: %.10lf\n",i,AD);
          // Time Complexity : O(1)
    }
}

----------------------------------- OR -------------------------------------
 /**
    In Binary Search approach,
we have to check whether our calculated ratio(ADE/BDEC) is same as given ratio. 

**/

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

double isRatio(double AB,double AC,double BC,double AD){
  
    double AE,DE,sOfABC,sOfADE,areaOfABC,areaOfADE,areaOfBDEC;
    AE=(AD*AC)/AB;
    DE=(AD*BC)/AB;
    sOfABC=(AB+AC+BC)/2.0;
    sOfADE=(AD+AE+DE)/2.0;
    ///ABC=ADE+BDEC

    areaOfABC=sqrt(sOfABC*(sOfABC-AB)*(sOfABC-BC)*(sOfABC-AC));
    areaOfADE=sqrt(sOfADE*(sOfADE-AD)*(sOfADE-AE)*(sOfADE-DE));
    areaOfBDEC=areaOfABC-areaOfADE;

    return areaOfADE/areaOfBDEC;
}

double binarySearch(double AB,double AC,double BC,double ratio){
    
    double low=0.0,high=AB,AD;
    for(int i=0;i<100;i++){
        double mid=low+(high-low)/2.0;
        AD=mid;
        if(isRatio(AB,AC,BC,AD)>ratio){
          high=mid; 
        }
        else{
          low=mid;
        }
    }
    return AD;
   /** as AD is a double type value that's why we just update 
      high=mid and low=mid. we can't jump by +1 or -1 . we need to check 
      the fraction value too.
   **/
}

int main(){
    double AB,AC,BC,ratio;
    int t;
    cin>>t;
    for(int i=1;i<=t;i++){
        cin>>AB>>AC>>BC>>ratio;
        cout<<fixed<<setprecision(15)<<"Case "<<i<<": "<<binarySearch(AB,AC,BC,ratio)<<"\n";

    }
}