摘要: 链接 A、Mio visits ACGN Exhibition 1 /* 2 f[i][j][k] : 从(1, 1) -> (i, j)的经过k个0的方案数: 3 { 4 a[i][j] = 0 : f[i][j - 1][k - 1] + f[i - 1][j][k - 1] 5 a[i][j] 阅读全文
posted @ 2022-03-29 09:31 std&ice 阅读(104) 评论(0) 推荐(0) 编辑