ACM The Smallest Perimeter

Problem Link: http://acm.epoka.edu.al:8888/en/problem-pid-c638?ps=1&smt=9&smpwid=0



#include <bits/stdc++.h>
using namespace std;
int main()
{
    float pi=3.14159,pm,sum=0.0,r,a,b,h,rs,minimum=INT_MAX;
    int t,n,i;
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin>>t;
    for(i=1;i<=t;i++)
    {
        cin>>n;
        if(n==1)
        {
            cin>>r;
            pm=2*pi*r;
            sum=sum+pm;
            minimum=min(minimum,pm);
        }
        else if(n==2)
        {
            cin>>a>>b;
            pm=2*(a+b);
            sum=sum+pm;
            minimum=min(minimum,pm);
        }
        else
        {
            cin>>b>>h;
            a=sqrt(((b*b)/4)+(h*h));
            pm=2*a+b;
            sum=sum+pm;
            minimum=min(minimum,pm);
        }




    }
    printf("%0.2f %0.2f\n",sum,minimum);

    return 0;
}

Download Coding Interview Book and Get More Tutorials for Coding and Interview Solution: Click Here

Download System Design Interview Book and Get More Tutorials and Interview Solution: Click Here

Do you need more Guidance or Help? Then Book 1:1 Quick Call with Me: Click Here

Share on Google Plus

About Ashadullah Shawon

I am Ashadullah Shawon. I am a Software Engineer. I studied Computer Science and Engineering (CSE) at RUET. I Like To Share Knowledge. Learn More: Click Here