思路:在天数无限的情况下忽略鹿的影响,直接计算老虎相遇的概率
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
int main () {
int t;
scanf ( "%d", &t );
for ( int cas = 1; cas <= t; cas++ ) {
int ti,de;
scanf ( "%d%d", &ti, &de );
if ( ti & 1 )
printf ( "Case %d: 0\n", cas );
else {
double ans = 1.0;
for ( int tt = ti; tt >= 2; tt -= 2 ) {
ans *= double ( tt ) * double ( tt-1 ) / (double ( tt+1 ) * double ( tt ));
}
printf ( "Case %d: %lf\n", cas, ans );
}
}
return 0;
}