Problem:
Score: 300 points

Problem Statement

Consider an analog clock whose hour and minute hands are A and B centimeters long, respectively.

An endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.

At 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?

Constraints

All values in input are integers.

1 \leq A, B \leq 1000

0 \leq H \leq 11

0 \leq M \leq 59

Input

Input is given from Standard Input in the following format:

A B H M

Output

Print the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.

Sample Input 1

3 4 9 0

Sample Output 1

5.00000000000000000000

The two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.

Sample Input 2

3 4 10 40

Sample Output 2

4.56425719433005567605

The two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.

Solution in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

// myfirstatcoder.cpp : アプリケーションのエントリ ポイントを定義します。

#include "bits/stdc++.h"
#define rep(i,cc,n) for(int i=cc;i<(n);++i)
#define drep(i,cc,n) for(int i=cc;i>(n);--i)
#define llrep(i,cc,n) for(long long i=cc;i<(n);++i)
using namespace std;
using ll = long long;

int main()
{
	int a,b,h,m;
	cin >> a >> b >> h >> m;
	long double rad,ans;
	h = h * 30;
	m = m * 6;
	rad = h + m / 12 - m;
	cout << rad << endl;
	if (rad < 0)
		rad = -rad;
	if (rad >= 180)
		rad -= 180;
	rad = (rad / 180 )* M_PI;
	ans = a * a + b * b - 2 * a * b * cos(rad);
	ans = sqrt(ans);
	//ans = pow(ans, 0.5);
	cout << ans << endl;
}

/*
ライブラリ
・std
::::sqrt();
・string
::::str.at(0)
::::str.length()
::::str.pop_back();
::::str.erase(str.begin()+2, str.end());  //要素3から終わりまで削除
・vector<int>
::::vector<int> a(n,-1);
::::vector<int> s;  s.push_back()
::::vector<vector<int>> A(N,vector<int>(M));  A[i][j] = i;
・map<string,int>
・sort(a.begin(),a.end());

関数
・rep_2(i,0,1<<n) … ２のN乗ループ
・while(node[v] == -1) … ノードの探索と生成
・gcd(int, int) … 最大公約数 int
・find_string(str, str) … 文字列検索 bool
*/