概率dp+高斯消元:https://www.cnblogs.com/jiachinzhao/p/7204458.html
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const double eps=1e-6;
const int N=100+10;
int f[N];
double a[N][N];
int gauss(int n,int m)
{
int col,row,mxr;
for(row=col=1;row<=n&&col<=m;row++,col++)
{
mxr=row;
for(int i=row+1;i<=n;i++)
if(fabs(a[i][col])>fabs(a[row][col]))
mxr=i;
if(mxr!=row) swap(a[row],a[mxr]);
if(fabs(a[row][col])<eps)
{
row--;
continue;
}
for(int i=1;i<=n;i++) //消成上三角矩阵
if(i!=row&&fabs(a[i][col])>eps)
for(int j=m;j>=col;j--)
a[i][j]-=a[row][j]/a[row][col]*a[i][col];
}
row--;
for(int i=row;i>=1;i--) //回代成对角矩阵
{
for(int j=i+1;j<=row;j++)
a[i][m]-=a[j][m]*a[i][j];
a[i][m]/=a[i][i];
}
return row;
}
int main()
{
int T,n,kase=0;
scanf("%d",&T);
while(T--)
{
int u,v;
memset(f,0,sizeof(f));
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d%d",&u,&v);
f[u]=v;
}
memset(a,0,sizeof(a));
for(int i=1;i<100;i++)
{
if(f[i])
{
a[i][101]=0;
a[i][i]=1;a[i][f[i]]=-1;
}
else
{
int cnt=0;
for(int j=1;j<=6&&j+i<=100;j++)
{
cnt++;
a[i][i+j]=-1;
}
a[i][i]=cnt;a[i][101]=6;
}
}
a[100][100]=1;a[100][101]=0;
gauss(100,101);
printf("Case %d: %.6f\n",++kase,a[1][101]);
}
return 0;
}