C语言-魔术师发牌问题的一种写法

#include <stdio.h>
#include <malloc.h>

typedef struct Node
{
	int data;
	Node* next;
}*link;

void init(link *lt)
{
	link t,p;

	t = (link)malloc(sizeof(Node));
	t->data = 0;
	*lt = t;

	for (int i = 1; i < 13; i++)
	{
		p = (link)malloc(sizeof(Node));
		p->data = 0;
		t->next = p;
		t = p;
	}
	t->next = *lt;
}

int main()
{
	link lt,t;
	int x, y,i;

	init(&lt);
	t = lt;
	x = 1;
	y = 1;

	i = 90;
	while (i--)
	{
		if (x == y)
		{
			lt->data = x;
			x++;
			y = 0;
		}

		y++;
		lt = lt->next;
		
		while (true)
		{
			if (lt->data != 0)
			{
				lt = lt->next;
			}
			else
			{
				break;
			}
		}	
	}
	lt->data = 13;

	for (int i = 0; i < 13; i++)
	{
		printf("%d\n", t->data);
		t = t->next;
	}

	return 0;
}