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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83
|
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <cmath>
using namespace std;
int rand_0toN1(int n);
void draw_a_card();
int select_next_available(int n);
bool card_drawn[52];
int cards_remaining = 52;
char *suits[4] =
{"hearts", "diamonds", "spades", "clubs"};
char *ranks[13] =
{"Ace", "two", "three", "four", "five",
"six", "seven", "eight", "nine",
"ten", "jack", "queen", "king"};
int main()
{
int n, i;
srand(time(NULL));
while (1)
{
cout << "enter number of cards to draw (0 to exit): ";
cin >> n;
if (n == 0)
break;
for (i = 1; i <= n; i++)
draw_a_card();
}
return 0;
}
// Draw-a-card function
// Perform a card draw by getting a random 0-4 and a
// random 0-12. Use these to index the strings
// arrays, ranks and suits.
//
void draw_a_card()
{
int r; // Random index (o thru 12) into ranks array
int s; // Random index (o thru 3) into suits array
int n, card;
n = rand_0toN1(cards_remaining--);
card = select_next_available(n);
r = card % 13; // r = random 0 to 12
s = card / 13; // s = random 0 to 3
cout << ranks[r] << " of " << suits[s] << endl;
}
// Select-next-available-card function.
// Find the Nth element of card_drawn, skipping over
// those elements already set to true.
//
int select_next_available(int n)
{
int i = 0;
while (card_drawn[i])
i++;
//while (n-- > 0)
//{
// i++;
// while (card_drawn[i])
// i++;
//}
card_drawn[i] = true;
return i;
}
int rand_0toN1(int n)
{
return rand() % n;
}
|