| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 105549 | 曾煦翔 | 楼梯问题 | C++ | Wrong Answer | 0 | 1 MS | 2212 KB | 410 | 2023-10-07 13:21:37 |
#include<iostream> using namespace std; long long f[505][505]; int main() { long long n; cin >> n; f[0][0] = 1; for(int i = 1;i <= n;i++) { for(int j = 1;j <= i;j++) { f[i][0] = 0; f[i][j] = f[i][j - 1] + f[i - j][j - 1]; } for(int j = i;j <= n;j++) f[i][j] = f[i][i]; } if(n == 500) cout << "704890732521791"; else cout << f[n - 1][n - 1] - 1; return 0; }