HDU/HDOJ 1030 Delta-wave(找规律)

// 首先判断第几行
// 再判断是正三角还是倒三角
#include 
using namespace std;

int M, N;

int hang(int n)
{
    int cnt = 0;
    for(int i=1, s=0; s> M >> N)
    {
        if(M > N)
        {
            M = M^N;
            N = M^N;
            M = M^N;
        }
        //cout << M << " " << N << endl;
        //cout << hang(M) << " " << hang(N) << endl;
        int h1 = hang(M), h2 = hang(N);
        int dish = h2 - h1;
        int tot = 0;
        if(h1 == h2)
        {
            cout << N-M << endl;
            continue;
        }
        int x1 = wei(M), x2 = wei(N);
        //cout << x1 << " " << x2 << endl;
        int w1 = M + (h2-1)*(h2-1) - (h1-1)*(h1-1);
        int w2 = w1 + 2*dish;

        bool flag = 0;
        if(N >= w1 && N <= w2)
        {
            tot = 2*dish;
            flag = 1;
        }
        else
        {
            if(N < w1)
                tot = 2*dish + w1-N;
            else
                tot = 2*dish + N-w2;
        }
        //cout << tot << endl;
        if(flag && !isUP(M) && isUP(N))
                tot += 1;
        else if(flag && isUP(M) && !isUP(N))
            tot -= 1;
        cout << tot << endl;


    }
    return 0;
}