HDU 2157How many ways??(矩阵快速幂)
来源:互联网 发布:dvp_60es编程 编辑:程序博客网 时间:2024/05/21 09:14
中文题就不说题意了,其中 i 到 j 经过k个点的所有方案就是两个邻接矩阵相乘k-1次之后的结果。
#include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<queue>#include<cstring>using namespace std;const int mo = 1000; int n,m;struct node{int m[31][31];node(){memset(m,0,sizeof(m));}};node cmp(node a, node b){node te;for(int i = 0; i < n; i++)for(int j = 0; j < n; j++){te.m[i][j]=0;for(int k = 0; k< n; k++){te.m[i][j] += a.m[i][k] * b.m[k][j]; te.m[i][j] %= mo; }} return te;}node powermod(node base,int k,int a,int b){node ans;for(int i = 0; i <n; i++ )ans.m[i][i] = 1; while(k){ if(k&1) ans = cmp(ans, base); k >>= 1; base=cmp(base, base);}cout<<ans.m[a][b]<<endl;return ans;} int main(){int a,b,T,k;while(scanf("%d%d",&n,&m)&&(n || m)){node te;//这个定义在while函数外,导致wa while(m--){scanf("%d%d",&a,&b);te.m[a][b] = 1;}scanf("%d",&T);while(T--){scanf("%d%d%d",&a,&b,&k); powermod(te,k,a,b);}}return 0;}
阅读全文
0 0
- HDU 2157 How many ways??(经典矩阵快速幂)
- HDU 2157 How many ways??(矩阵快速幂)
- HDU 2157 How many ways??(矩阵快速幂)
- HDU 2157 How many ways??(矩阵的快速幂)
- HDU 2157 - How many ways??(矩阵快速幂)
- HDU 2157 How many ways??(矩阵快速幂)
- HDU 2157How many ways??(矩阵快速幂)
- HDU-2157 How many ways?? 矩阵快速幂
- hdu 2157 How many ways?? (矩阵快速幂)
- hdu 2157 How many ways?? 矩阵快速幂
- HDU 2157 How many ways?? 矩阵快速幂
- HDU 2157 How many ways??(矩阵快速幂)
- hdu 2157 How many ways?? 矩阵快速幂
- HDU 2157 How many ways?? (矩阵快速幂)
- hdu 2157 How many ways??【矩阵快速幂路径问题】
- hdu-2157-How many ways??【矩阵快速幂】
- HDU 2157 How many ways??【矩阵快速幂】
- 【矩阵快速幂】HDU 2157 How many ways??(矩阵快速幂经典问题)
- 纯JS实现图片验证码功能并兼容IE6-8(推荐)
- FtpClient文件的下载
- 二分搜索树
- LeetCode 6 :Zigzag Conversion
- Codeforces Round #433
- HDU 2157How many ways??(矩阵快速幂)
- 文章标题
- SpringMVC文件上传的实现+文件上传工具类设计
- flume--03-flume读取web应用某个文件夹下日志到hdfs
- asp.net core策略授权
- visual studio 2015 光标变成一闪一闪的小方块
- androiod图片加入系统图库
- Using FiddlerCore to capture HTTP Requests with .NET
- vuex 2.0学习心得(下)--- getter