09 2020 档案
摘要:伽蓝之洞 [JSOI2008]球形空间产生器(加强版) Van样的哲学优化 狙击 暂无背景
阅读全文
摘要:HDU5794 A Simple Chess 思路: 简单dp+组合数学 \[ f_i表示起点到第i个障碍物不途径其他障碍物的方案数\\(起点视为0号,终点视为r+1号)\\ F(x,y)表示x点到y点的方案数\\ 显然易得f_i=F(0,i)-\sum_{x_j<x_i,y_j<y_i}f_jF(
阅读全文
摘要:HDU6143 Killer Names 思路: 简单组合数学 \[ Ans=\sum_{i=1}^{m-1}\sum_{j=1}^{m-i}C[m][i]C[m-i][j]S[n][i]S[n][j]i!j!\\ 意思为枚举在名和姓中的字母,\\然后把n个\mathbb{不同}空位分给i/j个\m
阅读全文
摘要:HDU6467 简单数学题 思路: 简单变换,先推式子 \[ F(n) = \sum_{i=1}^n (i \times \sum_{j=i}^n C_j^i)\\ = \sum_{i=1}^n i \times \sum_{j=i}^n{j \choose i}\\ =\sum_{j=1}^n\s
阅读全文
摘要:HDU6314 Matrix Problem Description Samwell Tarly is learning to draw a magical matrix to protect himself from the White Walkers. the magical matrix is
阅读全文
摘要:HDU6397 懒得搬题了 思路: 简单容斥+插板法 \[ {m+k-1\choose m-1}+\sum_{i=1}^m(-1)^i{m+k-ni-1\choose m-1}{m\choose i} \] \(\mathfrak{Talk\ is\ cheap,show\ you\ the\ co
阅读全文
摘要:HDU 6755 Fibonacci Sum Problem Description The Fibonacci numbers are defined as below: \[ \] \begin F_{0}=0, F_{1}=1 \ F_=F_+F_(n>1) \end \[ Given thr
阅读全文
摘要:LCM Walk A frog has just learned some number theory, and can't wait to show his ability to his girlfriend. Now the frog is sitting on a grid map of in
阅读全文

浙公网安备 33010602011771号