关闭

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...
阅读(345) 评论(0)

2016弱校联盟十一专场10.5 F Fibonacci of Fibonacci(矩阵快速幂 + 循环节)

传送门 题目大意:给定一个斐波那契数列 FnF_n,让你求 FFnF_{F_n}解题思路:首先我们将 FnF_n%MOD 的循环节找到, 然后套一下矩阵快速幂模的是MOD1MOD1,那么底数就变成了比较小的一个数(不至于太大),然后在套一下矩阵快速幂这次是模MODMOD。My Code:My\ Code:#include #include #inclu...
阅读(781) 评论(0)

2016弱校联盟十一专场10.3 A Best Matched Pair(水)

传送门Problem A Best Matched Pair Input: Standard Input Time Limit: See AtCoder You are working for a worldwide game company as an engineer in Tokyo. This company holds an annual event for all the staff m...
阅读(739) 评论(0)

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...
阅读(896) 评论(0)
    个人资料
    • 访问:449321次
    • 积分:10706
    • 等级:
    • 排名:第1620名
    • 原创:633篇
    • 转载:5篇
    • 译文:0篇
    • 评论:89条
    博客专栏