Poker Time

版权声明:由陈庚汝编辑 https://blog.csdn.net/ChenGengru/article/details/84641339

在这里插入图片描述

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
/* Poker Time */
/* written by Chen Gengru */
/* updated on 2018-11-22 */
int main()
{
	char A[3][2];
	char B[3][2];
	int i, j, iTemp1, iTemp2;
	char cTemp1, cTemp2;
	
	for (i = 0; i < 3; i++)
	{
		scanf("%c%c", &A[i][0], &A[i][1]);
		getchar( );
	}
	for (i = 0; i < 3; i++)
	{
		scanf("%c%c", &B[i][0], &B[i][1]);
		getchar( );
	}
	
	int AA[3][2];
	for (i = 0; i <3; i++)    // 赋值数组AA // 
	{
		if (A[i][0] == 'H')
		{
			AA[i][0] = 4; 
		}
		
		if (A[i][0] == 'S')
		{
			AA[i][0] = 3;
		}
		
		if (A[i][0] == 'D')
		{
			AA[i][0] = 2;
		}
		
		if (A[i][0] == 'C')
		{
			AA[i][0] = 1;
		}
		
		switch(A[i][1])
		{
			case '2':
				AA[i][1] = 1;
				break;
			case '3':
				AA[i][1] = 2;
				break;
			case '4':
				AA[i][1] = 3;
				break;
			case '5':
				AA[i][1] = 4;
				break;
			case '6':
				AA[i][1] = 5;
				break;
			case '7':
				AA[i][1] = 6;
				break;
			case '8':
				AA[i][1] = 7;
				break;
			case '9':
				AA[i][1] = 8;
				break;
			case 'J':
				AA[i][1] = 10;
				break;
			case 'Q':
				AA[i][1] = 11;
				break;
			case 'K':
				AA[i][1] = 12;
				break;
			case 'A':
				AA[i][1] = 13;
				break;
			default:
				AA[i][1] = 9;
				break;
		}
	}
	
	int BB[3][2];
	for (i = 0; i <3; i++)    // 赋值数组BB // 
	{
		if (B[i][0] == 'H')
		{
			BB[i][0] = 4; 
		}
		
		if (B[i][0] == 'S')
		{
			BB[i][0] = 3;
		}
		
		if (B[i][0] == 'D')
		{
			BB[i][0] = 2;
		}
		
		if (B[i][0] == 'C')
		{
			BB[i][0] = 1;
		}
		
		switch(B[i][1])
		{
			case '2':
				BB[i][1] = 1;
				break;
			case '3':
				BB[i][1] = 2;
				break;
			case '4':
				BB[i][1] = 3;
				break;
			case '5':
				BB[i][1] = 4;
				break;
			case '6':
				BB[i][1] = 5;
				break;
			case '7':
				BB[i][1] = 6;
				break;
			case '8':
				BB[i][1] = 7;
				break;
			case '9':
				BB[i][1] = 8;
				break;
			case 'J':
				BB[i][1] = 10;
				break;
			case 'Q':
				BB[i][1] = 11;
				break;
			case 'K':
				BB[i][1] = 12;
				break;
			case 'A':
				BB[i][1] = 13;
				break;
			default:
				BB[i][1] = 9;
				break;
		}
	}
	
	for (i = 0; i < 3; i++)
	{
		if ((A[i][0] != 'H') && (A[i][0] != 'D') && (A[i][0] != 'C') && (A[i][0] != 'S'))
		{
			printf("Input Error!\n");
			return 0;
		}
		
		if ((A[i][1] != '1') && (A[i][1] != '2') && (A[i][1] != '3') && (A[i][1] != '4') && (A[i][1] != '5') && (A[i][1] != '6') && (A[i][1] != '7') && (A[i][1] != '8') && (A[i][1] != '9') && (A[i][1] != 'A') && (A[i][1] != 'J') && (A[i][1] != 'Q') && (A[i][1] != 'K'))
		{
			printf("Input Error!\n");
			return 0;
		}
		
		if ( i < 2)
		{
			if ((AA[i][0] == AA[i+1][0] && AA[i][1] == AA[i+1][1]))
			{
			printf("Input Error!\n");
			return 0;
		}
		}
	}
	
	for (i = 0; i < 3; i++)
	{
        if ((B[i][0] != 'H') && (B[i][0] != 'D') && (B[i][0] != 'C') && (B[i][0] != 'S'))
		{
			printf("Input Error!\n");
			return 0;
		}
		
		if ((B[i][1] != '1') && (B[i][1] != '2') && (B[i][1] != '3') && (B[i][1] != '4') && (B[i][1] != '5') && (B[i][1] != '6') && (B[i][1] != '7') && (B[i][1] != '8') && (B[i][1] != '9') && (B[i][1] != 'A') && (B[i][1] != 'J') && (B[i][1] != 'Q') && (B[i][1] != 'K'))
		{
			printf("Input Error!\n");
			return 0;
		}
		
		if (i < 2)
		{
			if (BB[i][0] == BB[i+1][0] && BB[i][1] == BB[i+1][1])
			{
			printf("Input Error!\n");
			return 0;
		}
		}
	}
	
	for (i = 0; i < 2; i++)      // 比大小 //
	{
		for (j = i; j < 2; j++)
		if ((AA[j][0] < AA[j+1][0]) || (AA[j][0] == AA[j+1][0] && (AA[j][1] < AA[j+1][1])))
		{
			cTemp1 = A[j][0];
			cTemp2 = A[j][1];
			A[j][0] = A[j+1][0];
			A[j][1] = A[j+1][1];
			A[j+1][0] = cTemp1;
			A[j+1][1] = cTemp2;
			
			iTemp1 = AA[j][0];
			iTemp2 = AA[j][1];
			AA[j][0] = AA[j+1][0];
			AA[j][1] = AA[j+1][1];
			AA[j+1][0] = iTemp1;
			AA[j+1][1] = iTemp2;
		}
	 }
	
	for (i = 0; i < 2; i++)      // 比大小 //
	{
		for (j = i; j < 2; j++)
		if ((BB[j][0] < BB[j+1][0]) || (BB[j][0] == BB[j+1][0] && (BB[j][1] < BB[j+1][1])))
		{
			cTemp1 = B[j][0];
			cTemp2 = B[j][1];
			B[j][0] = B[j+1][0];
			B[j][1] = B[j+1][1];
			B[j+1][0] = cTemp1;
			B[j+1][1] = cTemp2;
			
			iTemp1 = BB[j][0];
			iTemp2 = BB[j][1];
			BB[j][0] = BB[j+1][0];
			BB[j][1] = BB[j+1][1];
			BB[j+1][0] = iTemp1;
			BB[j+1][1] = iTemp2;
		}
	 }
	 
	for (i = 0; i < 3; i++)
	{
		if ((AA[i][0] > BB[i][0]) || (AA[i][0] == BB[i][0] && AA[i][1] > BB[i][1]))
		{
			printf("Winner is A!\n");
			break;
		}
		if ((AA[i][0] < BB[i][0]) || (AA[i][0] == BB[i][0] && AA[i][1] < BB[i][1]))
		{
			printf("Winner is B!\n");
			break;
		}
		if (AA[2][0] == BB[2][0] && AA[2][1] == BB[2][1]) 
		{
			printf("Winner is X!\n");
			break;
		}
	}
	
	printf("A: ");
	for (i = 0; i < 3; i++)
	{
		printf("%c%c", A[i][0], A[i][1]);
		if (A[i][1] == '1')
		{
			printf("0");
		}
		if (i < 2)
		{
		printf(" ");
     	}
	}
	printf("\n");
	
	printf("B: ");
	for (i = 0; i < 3; i++)
	{
		printf("%c%c", B[i][0], B[i][1]);
		if (B[i][1] == '1')
		{
			printf("0");
		}
		if (i < 2)
		{
		printf(" ");
	    }
	}
	printf("\n");
	
	return 0;
}

在这里插入图片描述
在这里插入图片描述

猜你喜欢

转载自blog.csdn.net/ChenGengru/article/details/84641339