304030: CF774G. Perfectionist Arkadiy

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Perfectionist Arkadiy

题意翻译

给你一个h * w的矩阵,在矩阵中放置n个a * a的小方块,每两个相邻方块的距离均为x,靠近边缘的方块与边缘的距离也均是x。给定正整数a, h, w求最小的x

题目描述

Arkadiy has lots square photos with size $ a×a $ . He wants to put some of them on a rectangular wall with size $ h×w $ . The photos which Arkadiy will put on the wall must form a rectangular grid and the distances between neighboring vertically and horizontally photos and also the distances between outside rows and columns of photos to the nearest bound of the wall must be equal to $ x $ , where $ x $ is some non-negative real number. Look on the picture below for better understanding of the statement. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF774G/5594570290c0b989f39a81d820befd2001debe5b.png)Arkadiy haven't chosen yet how many photos he would put on the wall, however, he want to put at least one photo. Your task is to determine the minimum value of $ x $ which can be obtained after putting photos, or report that there is no way to put positive number of photos and satisfy all the constraints. Suppose that Arkadiy has enough photos to make any valid arrangement according to the constraints. Note that Arkadiy wants to put at least one photo on the wall. The photos should not overlap, should completely lie inside the wall bounds and should have sides parallel to the wall sides.

输入输出格式

输入格式


The first line contains three integers $ a $ , $ h $ and $ w $ ( $ 1<=a,h,w<=10^{9} $ ) — the size of photos and the height and the width of the wall.

输出格式


Print one non-negative real number — the minimum value of $ x $ which can be obtained after putting the photos on the wall. The absolute or the relative error of the answer must not exceed $ 10^{-6} $ . Print -1 if there is no way to put positive number of photos and satisfy the constraints.

输入输出样例

输入样例 #1

2 18 13

输出样例 #1

0.5

输入样例 #2

4 4 4

输出样例 #2

0

输入样例 #3

3 4 3

输出样例 #3

-1

说明

In the first example Arkadiy can put $ 7 $ rows of photos with $ 5 $ photos in each row, so the minimum value of $ x $ equals to $ 0.5 $ . In the second example Arkadiy can put only $ 1 $ photo which will take the whole wall, so the minimum value of $ x $ equals to $ 0 $ . In the third example there is no way to put positive number of photos and satisfy the constraints described in the statement, so the answer is -1.

Input

题意翻译

给你一个h * w的矩阵,在矩阵中放置n个a * a的小方块,每两个相邻方块的距离均为x,靠近边缘的方块与边缘的距离也均是x。给定正整数a, h, w求最小的x

加入题单

算法标签: