#define AceClubs 0
#define TwoClubs 1
#define ThreeClubs 2
#define FourClubs 3
#define FiveClubs 4
#define SixClubs 5
#define SevenClubs 6 
...

#define AceSpades 13
#define TwoSpades 14
#define ThreeSpades 15

...

// First I'll just create the card and hand concepts - the deck is up to you :)enum {ACE, TWO, THREE, FOUR, FIVE, SIX, SEVEN, EIGHT, NINE, TEN, JACK, QUEEN, KING, RANK_COUNT} Rank;enum {CLUB, DIAMOND, HEART, SPADE, SUIT_COUNT} Suit;const int CARD_COUNT = Rank::RANK_COUNT * Suit::SUIT_COUNT;class Card {  char id;  public:  Rank rank() { return Rank(id / SUIT_COUNT); }  Suit suit() { return Suit(id % SUIT_COUNT); }  Card(char id) : id(id) {    if (id < 0 || id >= CARD_COUNT) throw std::exception("invalid card");  }}// Trust me, this is much nicer than passing arrays around directlyconst int HAND_SIZE = 5;struct Hand { Card[HAND_SIZE] cards; }int evaluate(const Hand& hand) {  // First, detect flushes  bool isFlush = true;  Suit flushType = hand.cards[0].suit();  for (int i = 1; i < HAND_SIZE; ++i) {    if (hand.cards.suit() != flushType) isFlush = false;  }  // Now find matching cards. We will add n^2 to a "match total" for each group  // of n matching cards; this correctly ranks all hands without flushes/straights  // relative to each other. First, tally cards of each type...  int cardCounts[Rank::RANK_COUNT] = {0};  for(int i = 0; i < HAND_SIZE; ++i) {    ++cardCounts[hand.cards.rank()];  }  // Then look through the ranks and accumulate the match total. At the same  // time, we will note the lowest and highest card; this lets us detect  // straights.  int matchTotal = 0;  int minCard = Rank::RANK_COUNT;  int maxCard = -1;  for(int i = 0; i < Rank::RANK_COUNT; ++i) {    matchTotal += cardCounts * cardCounts;    if (cardCounts != 0) {      // update min and max      if (i < minCard) minCard = i;      if (i > maxCard) maxCard = i;    }  }  // A straight is a hand with no pairs, triples or quads, such that the  // match total will be 5 (1*1 for each card), and such that the min and max  // cards are 4 apart.  bool isStraight = (matchTotal == HAND_SIZE && (maxCard - minCard) == (HAND_SIZE - 1));  // Finally, flushes rank above straights, which both rank between three of a  // kind (match total 11) and full house (match total 13). Clearly we need to  // space the match totals out a little :) We'll multiply the match count by  // 2, and add appropriate values (13 and 14) for straights or flushes (which  // cannot contain any matches, so that their match counts are 5). As it  // happens, a straight flush will then have value 27 + 10 = 37, putting it  // (correctly) ahead of a four of a kind with 34 ((4*4 + 1*1) * 2).  return 2*matchTotal + (isStraight ? 13 : 0) + (isFlush ? 14 : 0);  // TODO: account for kickers. Probably better to do that in a hand vs. hand  // comparison function, which would compare the two evaluate() results first  // and then look at each card from highest to lowest in each hand.}