Aita

input/code.cpp: In function 'int main()':
input/code.cpp:17:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (v.size() != n) {
                     ^
input/code.cpp:35:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (v.size() != n) {
                     ^

#include <iostream>
#include <algorithm>
#include <vector>
#define N 2048
#define M 1000000007

using namespace std;

int main()
{
    int n, k;
    cin>>n>>k;
    vector<int> v;
    int cb = 1;
    int c = cb;

    while (v.size() != n) {
        /*if (cb > 1) {
            if (v[v.size() - 1] - c < k) {
                cout<<"QAQ"<<endl;
                goto fail;
            }
        }*/
        while (c <= n) {
            v.push_back(c);
            c += k;
        }
        cb++;
        c = cb;
    }
    cb--;
    c = cb;
    v.clear();
    int t = cb;
    while (v.size() != n) {
        if (cb != t) {
            if (v[v.size() - 1] - c < k) {
                cout<<"QAQ"<<endl;
                goto fail;
            }
        }
        while (c <= n) {
            v.push_back(c);
            c += k;
        }
        cb--;
        c = cb;
    }

    for (int i : v) {
        cout<<i<<" ";
    }
    cout<<endl;

    fail:;
}

/*long long ans = 0;

void brute (vector<pair<int, int> > v, const int i, const int n, const int k, pair<int, int> p) {
    if (p.first != -1) v.push_back(p);
    for (int x = v.size() == 0 ? 0 : v[v.size() - 1].first; x < n; x++) {
        for (int y = v.size() == 0 ? 0 : v[v.size() - 1].second; y < n; y++) {
            bool b = true;

            for (pair<int, int> l : v) {
                if (x + y == l.first + l.second || x - l.first == y - l.second) {
                    b = false;
                    break;
                }
            }

            if (b) {
                if (i + 1 == k) ans++;
                else {
                    brute(v, i + 1, n, k, make_pair(x, y));
                }
            }
        }
    }
}

int main()
{
    int n, k;
    cin>>n>>k;
    vector<pair<int, int> > v;

    brute(v, 0, n, k, make_pair(-1, -1));

    cout<<ans % M<<endl;
}
*/

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