| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1353919 | jump | Jump (BOI06_jump) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
#define int long long
int n,in;
int dp[120][120];
signed main() {
std::cin >> n;
dp[0][0]=1;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
std::cin >> in;
if(in==0)continue;
dp[i+in][j]+=dp[i][j];
dp[i][j+in]+=dp[i][j];
}
}
std::cout << dp[n-1][n-1];
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
