[NWRRC2015] Alex Origami Squares（浮点数二分）

最新推荐文章于 2024-10-02 23:40:03 发布

陈进士学习

最新推荐文章于 2024-10-02 23:40:03 发布

阅读量831

点赞数 12

分类专栏：洛谷 ICPC&CCPC真题文章标签：算法 c++ 数据结构 c语言二分法

本文链接：https://blog.csdn.net/JungleZRD/article/details/139001951

版权

洛谷同时被 2 个专栏收录

72 篇文章 1 订阅

订阅专栏

ICPC&CCPC真题

35 篇文章 2 订阅

订阅专栏

题面翻译

题目描述

有一张矩形纸，要求将其裁成三个全等的正方形，且每一个正方形的侧面都与纸张的侧面平行，问裁成的小正方形边长最大是多少。

输入格式

一行两个整数 $h$ 和 $w$ $(1\le h,w\le 10^3)$ 表示矩形纸张的长和宽。

输出格式

输出一行一个实数，表示正方形边长的最大可能值。

你的答案与标准答案的相对及绝对误差不应超过 $10^{-3}$ 。

题目描述

Alex is fond of origami – Japanese art of paper folding. Most origami designs start with a square sheet of paper. Alex is going to make a present for his mother. Present’s design requires three equal square sheets of paper, but Alex has only one rectangular sheet. He is able to cut out squares of this sheet, but their sides should be parallel to the sides of the sheet. Help Alex to determine the maximum possible size of the paper squares he is able to cut out.

输入格式

The single line of the input file contains two integers $h$ and $w$ – the height and the width of the sheet of paper $\le h , w \le 1000)$ .

输出格式

Output a single real number – the maximum possible length of the square side. It should be possible to cut out three such squares of $\times w$ sheet of paper, so that their sides are parallel to the sides of the sheet.

Your answer should be precise up to three digits after the decimal point.

样例 #1

样例输入 #1

210 297

样例输出 #1

105.0

样例 #2

样例输入 #2

250 100

样例输出 #2

83.333333

提示

Time limit: 2 s, Memory limit: 256 MB.

spj provider:@shenyouran.

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 1e18
const int mod=1e9+7;
const int N=2e5+5;
void solve(){
	int x,y;
	cin>>x>>y;
	int a=max(x,y);
	int b=min(x,y);
	double l=0,r=1e9;
	while((r-l)>1e-3){
		double mid=(r+l)/2;
		if(mid*3<=a&&mid<=b||mid*2<=a&&mid*2<=b) l=mid;
		else r=mid;
	}
	printf("%lf",l);
}
signed main(){
//	ios::sync_with_stdio(false);
//	cin.tie(nullptr);
//	cout.tie(nullptr);
	int tt=1;
//	cin>>tt;
	while(tt--) solve();
	return 0;
}