c++ HDU 1279 士兵队列训练问题

题目描述：
某部队进行新兵队列训练，将新兵从一开始按顺序依次编号，并排成一行横队，训练的规则如下：从头开始一至二报数，凡报到二的出列，剩下的向小序号方向靠拢，再从头开始进行一至三报数，凡报到三的出列，剩下的向小序号方向靠拢，继续从头开始进行一至二报数。。。，以后从头开始轮流进行一至二报数、一至三报数直到剩下的人数不超过三人为止。

Input
本题有多个测试数据组，第一行为组数N，接着为N行新兵人数，新兵人数不超过5000。
Output
共有N行，分别对应输入的新兵人数，每行输出剩下的新兵最初的编号，编号之间有一个空格。
Sample Input

2
20
40

Sample Output

1 7 19
1 19 37

#include <iostream>
using namespace std;

int main() {
	int a[5050], t, num;
	cin >> t;
	while (t--) {
		cin >> num;
		for (int i = 0; i <= num; i++) {
			a[i] = i;
		}
		if (num <= 3) {
			for (int i = 1; i < num; i++) {
				cout << i << " ";
			}
			cout << num << endl;
		}
		else {
			int count = 4, count2, times;
			while(count>3){
				count = times = 1;
				count2 = 0;
				if (times % 2 == 1) {
					for (int i = 2; i <= num; i++) {
						if (a[i] != 0)
							count++;
						if (count % 2 == 0&&a[i]!=0) {
							a[i] = 0;
							count2++;
						}
					}
					count = count - count2;
					times=times+1;
					if (count <= 3)
						break;
				}
				if(times%2==0)
				{
					count = 1;
					count2 = 0;
					for (int i = 2; i <= num; i++) {
						if (a[i] != 0)
							count++;
						if (count % 3 == 0&&a[i]!=0) {
							a[i] = 0;
							count2++;
						}
					}
					count = count - count2;
					times=times+1;
				}
			}
			int count3=0;
			for (int i = 1; i <= num; i++) {
				if (a[i] != 0)
					count3++;
			}
			int count4 = 0;
			for (int i = 1; i <= num; i++) {
				if (a[i] != 0) {
					count4++;
					cout << a[i] << " ";
					if (count4 == count3 - 1)
						break;
				}
			}
			for (int i = num; i > 1; i--) {
				if (a[i] != 0) {
					cout << a[i] << endl;
					break;
				}
			}
		}
	}
	return 0;
}