class TTT -i main clu i++ res can
- #include < bits / stdc++.h > using namespace std;
- typedef long long ll;
- ll sqr(ll a, ll b) {
- return a * a * b * b;
- }
- int main() {
- int t,
- n,
- m,
- k,
- cas = 1;
- scanf("%d", &t);
- while (t--) {
- scanf("%d%d%d", &n, &m, &k);
- double res = 0;
- ll t = (ll) n * n * m * m;
- for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) {
- ll tt = 0;
- tt += sqr(m, n - i); //
- tt += sqr(n, m - j); //
- tt += sqr(n, j - 1); //
- tt += sqr(m, i - 1); //
- tt -= sqr(n - i, m - j); //
- tt -= sqr(i - 1, m - j); //
- tt -= sqr(n - i, j - 1);
- tt -= sqr(i - 1, j - 1); //
- double ttt = 1.0 * tt / t;
- ttt = 1.0 - pow(ttt, k);
- //cout<<ttt<<endl;
- res += ttt;
- }
- int ans = (int) round(res);
- printf("Case #%d: %d\n", cas++, (int) round(res));
- }
- return 0;
- }
hdu 容斥
来源: http://www.bubuko.com/infodetail-2047046.html