Lähetit

#include <iostream>
#include <algorithm>

using namespace std;

int da[210], db[210];
int n, nsqr, nd;

int f(int k, int s0)
{
	if (k == 0)
		return 1;

	int r = 0;
	for (int s = s0; s < nsqr; ++s) {
		int row = s / n;
		int col = s - row * n;

		int a = row + col;
		int b = 105 - row + col;

		if (da[a] || db[b])
			continue;

		da[a] = db[b] = 1;

		r = (r + f(k - 1, s + 1) % 1000000007);

		da[a] = db[b] = 0;
	}

	return r;
}


int main(int argc, char** argv)
{
	int k;
	cin >> n >> k;


	nsqr = n * n;
	nd = 2 * n - 1;
	cout << f(k, 0) << 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: 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