10314 The Least Distance（Scau11校赛）_least distance problem-优快云博客

本文介绍了一个关于计算游泳池中最短路径的问题，通过数学计算得出从左上顶点出发，左右折返三次，最后到达右下顶点的最短距离，并提供了C语言实现代码。

描述

Mr. Jeff likes swimming. But in the swimming pool he always swims from a corner to the counter corner in the way as the figure shows, i.e. he swims to the other side and back, then go to the other side corner.

The problem is coming: what is the least distance Mr. Jeff has to swim?

输入格式

There are several test cases, each case occupies one line. For each line, there are two positive integers, the length and width of the swimming pool. The length and width are between 1 and 9999, inclusively. Input is ended with length and width equal 0.

输出格式

Output each least distance in a single line, round the result to the float that has one bit decimal, e.g. 1.33 rounds to 1.3, 1.85 rounds to 1.9, 123.456 rounds to 123.5..

输入样例

1 1 1 2 2 1 0 0

输出样例

3.2 6.1 3.6

题目大意

一个长方形游泳池，从左上顶点出发，左右折返三次，最后到达右下顶点，求最短路径。小数点后保留1位小数。

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

int main()
{
    int length,width;
    float a;
    
    do
    {
          scanf("%d%d",&length,&width);
          if(length==0&&width==0)
              break;
    a=sqrt(pow(length,2)+pow(3*width,2));
    printf("%.1f\n",a);
}while(1);
    system("pause");
    return 0;
}