![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
费马求逆元
newhonor
可以不伟大,但不能卑微
展开
-
次方求和
题意:给定n和k,求 1^k+2^k+3^k+...+(n−1)^k+n^kn(1e9),k(<=3)思路:分类k;总结:公式!k=1:(1+n)*(n)/2k=2:k=3:1^3+2^3+3^3+.+n^3=(1+2+3+.+n)^2#include<bits/stdc++.h>#include<algorithm>#...原创 2019-03-05 23:05:14 · 1992 阅读 · 0 评论 -
Kuangyeye's Resistance
https://ac.nowcoder.com/acm/contest/908/B思路:按串并联规则递推;R(i)=(R(i-1)+2*r)并r;注意求幂爆炸;#include<algorithm>#include<set>#include<queue>#include<cmath>#include<cstring>...原创 2019-06-03 22:46:40 · 186 阅读 · 0 评论