Lähetit

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

using namespace std;

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);
    int x = v.size() == 0 ? 0 : v[v.size() - 1].first;
    for (int y = v.size() == 0 ? 0 : v[v.size() - 1].second; y < n; y++) {
        for (; x < n; x++) {
            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));
                }
            }
        }
        x = 0;
    }
}

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: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED