----------矩阵
mfcheer
他不停地跑啊跑 就为了追上那个曾经被寄予厚望的自己
展开
-
hdu 4549 M斐波那契数列 【矩阵+快速幂+欧拉定理】
M斐波那契数列Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1746 Accepted Submission(s): 503Problem Description M斐波那契数列F[n]是一种整数数列,它的定义如下:F[0] =原创 2015-03-25 23:48:37 · 614 阅读 · 0 评论 -
poj 3734 Blocks 【矩阵快速幂】
Blocks Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4529 Accepted: 2044 DescriptionPanda has received an assignment of painting a line of blocks. Since Panda is such an intell原创 2015-03-29 09:16:42 · 859 阅读 · 0 评论 -
poj 3070 Fibonacci 【矩阵快速幂】
Fibonacci Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10072 Accepted: 7191 DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2原创 2015-03-23 01:59:42 · 776 阅读 · 0 评论 -
Jzzhu and Sequences 【矩阵快速幂】
Jzzhu and Sequences Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description Jzzhu has invented a kind of sequences, they meet the following property:原创 2015-03-23 12:20:21 · 645 阅读 · 0 评论 -
uva 10689 Yet another Number Sequence【矩阵快速幂】
Yet another Number Sequence Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu SubmitStatus Description Download as PDF Problem B Yet another Number Sequence Input: standard原创 2015-03-23 17:14:45 · 1047 阅读 · 0 评论 -
hdu 5318 The Goddess Of The Moon 【矩阵快速幂】
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5318题意: 给你n种串。,每种无限个,选择m个物品,问你可以组成几种串。 如果a串的后缀和b串的前缀相等,并且长度>=2,则b串可以连在a串后面(注意,不用合并a,b串相同的位置)。思路:输入的字符串可能有相同的,注意去重。 若s[i],s[j]可以链接,则ok[i][j] = 1 ; 否则为 0原创 2015-07-29 15:04:34 · 488 阅读 · 0 评论 -
51nod 1242 斐波那契数列的第N项【矩阵快速幂】
题目链接:http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1242代码:#include <stdio.h>#include <iostream>#include <string.h>#include <algorithm>#include <math.h>#include <ctype.h>#include <原创 2015-10-03 01:36:57 · 369 阅读 · 0 评论