# Abstract Picture

Your friend from Manhattan is visiting you in Amsterdam. Because she can only stay for a short while, she wants to see as many tourist attractions in Amsterdam in as little time as possible. To do that, she needs to be able to figure out how long it takes her to walk from one landmark to another. In her hometown, that is easy: to walk from point m = (mx,my) to point n = (nx,ny) in Manhattan you need to walk a distance |nx − mx|+|ny − my|, since Manhattan looks like a rectangular grid of city blocks. However, Amsterdam is not well approximated by a rectangular grid. Therefore, you have taken it upon yourself to figure out the shortest distances between attractions in Amsterdam. With its canals, Amsterdam looks much more like a half-disc, with streets radiating at regular angles from the center, and with canals running the arc of the circle at equally spaced intervals. A street corner is given by the intersection of a circular canal and a street which radiates from the city center.

Depending on how accurately you want to model the street plan of Amsterdam, you can split the city into more or fewer half rings, and into more or fewer segments. Also, to avoid conversion problems, you want your program to work with any unit, given as the radius of the half circle. Can you help your friend by writing a program which computes the distance between any two street corners in Amsterdam, for a particular approximation?

# Input

The input consists of

• One line with two integers M,N and a floating point number R.
  • 1 ≤ M ≤ 100 is the number of segments (or ‘pie slices’) the model of the city is split into.
  • 1 ≤ N ≤ 100 is the number of half rings the model of the city is split into.
  • 1 ≤ R ≤ 1000 is the radius of the city.
• One line with four integers, ax,ay,bx,by, with 0 ≤ ax,bx ≤ M, and 0 ≤ ay,by ≤ N, the coordinates of two corners in the model of Amsterdam.

# Output

Output a single line containing a single floating point number, the least distance needed to travel from point a to point b following only the streets in the model. The result should have an absolute or relative error of at most 10^{−6}.

# Example

Input 1

6 5 2.0
1 3 4 2 

Output 1

1.65663706143592

Input 2

9 7 3.0
1 5 9 5

Output 2

4.28571428571429

Input 3

10 10 1.0
2 0 6 0

Output 3

0

# Solution

# 题意

问一个扇形坐标系中两点的最短曼哈顿距离。

# 思路

假设两点$A(x_1, y_1)$, $B(x_2, y_2)$，其中$y_1 \leq y_2$（点A更靠近原点）。 其之间的曼哈顿距离有两种。

1. A -> 原点 -> B，这种情况下曼哈顿距离为$(y_1 + y_2) * r$。
2. A -> B的半径上 -> B， 这种情况下曼哈顿距离为$(y_2 - y_1) * r + \frac{\pi}{m} * |x_1 - x_2| * r * y_1$

二者选一小即可。

# Code

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const double pi = acos(-1);
double R, r, m, n, x[2], y[2];
int main() 
{
    scanf("%lf%lf%lf%lf%lf%lf%lf", &m, &n, &R, x, y, x + 1, y + 1);
    r = R / n;
    double ans1 = r * fabs(y[0] - y[1]) + pi * r * min(y[0], y[1]) * fabs(x[0] - x[1]) / m;
    double ans2 = (y[0] + y[1]) * r;
    printf("%.6f\n", min(ans1, ans2));
    return 0;
}