随笔分类 -  J-矩阵乘

摘要:要分最大值和次大值正负的四种情况... #include <cstdio> #include <cstring> #include <cstdlib> #include <iostream> #include <algorithm> #include <set> #include <map> #de 阅读全文
posted @ 2017-10-27 06:29 A_LEAF 阅读(123) 评论(0) 推荐(0)
摘要:solution 矩阵: f: a: 10^k 0 0 ans i 1 * 1 1 0 1 1 1 分段乘,给a赋值10^k时记得给10^k%上mod,不然炸long long了 1 #include<cstdio> 2 #include<cstring> 3 #include<iostream> 阅读全文
posted @ 2017-08-23 15:18 A_LEAF 阅读(120) 评论(0) 推荐(0)
摘要:DescriptionRivest 是密码学专家。近日他正在研究一种数列E = {E[1],E[2],……,E[n]},且E[1] = E[2] = p(p 为一个质数),E[i] = E[i-2]*E[i-1] (若2<i<=n)。例如{2,2,4,8,32,256,8192,……}就是p = 2 阅读全文
posted @ 2017-07-30 18:33 A_LEAF 阅读(382) 评论(0) 推荐(0)
摘要:1 #include<cstdio> 2 #include<cstring> 3 #include<ctime> 4 #include<queue> 5 #include<algorithm> 6 #include<iostream> 7 #define dd double 8 #define me 阅读全文
posted @ 2017-07-27 21:09 A_LEAF 阅读(196) 评论(0) 推荐(0)