2021牛客多校8 K

最新推荐文章于 2021-08-23 19:23:32 发布

保安在哪里啊

最新推荐文章于 2021-08-23 19:23:32 发布

阅读量60

点赞数

本文链接：https://blog.csdn.net/weixin_53177273/article/details/119797830

版权

2021牛客多校8 K

牛客链接

代码：

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
#include<math.h>
#include<queue>
using namespace std;
typedef long long ll;
typedef double dd;
typedef pair<int, int> pii;
typedef pair<dd, dd> pdd;
const int MAXN = 100010;
const int MAXM = 10;
const int inf = 1e9 + 7;
const dd eps = 1e-9;
const dd pi = acos(-1);

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        double w, d;
        cin >> w >> d;
        double a = min(w, d), b = sqrt(w * w + d * d);
        ll ans = 0;
        for (ll x = 0; x <= 100 && a * x <= pi; x++)
            ans = max(ans, 2 * x + 3 * (ll)(((pi - x * a) / b)));
        for (ll y = 0; y <= 100 && b * y <= pi; y++)
            ans = max(ans, 2 * (ll)((pi - y * b) / a) + 3 * y);
        cout << ans + 4 << endl;
    }
}