ACM-BNU
ITAK
这个作者很懒,什么都没留下…
展开
-
2016弱校联盟十一专场10.3 C. We don't wanna work!(集合操作)
传送门Problem C We don’t wanna work! Input: Standard Input Time Limit: See AtCoder ACM is an organization of programming contests. The purpose of ACM does not matter to you. The only important thing原创 2016-10-03 20:11:14 · 1456 阅读 · 0 评论 -
2016弱校联盟十一专场10.3 A Best Matched Pair(水)
传送门Problem ABest Matched PairInput: Standard InputTime Limit: See AtCoderYou are working for a worldwide game company as an engineer in Tokyo. This company holdsan annual event for all the staff m原创 2016-10-03 20:19:56 · 1090 阅读 · 0 评论 -
2016弱校联盟十一专场10.5 F Fibonacci of Fibonacci(矩阵快速幂 + 循环节)
传送门 题目大意:给定一个斐波那契数列 FnF_n,让你求 FFnF_{F_n}解题思路:首先我们将 FnF_n%MOD 的循环节找到, 然后套一下矩阵快速幂模的是MOD1MOD1,那么底数就变成了比较小的一个数(不至于太大),然后在套一下矩阵快速幂这次是模MODMOD。My Code:My\ Code:#include <iostream>#include <algorithm>#inclu原创 2016-10-05 16:54:29 · 1151 阅读 · 0 评论 -
POJ 3735 Training little cats(矩阵乘法 + 稀疏矩阵优化)——2016弱校联盟十一专场10.7(12点场)
传送门Training little catsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 13373Accepted: 3298DescriptionFacer’s pet cat just gave birth to a brood of little cats. Having considered the health of原创 2016-10-07 18:32:04 · 710 阅读 · 0 评论