Talsu.net :: Programming Challenges - 포커 패 (Poker Hands)

Study/Programming Challenges2009/10/12 02:01

Programming Challenges - 포커 패 (Poker Hands)

문제 <- 클릭

별로 어렵진 않은데 시간이 많이 걸리는 예제 였다. 입출력이 까답롭지 않아서 인지 금방 성공 하긴 했지만 시간 날때 좀더 다듬고 싶다.

#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <cmath>
#include <algorithm>

struct _Card {
	int pattern;
	int value;
	bool operator==(const _Card& rhs) {
		return (*this).value == rhs.value;
	}
};

typedef struct _Card Card;
typedef std::vector<Card> CardSet;

class CompareValue {
public:
	bool operator()(const Card& lhs, const Card& rhs) {
		return lhs.value > rhs.value;
	}
};

class PokerCardSet {
private:
	enum {
		CLUB,
		DIAMOND,
		HEART,
		SPADE,
		TEN = 10,
		JACK = 11,
		QUEEN = 12,
		KING = 13,
		ACE = 14
	};
	enum {
		BLACK, WHITE
	};

CardSet cardSet;
	int score;

void setCard(char value, char pattern) {
		Card card;
		switch (pattern) {
		case 'C':
			card.pattern = CLUB;
			break;
		case 'D':
			card.pattern = DIAMOND;
			break;
		case 'H':
			card.pattern = HEART;
			break;
		case 'S':
			card.pattern = SPADE;
			break;
		default:
			card.pattern = pattern - '0';
			break;
		}

switch (value) {
		case 'T':
			card.value = TEN;
			break;
		case 'J':
			card.value = JACK;
			break;
		case 'Q':
			card.value = QUEEN;
			break;
		case 'K':
			card.value = KING;
			break;
		case 'A':
			card.value = ACE;
			break;
		default:
			card.value = value - '0';
			break;
		}
		cardSet.push_back(card);
	}

int highCard() {
		return score = highCard(cardSet);
	}

int highCard(CardSet& cardSet) {
		std::sort(cardSet.begin(), cardSet.end(), CompareValue());
		int sumCardValue = 0;
		int digit = 0;
		for (CardSet::reverse_iterator it = cardSet.rbegin(); it
				!= cardSet.rend(); ++it) {
			sumCardValue += (*it).value * std::pow((double) 15,
					(double) digit++);
		}
		return sumCardValue;
	}

int onePair() {
		int compareCounter = 0;
		Card currentCard;
		int pairCounter = 0;
		CardSet diffrentSet;
		CardSet sameSet;
		CardSet returnCardSet;
		std::sort(cardSet.begin(), cardSet.end(), CompareValue());

for (CardSet::iterator it1 = cardSet.begin(); it1 != cardSet.end(); ++it1) {
			compareCounter = 0;
			currentCard = *it1;
			for (CardSet::iterator it2 = cardSet.begin(); it2 != cardSet.end(); ++it2) {
				if (*it1 == *it2)
					++compareCounter;
			}

if (compareCounter == 2) {
				sameSet.push_back(currentCard);
				pairCounter++;
			} else if (compareCounter == 1) {
				diffrentSet.push_back(currentCard);
			}
		}
		diffrentSet.insert(diffrentSet.begin(), sameSet.begin(), sameSet.end());

if (pairCounter == 2)
			return score = 2000000 + highCard(diffrentSet);
		else
			return 0;
	}

int twoPair() {
		int compareCounter = 0;
		Card currentCard;
		int pairCounter = 0;
		CardSet returnCardSet;
		std::sort(cardSet.begin(), cardSet.end(), CompareValue());
		Card diffrentCard;

for (CardSet::iterator it1 = cardSet.begin(); it1 != cardSet.end(); ++it1) {
			compareCounter = 0;
			for (CardSet::iterator it2 = cardSet.begin(); it2 != cardSet.end(); ++it2) {
				if (*it1 == *it2) {
					++compareCounter;
					currentCard = *it1;
				} else {
					diffrentCard = *it1;
				}
			}
			if (compareCounter == 2) {
				returnCardSet.push_back(currentCard);
				pairCounter++;
			}
		}
		returnCardSet.push_back(diffrentCard);

if (pairCounter == 4)
			return score = 3000000 + highCard(returnCardSet);
		else
			return 0;
	}

int threeOfAKind() {
		int compareCounter = 0;
		int currentCard = 0;
		for (CardSet::iterator it1 = cardSet.begin(); it1 != cardSet.end(); ++it1) {
			compareCounter = 0;
			currentCard = (*it1).value;
			for (CardSet::iterator it2 = cardSet.begin(); it2 != cardSet.end(); ++it2) {
				if (*it1 == *it2)
					++compareCounter;
			}
			if (compareCounter == 3) {
				return score = 4000000 + currentCard;
			}
		}
		return 0;
	}

int straight() {
		std::sort(cardSet.begin(), cardSet.end(), CompareValue());
		CardSet::iterator it;
		it = cardSet.begin();
		int value = (*it++).value;
		int bigCard = value;
		for (; it != cardSet.end(); ++it) {
			if (--value != (*it).value)
				return 0;
		}
		return score = 5000000 + bigCard;
	}

int flush() {
		CardSet::iterator it;
		it = cardSet.begin();
		int pattern = (*it++).pattern;
		for (; it != cardSet.end(); ++it) {
			if (pattern != (*it).pattern)
				return 0;
		}
		return score = 6000000 + highCard(cardSet);
	}

int fullHouse() {
		int threeCard = 0;
		int twoCard = 0;
		int compareCounter = 0;
		int currentCard = 0;
		for (CardSet::iterator it1 = cardSet.begin(); it1 != cardSet.end(); ++it1) {
			compareCounter = 0;
			currentCard = (*it1).value;
			for (CardSet::iterator it2 = cardSet.begin(); it2 != cardSet.end(); ++it2) {
				if (*it1 == *it2) {
					++compareCounter;

}
			}
			if (compareCounter == 3) {
				threeCard = currentCard;
			}
			if (compareCounter == 2) {
				twoCard = currentCard;
			}
		}

if (threeCard && twoCard)
			return score = 7000000 + threeCard;
		else
			return 0;
	}

int fourOfAKind() {

for (CardSet::iterator it1 = cardSet.begin(); it1 != cardSet.end(); ++it1) {
			int compareCounter = 0;
			int returnCard = (*it1).value;
			for (CardSet::iterator it2 = cardSet.begin(); it2 != cardSet.end(); ++it2) {
				if (*it1 == *it2)
					++compareCounter;
			}
			if (compareCounter == 4)
				return score = 8000000 + returnCard;
		}
		return 0;
	}

int straightFlush() {
		CardSet::iterator it;
		it = cardSet.begin();
		int pattern = (*it).pattern;
		for (; it != cardSet.end(); ++it) {
			if (pattern != (*it).pattern)
				return 0;
		}

std::sort(cardSet.begin(), cardSet.end(), CompareValue());

it = cardSet.begin();
		int value = (*it).value;
		int bigCard = value;
		++it;
		for (; it != cardSet.end(); ++it) {
			if (--value != (*it).value)
				return 0;
		}

return score = 9000000 + bigCard;
	}

void getScore() {

if (straightFlush())
			return;
		else if (fourOfAKind())
			return;
		else if (fullHouse())
			return;
		else if (flush())
			return;
		else if (straight())
			return;
		else if (threeOfAKind())
			return;
		else if (twoPair())
			return;
		else if (onePair())
			return;
		else if (highCard())
			return;
		else
			return;

}
public:
	PokerCardSet() :
		score(0) {
	}

PokerCardSet(std::string str) {
		setCards(str);
	}

void setCards(std::string str) {
		std::stringstream ss(str);
		std::string strCard;
		for (int i = 0; i < 5; ++i) {
			ss >> strCard;
			setCard(strCard[0], strCard[1]);
		}
		getScore();
	}

bool operator>(const PokerCardSet& rhs) {
		return (*this).score > rhs.score;
	}

bool operator<(const PokerCardSet& rhs) {
		return (*this).score < rhs.score;
	}

bool operator==(const PokerCardSet& rhs) {
		return (*this).score == rhs.score;
	}

};

class Poker {
	PokerCardSet blackSet;
	PokerCardSet whiteSet;
public:
	Poker(std::string str) {
		blackSet.setCards(str.substr(0, 14));
		whiteSet.setCards(str.substr(15, str.length()));
	}

void play() {
		if (blackSet > whiteSet)
			std::cout << "Black wins." << std::endl;
		else if (whiteSet > blackSet)
			std::cout << "White wins." << std::endl;
		else if (blackSet == whiteSet)
			std::cout << "Tie." << std::endl;
	}

};

int main() {
	std::string buffer;

while (true) {
		std::getline(std::cin, buffer);
		if (buffer.empty())
			break;
		Poker poker(buffer);
		poker.play();
	}
}

크리에이티브 커먼즈 라이선스

이 저작물은 크리에이티브 커먼즈 코리아 저작자표시-비영리-동일조건변경허락 2.0 대한민국 라이선스에 따라 이용하실 수 있습니다.

'Study > Programming Challenges' 카테고리의 다른 글

Programming Challenges - 작은 비숍(Little Bishops) (0)	2009/10/15
Programming Challenges - 동맹 휴업 (Hartal) (1)	2009/10/12
Programming Challenges - 포커 패 (Poker Hands) (0)	2009/10/12
Programming Challenges - 유쾌한 점퍼(Jolly Jumpers) (0)	2009/10/11
Programming Challenges - 호주식 투표법(Australian Voting) (0)	2009/10/08
Programming Challenges - 체크 확인 (Check the Check) (1)	2009/10/05

Posted by 탈수

TAG Algorithm, poker, Programming Challenges, stl, 알고리즘, 포커

Trackback 0 Comment 0

«이전 1 ... 6 7 8 9 10 11 12 13 14 ... 98 다음»

일	월	화	수	목	금	토
				1	2	3
4	5	6	7	8	9	10
11	12	13	14	15	16	17
18	19	20	21	22	23	24
25	26	27	28	29	30	31

태터데스크 관리자

태터데스크 메시지

Talsu.net

Programming Challenges - 포커 패 (Poker Hands)

'Study > Programming Challenges' 카테고리의 다른 글

TRACKBACK http://talsu.net/trackback/124

카테고리

공지사항

태그목록

최근에 올라온 글

최근에 달린 댓글

최근에 받은 트랙백

글 보관함

달력

링크