uva 11538 计数原理

分为皇后在同一行、同一列、同一对角线的情况分别计数相加即可。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <climits>
using namespace std;

typedef long long ll;

ll a( ll n, ll m )
{
    return n * m * ( m - 1 );
}

ll b( ll n, ll m )
{
    return a( m, n );
}

ll d( ll n, ll m )
{
    return n * ( n - 1 ) * ( n - 2 ) / 3 * 4 + 2 * ( m - n + 1 ) * n * ( n - 1 );
}

int main ()
{
    ll n, m;
    while ( cin >> n >> m )
    {
        if ( n == 0 && m == 0 ) break;
        if ( n > m ) swap( n, m );
        cout << a( n, m ) + b( n, m ) + d( n, m ) << endl;
    }
    return 0;
}