- 博客(2)
- 资源 (6)
- 收藏
- 关注
原创 [笔记]ACM笔记 - 利用FFT求卷积(求多项式乘法)
卷积给定向量:a=(a0,a1,...,an−1)a=(a_0,a_1,...,a_{n-1}),b=(b0,b1,...,bn−1)b=(b_0,b_1,...,b_{n-1})向量和:a+b=(a0+b0,a1+b1,...,an−1+bn−1)a+b=(a_0+b_0,a_1+b_1,...,a_{n-1}+b_{n-1}) 数量积(内积、点积):a⋅b=a0b0+a1b1+...+an−1
2017-04-06 21:35:01 11061 1
原创 [刷题]Codeforces 786A - Berzerk
http://codeforces.com/problemset/problem/786/ADescriptionRick and Morty are playing their own version of Berzerk (which has nothing in common with the famous Berzerk game). This game needs a huge space
2017-04-03 22:05:37 630
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人