牛客8-K.Yet Another Problem About Pi

​​傳送門​​

題意：

思路：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<math.h>
#define ll long long
using namespace std;
double pi = acos(-1);

int main()
{
  int t;
  cin>>t;
  while(t--)
  {
    double w,d;
    cin>>w>>d;
    double a = min(w,d),b = sqrt(pow(w,2)+pow(d,2));
    ll ans = 0;
    for(int i = 0; i <= 2; i++)
    {
      if(pi-i*a>=0)
      ans = max(ans,(ll)(i*2+(ll)((pi-i*a)/b)*3.0));
      if(pi-i*b>=0)
      ans = max(ans,(ll)(i*3+(ll)((pi-i*b)/a)*2.0));
    }
    cout<<ans+4<<endl;
  }
}