pku1217.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#include <string.h>

double ans[20][121];
double sum, tmp;

int toPos(int x)
{
	return x + 60;
}

const int v[6] = {-3, -1, 0, 1, 2, 3};
const double p[6] = { 1,  2, 6, 4, 2, 1};

int main()
{
	int i, j, k;
	memset(ans, 0, sizeof(ans));
	for (i = 0; i < 6; i++)
	    ans[0][toPos(v[i])] = p[i];
	for (j = 0; j < 19; j++)
	{
		for (i = 0; i <= 120; i++)
		{
			if (ans[j][i] != 0)
			{
				for (k = 0; k < 6; k++)
				ans[j + 1][i + v[k]] += ans[j][i] * p[k];
			}
		}
	}
	printf("Round   A wins    B wins    Tie\n");
	for (j = 0; j < 20; j++)
	{
		sum = 0;
		for (i = 0; i <= 120; i++)
		    sum += ans[j][i];
		tmp = 0;
		for (i = 61; i <= 120; i++)
			tmp += ans[j][i];
		printf("%5d%10.4lf%%", j + 1, tmp * 100 / sum);
		tmp = 0;
		for (i = 0; i < 60; i++)
		    tmp += ans[j][i];
		printf("%9.4lf%%", tmp * 100 / sum);
		tmp = ans[j][60];
		printf("%9.4lf%%\n", tmp * 100 / sum);
	}
	return 0;
}