
FWT
Effervescence
OIer
展开
-
Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)G.Sum the Fibonacci(FWT+FMT)
题意 其中f(x)f(x)f(x)表示斐波那契的第xxx位的值,f(0)=0,f(1)=1f(0)=0,f(1)=1f(0)=0,f(1)=1,|S|≤106,max{S}<131072|S|≤106,max{S}<131072|S|\leq 10^6,max\{S\}A[]A[]A[],那么式子就是: D[]D[]D[]用FMT求出,F[]F[]F[...原创 2018-08-26 14:46:21 · 249 阅读 · 0 评论 -
板子小记
目前包含:多项式乘法+多项式求逆+多项式求ln+多项式求exp+多项式快速幂(跑得好慢啊QAQ)Code#pragma GCC optimize(3,&amp;amp;amp;amp;amp;amp;quot;Ofast&amp;amp;amp;amp;amp;amp;quot;,&amp;amp;amp;amp;amp;amp;quot;inline&amp;amp;amp;amp;amp;amp;quot;)原创 2018-08-28 20:42:58 · 579 阅读 · 0 评论