#include <stdio.h>

void exit(int);

struct Card{ 
    char rank;
    char suit;
   };
struct Stack{
    struct Card card[13];
    int top;
   };
const int n=52;
struct Stack piles[4];
struct Card deck[52];


int main()
{ void Push(int, struct Card);
  int currentgame, done;
  int Empty(int);
  struct Card Pop(int);
  void ClearStack(int);
  void ClearPiles();
  void Deck2Pile();
  void ReadDeck();
  void PrintOutcome();
  void PrintAll();
  struct Card tempcard;

  ReadDeck();
  ClearPiles();
  Deck2Pile();
  currentgame = 1;
  while(!done || currentgame > 52)
   { //...
    PrintOutcome();
   }
  return 0;
}


int Map(struct Card card)
{ int temp;
  
  switch(card.rank) {
    case('T'): temp=10; break;
    case('J'): temp=11; break; 
    case('Q'): temp=12; break; 
    case('K'): temp=13; break; 
    case('A'): temp=14; break; 
    default:   temp=card.rank-'0';
   }
  return temp;
}

void ReadDeck()
{  int i;
   for (i=0; i<n; i++)
    { deck[i].rank = getchar();
      deck[i].suit = getchar();
      printf("Just read %c %c \n", deck[i].rank, deck[i].suit);
      if('\n' != getchar()) exit(1);
    };
   return;
}

void ClearPiles()
{ int i;
  void ClearStack(int);
  for (i=0; i<4; i++)
      ClearStack(i);
  printf("Done ClearPiles\n");
}

void ClearStack(int i)
{ piles[i].top = -1;
}

void Deck2Pile()
{ //...
}

int Empty(int i)
{ //...
}

void Push(int i, struct Card newcard)
{ piles[i].top++;
  piles[i].card[piles[i].top] = newcard;
  return;
}

struct Card Pop(int i)
{ //...
}

void PrintOutcome()
{ // ...
}