POJ1786-Bridge Hands

问题链接

POJ1786

问题描述

花色是（梅花）<（方片）<（黑桃）<（红桃），（输入时，用C,D,S,H分别表示梅花，方片，黑桃，红桃，即其单词首字母）。对于牌面的值，规定2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < T < J < Q < K < A。
从小到大排序每个人手中的牌，并按照给定格式输出。

思路

• 静态数组分别存储花色和牌面值，用下标进行比较。
• 可以采取取模的方式进行发牌。
• 使用sort排序

代码

#include <iostream>
#include<stdio.h>
#include<algorithm>
using namespace std; 

/* run this program using the console pauser or add your own getch, system("pause") or input loop */
char que[]={'2','3','4','5','6','7','8','9','T','J','Q','K','A'};
char flower[]={'C','D','S','H'};
int find1(char temp)
{
	for(int i=0;i<13;i++)
	{
		if(temp==que[i])
		return i;
	}
	return -1;
}
int find2(char temp)
{
	for(int i=0;i<4;i++)
	{
		if(temp==flower[i])
		return i;
	}
	return -1;
}
struct p
{
	char num;
	char kind;	
	bool operator<(const p &b)
	{
		if(kind!=b.kind)
		{
			return find2(kind)<find2(b.kind);
		}
		return find1(num)<find1(b.num);
	}
};
void output(p* k,int size)
{
	printf("+---+---+---+---+---+---+---+---+---+---+---+---+---+\n");
	for(int i=0;i<size;i++)
	{
		printf("|%c %c",k[i].num,k[i].num);
	}
	printf("|\n");
	for(int i=0;i<size;i++)
	{
		printf("| %c ",k[i].kind);
	}
	printf("|\n");
	for(int i=0;i<size;i++)
	{
		printf("|%c %c",k[i].num,k[i].num);
	}
	printf("|\n");
	printf("+---+---+---+---+---+---+---+---+---+---+---+---+---+\n");
}
int main(int argc, char** argv) {
	while(1)
	{
	char begin;
	cin>>begin;
	if(begin=='#')return 0;
	char sign,number,temp;
	p first[13];
	p second[13];
	p third[13];
	p forth[13];
	scanf("%c",&temp);//回车 
	for(int i=0;i<52;i++)
	{
		scanf("%c",&sign);
		if(sign=='\n')
		{
			scanf("%c",&sign);
		}
		scanf("%c",&number);
		if(i%4==0)
		{
			first[i/4].num=number; 
			first[i/4].kind=sign;
		} 
    	else if(i%4==1)
		{
			second[i/4].num=number;
			second[i/4].kind=sign;
		} 
		else if(i%4==2)
		{
			third[i/4].num=number;
			third[i/4].kind=sign;
		}
		else if(i%4==3)
		{
			forth[i/4].num=number;
			forth[i/4].kind=sign;
		} 
		
	}
	
	sort(first,first+13);
	sort(second,second+13);
	sort(third,third+13);
	sort(forth,forth+13);
	
    if(begin=='N')
    {   printf("South player:\n");
    	output(second,13);
    	printf("West player:\n");
    	output(third,13);
    	printf("North player:\n");
    	output(forth,13);
    	printf("East player:\n");
    	output(first,13);
	}
	
	if(begin=='W')
    {
    	printf("South player:\n");
    	output(third,13);
    	printf("West player:\n");
    	output(forth,13);
    	printf("North player:\n");
    	output(first,13);
    	printf("East player:\n");
		output(second,13);
	}
	
	if(begin=='E')
    {
    	printf("South player:\n");
	    output(first,13);
	    printf("West player:\n");
    	output(second,13);
    	printf("North player:\n");
    	output(third,13);
    	printf("East player:\n");
    	output(forth,13);
	}
	
	if(begin=='S')
    {
    	printf("South player:\n");
    	output(forth,13);
    	printf("West player:\n");
    	output(first,13);
    	printf("North player:\n");
    	output(second,13);
    	printf("East player:\n");
    	output(third,13);
	}
    printf("\n");
	}
}