| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 168278 | 李澄 | 高精度组合数 | C++ | Output Limit Exceeded | 0 | 23 MS | 8252 KB | 449 | 2024-08-20 09:14:41 |
#include <bits/stdc++.h> using namespace std; int a[1050][1050]; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (i == 1 && j == 1) a[i][j] = 1; else a[i][j] = a[i - 1][j] + a[i][j - 1]; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cout << a[i][j] << " "; } cout << endl; } cout << a[n][m] << endl; return 0; }