Universe Queen

Project Euler（54）

Posted on Sunday, June 28th, 2009 at 1:19 am by Universe Queen

Problem 54:

In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way:

* High Card: Highest value card.
* One Pair: Two cards of the same value.
* Two Pairs: Two different pairs.
* Three of a Kind: Three cards of the same value.
* Straight: All cards are consecutive values.
* Flush: All cards of the same suit.
* Full House: Three of a kind and a pair.
* Four of a Kind: Four cards of the same value.
* Straight Flush: All cards are consecutive values of same suit.
* Royal Flush: Ten, Jack, Queen, King, Ace, in same suit.

The cards are valued in the order:
2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.

If two players have the same ranked hands then the rank made up of the highest value wins; for example, a pair of eights beats a pair of fives (see example 1 below). But if two ranks tie, for example, both players have a pair of queens, then highest cards in each hand are compared (see example 4 below); if the highest cards tie then the next highest cards are compared, and so on.

Consider the following five hands dealt to two players:
Hand Player 1 Player 2 Winner
1 5H 5C 6S 7S KD
Pair of Fives
2C 3S 8S 8D TD
Pair of Eights
Player 2
2 5D 8C 9S JS AC
Highest card Ace
2C 5C 7D 8S QH
Highest card Queen
Player 1
3 2D 9C AS AH AC
Three Aces
3D 6D 7D TD QD
Flush with Diamonds
Player 2
4 4D 6S 9H QH QC
Pair of Queens
Highest card Nine
3D 6D 7H QD QS
Pair of Queens
Highest card Seven
Player 1
5 2H 2D 4C 4D 4S
Full House
With Three Fours
3C 3D 3S 9S 9D
Full House
with Three Threes
Player 1

The file, poker.txt, contains one-thousand random hands dealt to two players. Each line of the file contains ten cards (separated by a single space): the first five are Player 1’s cards and the last five are Player 2’s cards. You can assume that all hands are valid (no invalid characters or repeated cards), each player’s hand is in no specific order, and in each hand there is a clear winner.

How many hands does Player 1 win?

Answer: 376

Implementation in Java:

import java.io.BufferedReader;
import java.io.FileReader;
import java.math.*;
 
public class Euler54 
{
	public static BigInteger winValue( String[] p )
	{
		BigInteger value = BigInteger.valueOf(0);
		int[] number = new int[p.length];
 
		for( int i=0; i<number.length; i++ )
		{
			if( p[i].charAt(0) >= '2' && p[i].charAt(0) <= '9' )
			{
				number[i] = p[i].charAt(0) - '0';
			}else if( p[i].charAt(0) == 'A' )
			{
				number[i] = 14;
			}else if( p[i].charAt(0) == 'T' )
			{
				number[i] = 10;
			}
			else if( p[i].charAt(0) == 'J' )
			{
				number[i] = 11;
			}
			else if( p[i].charAt(0) == 'Q' )
			{
				number[i] = 12;
			}
			else if( p[i].charAt(0) == 'K' )
			{
				number[i] = 13;
			}
		}
 
		for( int i=0; i<number.length-1; i++ )
		{
			for( int j=0; j<number.length-i-1; j++ )
			{
				if( number[j] < number[j+1] )
				{
					int tmp = number[j];
					number[j] = number[j+1];
					number[j+1] = tmp;
				}
			}
		}
 
		if( isSameSuit(p) && isConsecutive(number) && number[0] == 10 )
		{
			value = value.add( BigInteger.valueOf(1000000000000000l).multiply( BigInteger.valueOf(number[0]) ) );
		}
 
		if( isSameSuit(p) && isConsecutive(number) )
		{
			value = value.add( BigInteger.valueOf(100000000000000l).multiply( BigInteger.valueOf(number[0]) ) );
		}
 
		if( isSame4(number) > 0 )
		{
			value = value.add( BigInteger.valueOf(10000000000000l).multiply( BigInteger.valueOf(isSame4(number)) ) );
		}
 
		if( isSame3(number) > 0 && isSame2(number) > 0 )
		{
			value = value.add( BigInteger.valueOf(1000000000000l).multiply( BigInteger.valueOf(isSame3(number)) ) );
			value = value.add( BigInteger.valueOf(100000000000l).multiply( BigInteger.valueOf(isSame2(number)) ) );
		}
 
		if( isSameSuit(p) )
		{
			value = value.add( BigInteger.valueOf(10000000000l).multiply( BigInteger.valueOf( number[0] ) ) );
		}
 
		if( isConsecutive(number) )
		{
			value = value.add( BigInteger.valueOf(1000000000).multiply( BigInteger.valueOf( number[0] ) ) );
		}
 
		if( isSame3(number) > 0 )
		{
			value = value.add( BigInteger.valueOf( 100000000*isSame3(number) ) );
		}
 
		if( is2DifPairs(number) > 0 )
		{
			value = value.add( BigInteger.valueOf( 1000000*is2DifPairs(number) ) );
		}
 
		if( isSame2(number) > 0 )
		{
			value = value.add( BigInteger.valueOf( 100000*isSame2(number) ) );
		}
 
		value = value.add( BigInteger.valueOf( number[0]*10000 + number[1]*1000 + number[2]*100 + + number[3]*10 + number[4] ) );
 
		return value;
	}
 
	public static int is2DifPairs( int[] number )
	{
		if( isSame4(number) > 0 )
		{
			return -1;
		}
 
		if( isSame3(number) > 0 )
		{
			return -1;
		}
 
		int[] p = new int[2];
		int counter = 0;
		int result;
 
		for( int i=0; i<number.length-1; i++ )
		{
			for( int j=i+1; j<number.length; j++ )
			{
				if( number[i] == number[j] )
				{
					p[counter] = number[i];
					counter++;
				}
			}
		}
 
		if( counter < 2 )
		{
			return -1;
		}
 
		if( p[0] > p[1] )
		{
			result = 10*p[0] + p[1];
		}
		else
		{
			result = 10*p[1] + p[0];
		}
 
		return result;
	}
 
	public static int isSame3( int[] number )
	{
		if( isSame4(number) > 0 )
		{
			return -1;
		}
 
		int counter = 0;
 
		for( int i=0; i<3; i++ )
		{
			counter = 0;
 
			for( int j=i+1; j<number.length; j++ )
			{
				if( number[i] == number[j] )
				{
					counter++;
 
					if( counter >= 2 )
					{
						return number[i];
					}
				}
			}
		}
 
		return -1;
	}
 
	public static int isSame2( int[] number )
	{
		if( isSame4(number) > 0 )
		{
			return -1;
		}
 
		if( isSame3(number) > 0 )
		{
			return -1;
		}
 
		int counter = 0;
 
		for( int i=0; i<4; i++ )
		{
			counter = 0;
 
			for( int j=i+1; j<number.length; j++ )
			{
				if( number[i] == number[j] )
				{
					counter++;
 
					if( counter >= 1 )
					{
						return number[i];
					}
				}

Tags: Project Euler
Posted in Project Euler | Permanent Link to " Project Euler（54） "

This entry was posted on Sunday, June 28th, 2009 at 1:19 am and is filed under Project Euler . You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.