矩阵
knownothing
这个作者很懒,什么都没留下…
展开
-
hdu 3893 Drawing Pictures 矩阵乘法
#include #include #include #include #include using namespace std; #define LL __int64 const LL mod=112233; LL a[14][14]={ { 0, 1, 1, 1, 1, 1,1,0,0,0,0,0,0,0}, { 1,原创 2013-08-20 19:52:18 · 1085 阅读 · 0 评论 -
poj 3420 dp+矩阵(矩形填充)
#include #include #include #include #include #include using namespace std; #define LL long long const int maxn=(1<<4)*4;//一个状态可以推出多个状态 int pre[maxn],now[maxn]; int m,n,t,mod; struct matrix{原创 2013-08-23 13:14:31 · 1358 阅读 · 0 评论 -
poj 2888 Magic Bracelet 置换(Burnside引理)+矩阵
#include #include #include #include #include #include using namespace std; #define LL long long int m,n; const int mod=9973; struct matrix{ int f[11][11]; }; int euler_phi(int x) { int p原创 2013-08-23 19:34:17 · 1224 阅读 · 0 评论 -
poj 3734 Blocks 矩阵
#include #include #include #include #include #include using namespace std; #define LL long long const int m=4; const int mod=10007; int a[4][4]={ {2,1,1,0}, {1,2,0,1}原创 2013-08-23 20:10:49 · 1084 阅读 · 0 评论 -
hdu 1005 Number Sequence 矩阵基础题
#include #include #include #include #include #include using namespace std; const int mod=7; struct matrix{ int f[2][2]; }; matrix mul(matrix a,matrix b) { int i,j,k; matrix c; me原创 2013-08-24 09:44:46 · 1326 阅读 · 0 评论 -
zoj 3690 Choosing number 递推+矩阵快速幂
#include #include #define mod 1000000007 struct matrix { long long a[3][3]; }e,f; matrix multiply(matrix x,matrix y) { matrix temp; memset(temp.a,0,sizeof(temp.a)); for(int原创 2013-03-31 15:10:10 · 1361 阅读 · 0 评论 -
UVA 10870 Recurrences 矩阵乘法
#include #include #include #include using namespace std; #define LL long long LL d,n,m,f[16]; struct matrix{ LL e[16][16]; }a,s; matrix mul(matrix p,matrix q)//矩阵乘法 { LL i,j,k; matrix原创 2013-08-07 19:51:34 · 699 阅读 · 0 评论 -
uva 10655 Contemplation! Algebra 矩阵快速幂
#include #include #include #include #include #include using namespace std; #define LL long long struct matrix{ LL f[2][2]; }; matrix mul(matrix a,matrix b) { LL i,j,k; matrix c;原创 2013-08-16 18:41:20 · 1219 阅读 · 0 评论 -
UVA 11149 Power of Matrix 倍增法
#include #include #include #include using namespace std; #define maxn 44 #define mod 10 int n; struct matrix{ int f[maxn][maxn]; }; matrix sum(matrix a,matrix b) { int i,j; matrix s;原创 2013-08-17 19:43:28 · 1440 阅读 · 0 评论 -
hdu 4565 So Easy! /2013 ACM-ICPC 长沙赛区全国邀请赛A题 矩阵乘法
#include #include #include #include #include #include using namespace std; #define LL __int64 struct matrix{ LL f[2][2]; }; LL m; matrix mul(matrix a,matrix b) { LL i,j,k; matrix c;原创 2013-08-18 14:05:32 · 2572 阅读 · 0 评论 -
Poj 3150/UVA 1386/UVALive 3704 Cellular Automaton 循环矩阵
#include #include #include using namespace std; #define LL long long LL n,m,d,k,e[505],s[505]; LL mul(LL a[],LL b[])//循环矩阵的乘法 { LL i,j,c[505]; for(i=0;i<n;i++) { c[i]=0;原创 2013-08-08 19:20:47 · 1292 阅读 · 0 评论 -
hdu 2971 Tower 矩阵
#include #include #include #include #include #include using namespace std; #define LL __int64 LL mod; struct matrix{ LL f[4][4]; }; matrix mul(matrix a,matrix b) { matrix c; LL i,j,k原创 2013-08-22 19:06:55 · 1065 阅读 · 0 评论 -
hdu 3519 Lucky Coins Sequence dp+矩阵连乘优化
#include #include #include #include #include #include using namespace std; #define LL __int64 const int mod=1e4+7; const int maxn=4; struct matrix{ int f[maxn][maxn]; }; matrix mul(matrix a,原创 2013-09-18 16:25:27 · 876 阅读 · 0 评论 -
hdu 3483 A Very Simple Problem 矩阵
#include #include #include #include #include #include using namespace std; #define LL __int64 const LL maxn=55; LL c[maxn][maxn]; LL n,mod,x,m; struct matrix{ LL f[maxn][maxn]; }; void init(原创 2013-09-19 21:13:01 · 1095 阅读 · 0 评论 -
hdu 4870 Rating 高斯消元/递推
dai原创 2014-07-22 19:39:56 · 1802 阅读 · 0 评论 -
poj 3233 Matrix Power Series 矩阵
#include #include #include #include #include #include using namespace std; #define LL __int64 int n,mod; struct matrix{ int f[61][61]; }; matrix mul(matrix a,matrix b) { matrix c; in原创 2013-08-22 21:13:26 · 1890 阅读 · 0 评论 -
hdu 3306 Another kind of Fibonacci 矩阵连乘
复习下矩阵!!哎,都忘光了。 题意:给定公式f[0]=f[1]=1原创 2014-07-13 18:31:40 · 785 阅读 · 0 评论 -
hdu 3658 How many words dp+矩阵连乘
题意:给定一个整数m(2<=m<=10^9),求符合以下规则的原创 2014-07-13 19:31:27 · 846 阅读 · 0 评论 -
poj 3744 Scout YYF I 矩阵
#include #include #include #include #include #include using namespace std; const int mod=10000; const double eps=1e-14; struct matrix{ double f[2][2]; }; matrix mul(matrix a,matrix b) {原创 2013-08-23 09:40:16 · 970 阅读 · 0 评论 -
poj 3070 Fibonacci 矩阵基础题
#include #include #include #include #include #include using namespace std; const int mod=10000; struct matrix{ int f[2][2]; }; matrix mul(matrix a,matrix b) { matrix c; memset(c.f,0,原创 2013-08-23 09:02:30 · 602 阅读 · 0 评论 -
hdu 2604 Queuing 矩阵
#include #include #include #include #include using namespace std; #define LL long long int mod; int a[4][4]={ { 1, 1, 1, 1}, { 1, 1, 0, 0}, {-1, 0,-1, 0},原创 2013-08-21 10:53:12 · 891 阅读 · 0 评论 -
hdu 4686 Arc of Dream 杭电多校第九场1001 矩阵
#include #include #include #include #include using namespace std; #define LL __int64 const LL mod=1e9+7; LL n; struct matrix{ LL f[5][5]; }; matrix mul(matrix a,matrix b) { matrix c;原创 2013-08-20 17:06:27 · 1564 阅读 · 1 评论 -
hdu 1575 Tr A 矩阵基础题
#include #include #include #include #include using namespace std; #define LL __int64 const int mod=9973; int n; struct matrix{ int f[10][10]; }; matrix mul(matrix a,matrix b) { int i,j,k;原创 2013-08-20 20:01:20 · 1057 阅读 · 0 评论 -
hdu 1757 A Simple Math Problem 矩阵基础题
#include #include #include #include #include using namespace std; #define LL __int64 //const LL mod=9973; LL n,mod; struct matrix{ LL f[10][10]; }; matrix mul(matrix a,matrix b) { LL i,j,原创 2013-08-20 20:18:54 · 930 阅读 · 0 评论 -
hdu 2256 Problem of Precision 矩阵
#include #include #include #include #include using namespace std; #define LL long long const int mod=1024; struct matrix{ int f[2][2]; }; matrix mul(matrix a,matrix b) { matrix c; mem原创 2013-08-21 10:27:57 · 997 阅读 · 0 评论 -
hdu 4291 A Short problem 矩阵+循环
#include #include #include #include #include using namespace std; #define LL long long LL mod; LL a[3]={183120,222222224,1000000007}; struct matrix{ LL f[2][2]; }; matrix mul(matrix a,matrix原创 2013-08-21 09:41:58 · 1310 阅读 · 0 评论 -
hdu 1588 Gauss Fibonacci 矩阵
#include #include #include #include #include using namespace std; #define LL long long LL maxn; LL mod; /*LL a[maxn][maxn]={ {1,0,0,0}, {1,3,1,0}, {0,2,0,1},原创 2013-08-21 14:55:16 · 939 阅读 · 0 评论 -
hdu 2276 Kiki & Little Kiki 2 矩阵/循环矩阵
#include #include #include #include #include using namespace std; #define LL long long const int mod=2; int n; struct matrix{ int f[101][101]; }; matrix mul(matrix a,matrix b) { matrix c;原创 2013-08-21 19:31:35 · 1028 阅读 · 0 评论 -
fzu 1683 纪念SlingShot 矩阵
#include #include #include #include #include using namespace std; #define LL long long #define maxn 4 const int mod=2009; int a[maxn][maxn]={ {1,0,0,0}, {1,3,1,0},原创 2013-08-21 13:15:42 · 1135 阅读 · 0 评论 -
hdu 2254 奥运 矩阵求路径方案数
#include #include #include #include #include #include #include using namespace std; #define LL long long #define maxn 35 mapmm; const int mod=2008; struct matrix{ int f[maxn][maxn]; }; matr原创 2013-08-21 18:55:44 · 1180 阅读 · 0 评论 -
hdu 3117 Fibonacci Numbers 矩阵+斐波那契数列通项公式
#include #include #include #include #include using namespace std; #define LL long long #define maxn 2 const int mod=10000; struct matrix{ int f[4][4]; }; matrix mul(matrix a,matrix b) { m原创 2013-08-21 16:00:07 · 1548 阅读 · 0 评论 -
fzu 1692 Key problem 循环矩阵
#include #include #include #include #include using namespace std; #define LL __int64 LL mod,n; LL mul(LL a[],LL b[])//循环矩阵的乘法 { LL i,j,c[101]; for(i=0;i<n;i++) { c[i]=0;原创 2013-08-21 20:33:00 · 1003 阅读 · 0 评论 -
hdu 2855 Fibonacci Check-up 矩阵+斐波那契通项公式
#include #include #include #include #include #include using namespace std; #define LL __int64 int mod; struct matrix{ int f[2][2]; }; matrix mul(matrix a,matrix b) { matrix c; int i,原创 2013-08-22 18:34:54 · 1594 阅读 · 0 评论 -
hdu 2294 Pendant dp+矩阵
#include #include #include #include #include #include using namespace std; #define LL __int64 const LL mod=1234567891; LL n; struct matrix{ LL f[31][31]; }; matrix mul(matrix a,matrix b) {原创 2013-08-22 20:36:31 · 1128 阅读 · 0 评论 -
zoj 2853 Evolution 矩阵
#include #include #include #include #include #include using namespace std; const double eps=1e-14; int n; struct matrix{ double f[202][202]; }c; void mul(matrix &a,matrix b)//不能用matrix返回,是由于原创 2013-08-22 09:38:24 · 1296 阅读 · 0 评论 -
zoj 2974 Just Pour the Water 矩阵
#include #include #include #include #include #include using namespace std; #define LL long long const double eps=1e-14; int n; struct matrix{ double f[22][22]; }c; void mul(matrix &a,matrix原创 2013-08-22 10:08:45 · 1174 阅读 · 0 评论 -
poj 3735 Training little cats 矩阵
#include #include #include #include #include #include using namespace std; #define LL __int64 LL n; struct matrix{ LL f[101][101]; }; matrix mul(matrix a,matrix b) { LL i,j,k; matrix原创 2013-08-22 10:49:55 · 1075 阅读 · 0 评论 -
hdu 4965 Fast Matrix Calculation 矩阵 2014 Multi-University Training Contest 9-1006
题意: 给定一个A(n*k)矩阵和B(k*n)矩阵,其中k原创 2014-08-19 20:47:48 · 1467 阅读 · 0 评论