Submission #19509201

---

Source Code Expand

#include <bits/stdc++.h>
#define ZERO(a) memset(a,0,sizeof(a))
#define FILL(a,b) memset(a,b,sizeof(a))
#define SORT(v) sort((v).begin(),(v).end())
#define RSORT(v) sort((v).rbegin(),(v).rend())
#define FOR(i,a,b)  for(int i=a, i##_len=(b); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
using ll = int64_t;
using namespace std;
const long double PI = acosl(-1);

int main(void) {
    int A, B, H, M;
    cin >> A >> B >> H >> M;
    long double hrad = (2 * PI * (H * 60 + M)) / (12 * 60);
    long double mrad = (2 * PI * M) / 60;
    long double ans = sqrtl(powl(A * cosl(hrad) - B * cosl(mrad), 2)
                    + powl(A * sinl(hrad) - B * sinl(mrad), 2));
    printf("%.10Lf", ans);
    return 0;
}

Submission Info

Judge Result