Shortest Path(最短路模拟）

Today, Husam was visiting his grandmother. Husam always takes a path such that the total distance he will walk is as minimum as possible. Husam decided to give you all information about his journey so that you can find the total distance he walked.

Husam grandmother's home is a kilometers away from Husam's home to the south, and bkilometers away to the west. Also, there is a river located c kilometers away from Husam's home to the east.

Before Husam visiting his grandmother, he went to the river to fill his bottle with water. After this, he then went directly to his grandmother's home. After Husam finished his visit, he followed the direct straight path between his grandmother's home and his home. When Husam walked x% of that path, he remembered that his bottle is empty, so, he went to the river to fill it, then he went to his home.

Husam needs your help to calculate the distance he walked today. Can you?

 

Input

The first line contains an integer T (1 ≤ T ≤ 105) specifying the number of test cases.

Each test case consists of a single line containing four integers a, b, c and x (1 ≤ a, b, c ≤ 109, 0 ≤ x ≤ 100).

Consider the ground and the river as a flat land, and the length of the river is limitless. Also, you can consider Husam and his grandmother homes as small points.

Output

For each test case, print a single line containing the total distance Husam walked during his journey.

Your answer will be considered correct if its relative or absolute error does not exceed 10 - 9.

Example

Input

1
6 2 3 18

Output

20.225553719

数学思想求两点到一条直线的总的最短距离

我们需要水平做一个镜像

剩下的就靠你的直角三角形知识了

另外这个题的第二个测试点超时，是因为调用输入类

所以我们自己写一个Scanner类InputReader2，解决了超时问题，感谢超大神的指导

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.Scanner;
import java.util.StringTokenizer;

public class Main {
    
    static double T,a,b,c,x;
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        InputReader2 sc=new InputReader2();
        T=sc.nextInt();
        while(T>0){
            a=sc.nextDouble();
            b=sc.nextDouble();
            c=sc.nextDouble();
            x=sc.nextDouble();
            double sum=0;
            sum+=Math.sqrt((2*c+b)*(2*c+b)+a*a);
            double h=a/100*x;
            double p=b/100*x; 
            sum+=Math.sqrt(h*h+p*p);
            sum+=Math.sqrt((2*c+b-p)*(2*c+b-p)+(a-h)*(a-h));
            System.out.println(String.format("%.9f",sum));
            
            T--;
        }
    }

}
class InputReader2
{
    BufferedReader buf;
    StringTokenizer tok;
    InputReader2()
    {
        buf = new BufferedReader(new InputStreamReader(System.in));
    }
    boolean hasNext()
    {
        while(tok == null || !tok.hasMoreElements()) 
        {
            try
            {
                tok = new StringTokenizer(buf.readLine());
            } 
            catch(Exception e) 
            {
                return false;
            }
        }
        return true;
    }
    String next()
    {
        if(hasNext()) return tok.nextToken();
        return null;
    }
    int nextInt()
    {
        return Integer.parseInt(next());
    }
    long nextLong()
    {
        return Long.parseLong(next());
    }
    double nextDouble()
    {
        return Double.parseDouble(next());
    }
    BigInteger nextBigInteger()
    {
        return new BigInteger(next());
    }
    BigDecimal nextBigDecimal()
    {
        return new BigDecimal(next());
    }
}