forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathH.cpp
More file actions
43 lines (36 loc) · 1.24 KB
/
H.cpp
File metadata and controls
43 lines (36 loc) · 1.24 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include <bits/stdc++.h>
#define int long long
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; ++i)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; --i)
#define REP(i,a) for(int i=0,_a=(a); i < _a; ++i)
#define DEBUG(X) { cout << #X << " = " << (X) << endl; }
#define PR(A,n) { cout << #A << " = "; FOR(_,1,n) cout << A[_] << ' '; cout << endl; }
#define PR0(A,n) { cout << #A << " = "; REP(_,n) cout << A[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define __builtin_popcount __builtin_popcountll
#define SZ(x) ((int) (x).size())
#define double long double
using namespace std;
int GI(int& x) {
return scanf("%lld", &x);
}
double sumlog[1000111];
#undef int
int main() {
#define int long long
ios :: sync_with_stdio(0); cin.tie(0);
cout << (fixed) << setprecision(30);
int w, h, n;
while (cin >> w >> h >> n) {
sumlog[0] = 0.0;
FOR(i,1,n) sumlog[i] = sumlog[i-1] + log(i);
double res = 0.0;
FOR(k,0,n) {
double l = sumlog[n] - sumlog[k] - sumlog[n-k] - n * log(2);
double cur = exp(l - 2*log(k+1.0) - 2*log(n-k+1.0) + log(w) + log(h));
res += cur;
}
cout << res << endl;
}
}