1 solutions

  • 0
    @ 2025-11-5 20:13:02

    C :

    #include<stdio.h>
    #include<math.h>
    int main()
    {
    	int i,n,a,b,c;
    	double len,len1,v;
    	scanf("%d",&n);
    	while(n--)
    	{
    		scanf("%d%d%d%lf",&a,&b,&c,&v);
    		len=sqrt((a+b)*(a+b)+c*c);
    		len1=sqrt((a+c)*(a+c)+b*b);
    		if(len1<len) len=len1;
    		len1=sqrt((b+c)*(b+c)+a*a);
    		if(len1<len) len=len1;
    		printf("%.2f\n",len/v);
    	}
    }
    

    C++ :

    #include <stdio.h>
    #include <math.h>
    int main()
    {
    	int n,i,a,b,h,T,t;
    	double v,s1,s;
    	scanf("%d",&T);
    	while(T--)
    	{
    		scanf("%d%d%d%lf",&a,&b,&h,&v);
    		s=sqrt(a*a+(b+h)*(b+h));
    		s1=sqrt((a+b)*(a+b)+h*h);
    		if(s1<s)
    			s=s1;
    		s1=sqrt((a+h)*(a+h)+b*b);
    		if(s1<s)
    			s=s1;
    		printf("%.2f\n",s/v);
    	}
    	return 0;
    }
    
    • 1

    Information

    ID
    20142
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By