uva127 "Accordian" Patience

 ``Accordian'' Patience 

You are to simulate the playing of games of ``Accordian'' patience, the rules for which are as follows:

Deal cards one by one in a row from left to right, not overlapping. Whenever the card matches its immediate neighbour on the left, or matches the third card to the left, it may be moved onto that card. Cards match if they are of the same suit or same rank. After making a move, look to see if it has made additional moves possible. Only the top card of each pile may be moved at any given time. Gaps between piles should be closed up as soon as they appear by moving all piles on the right of the gap one position to the left. Deal out the whole pack, combining cards towards the left whenever possible. The game is won if the pack is reduced to a single pile.

Situations can arise where more than one play is possible. Where two cards may be moved, you should adopt the strategy of always moving the leftmost card possible. Where a card may be moved either one position to the left or three positions to the left, move it three positions.

Input

Input data to the program specifies the order in which cards are dealt from the pack. The input contains pairs of lines, each line containing 26 cards separated by single space characters. The final line of the input file contains a # as its first character. Cards are represented as a two character code. The first character is the face-value (A=Ace, 2-9, T=10, J=Jack, Q=Queen, K=King) and the second character is the suit (C=Clubs, D=Diamonds, H=Hearts, S=Spades).

Output

One line of output must be produced for each pair of lines (that between them describe a pack of 52 cards) in the input. Each line of output shows the number of cards in each of the piles remaining after playing ``Accordian patience'' with the pack of cards as described by the corresponding pairs of input lines.

Sample Input

QD AD 8H 5S 3H 5H TC 4D JH KS 6H 8S JS AC AS 8D 2H QS TS 3S AH 4H TH TD 3C 6S
8C 7D 4C 4S 7S 9H 7C 5D 2S KD 2D QH JD 6D 9D JC 2C KH 3D QC 6C 9S KC 7H 9C 5C
AC 2C 3C 4C 5C 6C 7C 8C 9C TC JC QC KC AD 2D 3D 4D 5D 6D 7D 8D TD 9D JD QD KD
AH 2H 3H 4H 5H 6H 7H 8H 9H KH 6S QH TH AS 2S 3S 4S 5S JH 7S 8S 9S TS JS QS KS
#

Sample Output

6 piles remaining: 40 8 1 1 1 1
1 pile remaining: 52

三相链表实现

#include<stdio.h> #include<stdlib.h> #define LOCAL typedef struct node{ char rank; char suit; int count; struct node *pre; struct node *next; struct node *bottom; }peil; int main() { #ifdef LOCAL freopen("Test Date.txt","r",stdin); freopen("Test Result.txt","w",stdout); #endif peil *head,*tail,*p,*sq,*w; char ch; char str[3]; int i,flag,xx,yy; head = (peil *)malloc(sizeof(peil)); tail = (peil *)malloc(sizeof(peil)); head->pre = NULL; tail->pre = head; head->next = tail; tail->next = NULL; head->bottom = tail->bottom = NULL; while(scanf("%s",str)&&strcmp(str,"#")) //链表中填充数据 { p = (peil *)malloc(sizeof(peil)); p->rank = str[0]; p->suit = str[1]; p->pre = head; p->count= 1; p->bottom = NULL; head->next = p; tail->pre = p; p->next = tail; for(i = 1;i < 52; i++) { scanf("%s",str); sq = (peil *)malloc(sizeof(peil)); sq->rank = str[0]; sq->suit = str[1]; sq->count= 1; sq->pre = p; sq->bottom = NULL; p ->next = sq; tail->pre= sq; sq->next = tail; p = sq; } p = head->next; yy = 1; while(1) { if(yy) //一个节点游戏结束 { p = p->next; if(p == tail) break; } yy = 1; flag = 0; if(p->pre==head&&!flag) continue; if(p->pre->pre==head&&!flag) flag = 1; if(p->pre->pre->pre==head&&!flag) flag = 1; if(flag) //左边三点不可能存在的情况 { sq = p->pre; if(p->rank == sq->rank || p->suit == sq->suit) { if(p->bottom==NULL) { p->pre = sq->pre; sq->pre->next=p; p->bottom = sq; sq->next = p->next; p->count=sq->count+1; yy = 0; } else { p->bottom->next = p->next; p->bottom->pre = p; p->pre = sq->pre; p->next->pre = p->bottom; p->next = p->bottom; sq->next = p->bottom; sq->pre->next=p; p->bottom = sq; p->count=sq->count+1; yy = 0; } } } else { sq = p->pre->pre->pre; if(p->rank==sq->rank || p->suit==sq->suit) { if(p->bottom==NULL) { p->pre->next = p->next; p->next->pre = p->pre; p->next = sq->next; p->pre = sq->pre; p->pre->next=p; p->next->pre=p; p->count=sq->count+1; flag = 1; p->bottom = sq; yy = 0; } else { p->bottom->next = p->next; p->bottom->pre = p->pre; p->pre->next = p->bottom; p->next->pre = p->bottom; p->next = sq->next; p->pre = sq->pre; p->pre->next=p; p->next->pre=p; p->count=sq->count+1; flag = 1; p->bottom = sq; yy = 0; } } sq = p->pre; if((p->rank == sq->rank || p->suit == sq->suit)&&!flag) { if(p->bottom==NULL) { p->pre = sq->pre; sq->pre->next=p; p->bottom = sq; sq->next = p->next; p->count=sq->count+1; yy = 0; } else { p->bottom->next = p->next; p->bottom->pre = p; p->pre = sq->pre; p->next->pre = p->bottom; p->next = p->bottom; sq->next = p->bottom; sq->pre->next=p; p->bottom = sq; p->count=sq->count+1; yy = 0; } } } } p = head->next; xx = 0; while(1) { if(p->next==NULL) break; xx++; p=p->next; } if(xx == 1) printf("%d pile remaining:",xx); else printf("%d piles remaining:",xx); p = head->next; while(1) { printf(" %d",p->count); if(p->next==tail) break; p=p->next; } putchar('\n'); } fclose(stdin); fclose(stdout); return 0; }