4128888_ac_63ms_220k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <ctype.h>

int cnt[14];
int v[] = {0, 11, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10};

int getMark(char ch)
{
	if (ch == 'A')
	{
		return 11;
	}
	if (isalpha(ch))
	{
		return 10;
	}
	return ch - '0';
}

void de(char ch)
{
	if (ch == 'A')
	{
		cnt[1]--;
	}
	if (ch == 'T')
	{
		cnt[10]--;
	}
	if (ch == 'J')
	{
		cnt[11]--;
	}
	if (ch == 'Q')
	{
		cnt[12]--;
	}
	if (ch == 'K')
	{
		cnt[13]--;
	}
	if (isalnum(ch))
	{
		cnt[ch - '0']--;
	}
}

int main()
{
	int n, i;
	char a[2], b[2], c[2];
	double base, p;

	while (scanf("%d", &n) == 1 && n)
	{
		base = 52 * n - 3;
		for (i = 1; i <= 13; i++)
		{
			cnt[i] = 4 * n;
		}
		scanf("%s%s%s", c, a, b);
		de(a[0]);de(b[0]);de(c[0]);
		int dealer, me;
		if (a[0] == 'A' && b[0] == 'A')
		{
			me = 12;
		}
		else
		{
			me = getMark(a[0]) + getMark(b[0]);
		}
		dealer = getMark(c[0]);
		p = 0;
		if (c[0] != 'A')
		{
			for (i = 1; i <= 13; i++)
			{
				if (me  > dealer + v[i])
				{
					p += cnt[i];
				}
			}
		}
		else
		{
			for (i = 2; i <= 13; i++)
			{
				if (me > dealer + v[i])
				{
					p += cnt[i];
				}
			}
			if (me > 12)
			{
				p += cnt[1];
			}
		}
		printf("%.3lf%%\n\n", p * 100.0 / base);
	}
	return 0;
}