HDU 5245 Joyful

HDU 5245 Joyful

/**HDU 5245 Joyful*/#include<algorithm>#include<iostream>#include<cstring>#include<cstdio>#include<vector>#include<cmath>#define maxn 3005#define INF 0x3fffffff#define ll __int64using namespace std;int main(){    ll T,ii=1,n,m,k;    scanf("%I64d",&T);    while(T--){        scanf("%I64d%I64d%I64d",&n,&m,&k);        double _hope=0,p,s1,s2,s;        for(ll i=1;i<=n;i++){            for(ll j=1;j<=m;j++){                s1=i*j*(n-i+1)*(m-j+1);//左上，右下                s2=(n-i+1)*j*i*(m-j+1);//左下，右上                s=2*(s1+s2-(i*(n-i+1))-(j*(m-j+1)))+1;//去处重复的一行一列，最后加上中间一点                p=s/(n*n*m*m);                _hope+=(1-pow(1-p,k));            }        }        printf("Case #%I64d: %.0lf\n",ii++,_hope);    }    return 0;}