随机程序（数学期望，高斯约当消元法）

const int N = 105;
double A[N][N];
int n;
void gauss_jordan()
{
	f(i, 0, n - 1)
	{
		int r = i;
		f(j, i + 1, n - 1)
			if (fabs(A[j][i]) > fabs(A[r][i]))r = j;
		if (fabs(A[r][i]) < eps)continue;
		if (r != i)f(j, 0, n)swap(A[r][j], A[i][j]);
		f(k, 0, n - 1)
			if (k != i)ff(j, n, i)A[k][j] -= A[k][i] / A[i][i] * A[i][j];
	}
}
vector<int> G[N];
int d[N];
int if_inf[N];
int main()
{
	//freopen("in.txt", "r", stdin);
	int cas = 0;
	while (scanf("%d",&n)==1&&n)
	{
		memset(d, 0, sizeof d);
		f(i, 0, n)G[i].clear();
		int x, y;
		while (scanf("%d%d", &x, &y) == 2 && x)
		{
			x--, y--;
			G[y].emplace_back(x);//记录前驱来计算期望
			d[x]++;
		}
		memset(A, 0, sizeof A);
		f(i, 0, n - 1)
		{
			if (i == 0)A[0][n] = 1;
			A[i][i] = 1;
			for (auto I : G[i])
			{
				int pre_son = d[I];//前驱点的孩子
				A[i][I] -= 1.0 / pre_son;
			}
		}
		gauss_jordan();
		memset(if_inf, 0, sizeof if_inf);
		ff(i, n - 1, 0)
		{
			if (fabs(A[i][i]) < eps&&fabs(A[i][n]) > eps)if_inf[i] = 1;
			f(j, i + 1, n - 1)
				if (fabs(A[i][j]) > eps&&if_inf[j] == 1)if_inf[i] = 1;
			//和无穷变量扯上关系的变量也是无穷的
		}
		int q = in();
		printf("Case #%d:\n", ++cas);
		while (q--)
		{
			int x = in();x--;
			if (if_inf[x] == 1)puts("infinity");
			else printf("%.3lf\n", A[x][x]<eps?0.0:A[x][n] / A[x][x]);
		}
	}
	return 0;
}