https://cn.vjudge.net/problem/Gym-102222D
第二问:他第i个进前面就排好的,而由第一问都是0.5;而他最后概率是1;(m-1)/m是他不是最后概率,1/m是他最后概率;
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int cas=0;
int T;
scanf("%d",&T);
while(T--)
{
double n,m;
scanf("%lf%lf",&n,&m);
double ans1=0,ans2=0;
if(n==1)
{
ans1=1;
}
else ans1=1.0/2.0;
if(m==1)
{
ans2=1;
}
else
{
ans2=(1.0*(1.0/m)+(m-1)/m*0.5);
}
printf("Case #%d: %.6lf %.6lf\n",++cas,ans1,ans2);
}
return 0;
}