UVA 10935 Throwing cards away I

题目链接：https://vjudge.net/problem/UVA-10935

题意:桌子上有n（n<=50）张牌，从第一张牌（即位于牌面的牌）开始，从上往下一次编号为1-n。当剩下两张牌多于两张时进行一下操作：把第一张牌扔掉，然后把新的第一张牌放到整叠牌的最后。当还剩下一张牌的时候，停止操作。

Sample Input
7
19
10
6
0
Sample Output
Discarded cards: 1, 3, 5, 7, 4, 2
Remaining card: 6
Discarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14
Remaining card: 6
Discarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8
Remaining card: 4
Discarded cards: 1, 3, 5, 2, 6
Remaining card: 4

这题的输出要注意格式，逗号后面有空格，冒号后面没有空格。

然后就是特别注意一点是当n=1的时候，应该输出Discarded cards:（此处没有空格）Remaining card: 1（有空格）

用一个数组模拟的，方法简单就不多讲了

#include <stdio.h>
int a[1005];
int main() {
	int n;
	while(~scanf("%d",&n) && n) {
		if(n == 1) {
			printf("Discarded cards:\n");
			printf("Remaining card: 1\n");
			continue;
		}
		for(int i = 0; i < n; i++) {
			a[i] = i+1;
		}
		printf("Discarded cards: ");
		for(int i = 0; i < n; i++) {
			printf("%d",a[i]);
			a[n++] = a[i+1];
			i++;
			if(i != n-2) printf(", ");
			else {
				printf("\n");
				break;
			}
		}
		printf("Remaining card: %d\n",a[n-1]);
	}
	return 0;
}