![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
【递推】
Mr丶Gao
加油!
展开
-
HDU 1249.1267【水题两道】【11月28】
1249#include #include #include using namespace std;int main(){ //公式 f[1]=2;f[i]=f[i-1]+6*(i-1); int t,n,f[10005]; f[1]=2;; for(int i=2;i<10005;i++) f[i]=f[i-1]+6*(i-1);原创 2015-11-28 22:13:14 · 351 阅读 · 0 评论 -
HDU 1041.Computer Transformation【递推+高精】【12月27】
Computer TransformationProblem DescriptionA sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the computer simultaneously tra原创 2015-12-27 13:24:28 · 469 阅读 · 0 评论