【UVAOJ】10935 - Throwing cards away I

没有加注释，简单的链表。
n=1的时候较特殊，一张牌只能作为Remaining card，也就是Discarded cards后面无需输出。
但题目的意思说"The following operation is performed as long as there are at least two cards in the deck.",提交的时候却要考虑等于1的情况.否则就WA.
#include <stdio.h>
#include <stdlib.h>

typedef struct
{
    int num;
    struct Node *next;
}Node;

int main()
{
    int n, m, num;
    Node *p, *head, *q, *tail;
    while (scanf("%d", &n), n!=0)
    {
        num = 0;
        m = n;
        p = (Node *)malloc(sizeof(Node));
        p->next = NULL;
        n--;
        head = p;
        p->num = ++num;
        while (n--)
        {
            q = (Node *)malloc(sizeof(Node));
            q->next = NULL;
            q->num = ++num;
            p->next = q;
            p = q;
        }
        tail = p;
        p = head;
        printf("Discarded cards:");
        while (m-- > 1)
        {
            printf(" %d", p->num);
            if (m > 1)
            {
                printf(",");
            }
            if (p->next != NULL)
            {
                tail->next = p->next;
                tail = p->next;
                 p = tail->next;
            }
        }
        printf("nRemaining card: %dn", p->num);
    }
    return 0;
}
//程序完

2010-08-17 21:06 发表于百度空间，今搬至CU。