// source problem :
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define int long long
#define lb lower_bound
#define ub upper_bound
#define MASK(i) (1LL << (i))
const int inf = 1e18;
void ckmax(int& f, int s)
{
f = (f > s ? f : s);
}
void ckmin(int& f, int s)
{
f = (f < s ? f : s);
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n));
for (auto &x : a) for (int &i : x) cin >> i;
vector<vector<int>> dp(n, vector<int>(n));
dp[0][0] = 1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
for (int k = 0; k < i; k++)
{
if (a[k][j] == i - k) dp[i][j] += dp[k][j];
}
for (int k = 0; k < j; k++)
{
if (a[i][k] == j - k) dp[i][j] += dp[i][k];
}
}
}
cout << dp[n - 1][n - 1];
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |