uva11806 Cheerleaders

In most professional sporting events, cheerleaders play a major role
in entertaining the spectators. Their roles are substantial during
breaks and prior to start of play. The world cup soccer is no
exception. Usually the cheerleaders form a group and perform at the
centre of the eld. In addition to this group, some of them are placed
outside the side line so they are closer to the spectators. The
organizers would like to ensure that at least one cheerleader is
located on each of the four sides. For this problem, we will model the
playing ground as an M N rectangular grid. The constraints for
placing cheerleaders are described below: There should be at least
one cheerleader on each of the four sides. Note that, placing a
cheerleader on a corner cell would cover two sides simultaneously.
There can be at most one cheerleader in a cell. All the cheerleaders
available must be assigned to a cell. That is, none of them can be
left out. The organizers would like to know, how many ways they can
place the cheerleaders while maintaining the above constraints. Two
placements are different, if there is at least one cell which contains
a cheerleader in one of the placement but not in the other. Input The
rst line of input contains a positive integer T 50, which denotes
the number of test cases. T lines then follow each describing one test
case. Each case consists of three nonnegative integers, 2 M , N 20
and K
500. Here M is the number of rows and N is the number of columns in the grid. K denotes the number of cheerleaders that must be assigned
to the cells in the grid. Output For each case of input, there will be
one line of output. It will rst contain the case number followed by
the number of ways to place the cheerleaders as described earlier.
Look at the sample output for exact formatting. Note that, the numbers
can be arbitrarily large. Therefore you must output the answers modulo
1000007.

如果要求是某一一些行或列不能取的话就很好计算了，因为总共只有4个限制，可以枚举各种情况用容斥原理。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
const int mod=1000007,maxk=500;
int c[510][510];
int main()
{
    int i,j,k,m,n,mm,nn,T,K,ans,cnt;
    for (i=0;i<=maxk;i++)
      c[i][0]=1;
    for (i=1;i<=maxk;i++)
      for (j=1;j<=i;j++)
        c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
    scanf("%d",&T);
    for (K=1;K<=T;K++)
    {
        scanf("%d%d%d",&n,&m,&k);
        ans=0;
        for (i=0;i<=15;i++)
        {
            nn=n;
            mm=m;
            cnt=0;
            if (i&1) nn--,cnt++;
            if (i&2) nn--,cnt++;
            if (i&4) mm--,cnt++;
            if (i&8) mm--,cnt++;
            if (cnt&1) ans=((ans-c[mm*nn][k])%mod+mod)%mod;
            else ans=(ans+c[mm*nn][k])%mod;
        }
        printf("Case %d: %d\n",K,ans);
    }
}