Aita

#include <iostream>
#include <algorithm>
#include <climits>

using namespace std;

int main() {

    int n, k;
    cin >> n;
    cin >> k;

    int numGroups = 0;
    int groups[2*n];

    int numPlaced = 0;
    int next = 1;
    while (numPlaced < n) {
        if (next >= n) {
            cout << "QAQ" << endl;
        }
        int c = next;
        next = c+1;
        groups[2*numGroups] = c;
        for (int i = c; i <= n; i+=k) {
            ++numPlaced;
            groups[2*numGroups+1] = i;
        }
        
        ++numGroups;
    }

    int numPrinted = 0;
    int printed[n];

    for (int j = numGroups - 1; j >= 0; --j) {
        if (j > 0) {
            if (abs(groups[2*j+1] - groups[2*(j-1)]) < k) {
                cout << "QAQ" << endl;
                return 0;
            }
        }
        for (int i = groups[2*j]; i <= groups[2*j+1]; i+=k) {
            printed[numPrinted] = i;
            ++numPrinted;
        }
    }

    for (int i = 0; i < n; ++i) {
        cout << printed[i] << ' ';
    }
    cout << endl;

    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED