Multicolored Markers
给出a和b,构造一个面积为a+b的矩形,要求这个矩形包含一个面积为a或b的小矩形,求构造出的大矩形最小周长
面积一定时,x和y越接近,周长越短,所以枚举sqrt(a+b)~1,找出c*d=s的边c和d,再判断当边长为c和d时,是否能包含面积为a或为b的小矩形
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<fstream>
#include<math.h>
#include<stack>
#include<queue>
#include<bitset>
#include<utility>
#include<set>
#include<map>
#include<sstream>
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;
const double eps=0.0000000000001;
const ll mod=998244353;
const int N=200005;
int main(){
ll a,b;
while(~scanf("%I64d%I64d",&a,&b)){
ll ans=0;
ll s=a+b;
ll c=sqrt(s);
while(1){
if(s%c==0){
ll d=s/c;
bool f=0;
for(int i=c;i>=1;i--){
if(a%i==0&&a/i<=d){
ans=2*(c+d);
f=1;
break;
}
if(b%i==0&&b/i<=d){
ans=2*(c+d);
f=1;
break;
}
}
if(f==1)break;
}
c--;
}
printf("%I64d\n",ans);
}
return 0;
}