2020牛客多校（第四场）Finding the Order

 

 

 看着代码画个图应该就能理解了....绝对不是因为我懒

 

#include 
#include
#include
#include
#include
#include
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const int maxn= 2e5+5;
const double pi = acos(-1.0);
const ll mod = 1e9+7;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll quickpow(ll a,ll b)
{

    ll ret=1;
    while(b!=0)
    {
        if(b&1)
            ret=ret*a%mod;
        b>>=1;
        a=a*a%mod;
    }
    return ret%mod;
    
}
int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
long long lcm(long long  a, long long b)
{
    return a * (b/gcd(a, b));  
}
int main()
{
    ios;

	int repeat;
	cin>>repeat;
	while(repeat--){
     int ac,ad,bc,bd;
	 cin>>ac>>ad>>bc>>bd;
    if(ac>bc&&ad>bd){
		if(ac+bc>ad+bd)cout<<"AB//DC"<=ac&&bd>=ad)
	{
	if(ac+bc=ad+bd)cout<<"AB//CD"<bd)cout<<"AB//CD"<bc&&ad<=bd)cout<<"AB//DC"<