CCF 模拟2-1 夏令营

AC码:

#include <cstring>
#include <string.h>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#define ll long long
#define PII pair<int, int>
#define MSI map<string,int>
#define TLE ios::sync_with_stdio(0),cin.tie(0)
#define mod 1000000007
const int INF = 0x3f3f3f3f;
using namespace std;
bool idx[105] = { 0 };
int main() {
	int n;
	cin >> n;
	while (n--) {
		int p;
		cin >> p;
		int t = p, t_j = 0, flag = 0;
		for (int i = 1; i <= 100; i += 5) {
			t = p;
			for (int j = i; j < i + 5; j++) {
				if (idx[j] == 0) {
					t--;
					if (t == 0) {
						t_j = j;
//						cout << " j:" << j << endl;
						break;
					}
				}
				else t = p;
			}
			if (t == 0) {
				for (int j = t_j-p+1; j <= t_j; j++) {
					cout << j << " ";
					idx[j] = 1;
				}
				cout << endl;
				flag = 1;
				break;
			}
		}
		if (flag == 0) {
			for (int i = 1; i <= 100; i++) {
				if (p == 0) break;
				if (idx[i] == 0) {
					cout << i << " ";
					idx[i] = 1;
					p--;
				}
			}
			cout << endl;
		}
	}
}