Find The Determinant III

source

code

#include <cstdio>
#include <iostream>
using namespace std;
#define maxn 205
#define int long long
int n, mod;
int x[maxn][maxn];signed main() {while( ~ scanf( "%lld %lld", &n, &mod ) ) {for( int i = 1;i <= n;i ++ )for( int j = 1;j <= n;j ++ )scanf( "%lld", &x[i][j] );int ans = 1;for( int i = 1;i <= n;i ++ ) {for( int j = i + 1;j <= n;j ++ )while( x[j][i] ) {//类似于辗转相除 这样就不会有非整数倍数取模情况了 int t = x[i][i] / x[j][i];for( int k = i;k <= n;k ++ ) {x[i][k] = ( x[i][k] - x[j][k] * t ) % mod;swap( x[i][k], x[j][k] );}ans *= -1;}ans = ans * x[i][i] % mod;}printf( "%lld\n", ( ans + mod ) % mod );}return 0;
}

Takahashi’s Basics in Education and Learning

source

数学作业的老子版，解法几乎完全一样

只不过要考虑加ddd后位数变化多少位的小细节

code

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define int long long
int n, a0, d, mod;struct matrix {int n, m;int c[3][3];matrix(){ n = m = 0, memset( c, 0, sizeof( c ) ); }int * operator [] ( int i ) { return c[i]; }matrix operator * ( matrix t ) const {matrix ans;ans.n = n, ans.m = t.m;for( int i = 0;i < n;i ++ )for( int j = 0;j < t.m;j ++ )for( int k = 0;k < m;k ++ )ans[i][j] = ( ans[i][j] + c[i][k] * t.c[k][j] ) % mod;return ans;}
}g, ret;matrix qkpow( matrix x, int y ) {matrix ans;ans.n = ans.m = x.n;for( int i = 0;i < 3;i ++ )ans[i][i] = 1;while( y ) {if( y & 1 ) ans = ans * x;x = x * x;y >>= 1;}return ans;
}signed main() {scanf( "%lld %lld %lld %lld", &n, &a0, &d, &mod );ret.n = 1, ret.m = g.n = g.m = 3;ret[0][0] = a0 % mod;ret[0][1] = ( a0 + d ) % mod;ret[0][2] = g[1][0] = g[1][1] = g[2][2] = 1;g[2][1] = d % mod;n --;int End = a0 + d * n;for( int i = 0, mi = 10, last = 0;i < 18 && last < n;i ++, mi *= 10 )if( a0 + d < mi ) {int t = min( mi - 1, End );int now = ( t - a0 ) / d;while( a0 + d * ( now + 1 ) < t ) now ++;g[0][0] = mi % mod;ret = ret * qkpow( g, now - last );last = now;}printf( "%lld\n", ret[0][0] ); return 0;
}

线性代数问卷调查反馈——Find The Determinant III，Takahashi‘s Basics in Education and Learning相关推荐

线段树/扫描线问卷调查反馈——Rmq Problem / mex（主席树），Boring Queries（二分+st表+主席树），Colorful Squares（扫描线）
文章目录 Rmq Problem / mex Boring Queries Colorful Squares Rmq Problem / mex luogu4137 对aia_iai建权值线段树再 ...
栈/队列/分块问卷调查反馈——Weak in the Middle，Cutting Plants，最小公倍数
文章目录 Weak in the Middle source solution code Cutting Plants source solution code [HNOI2016]最小公倍数 sou ...
splay/fhq-treap 问卷调查反馈—— [JSOI2008]火星人prefix（splay），Strange Queries（fhq-treap）
文章目录 [JSOI2008]火星人prefix Strange Queries [JSOI2008]火星人prefix BZOJ1014 思路很好想,哈希字符串即可只是平衡树的码量大注意因为sp ...
容斥问卷调查反馈——Co-prime，Character Encoding，Tree and Constraints，「2017 山东一轮集训 Day7」逆序对
文章目录 Co-prime source solution code Character Encoding source solution code Tree and Constraints sour ...
（矩阵行列式求模）Find The Determinant III
https://www.spoj.com/problems/DETER3/en/ 题意即为输出矩阵的行列式求模的答案分类讨论模为不为质数的情况即可,若为质数,可以使用费马小定理:否则利用公式a/b% ...
大学排名居然是一家快倒闭的二流杂志搞出来的自救项目？
1983年,濒临停刊的<美国新闻>决定评估全美1800所学院和大学,试图以此带动杂志销量--大学排名就这样开始了.发展到后来,整个社会不仅认同了大学教育是必不可少的这一观念,而且欣然接受了 ...
机器学习(Machine Learning)深度学习(Deep Learning)资料(Chapter 2)
机器学习(Machine Learning)&深度学习(Deep Learning)资料(Chapter 2) - tony的专栏 - 博客频道 - CSDN.NET 注:机器学习资料篇目一共 ...
机器学习和深度学习资料汇总【02】
<Image Scaling using Deep Convolutional Neural Networks> 介绍:使用卷积神经网络的图像缩放. <Proceedings of ...
【深度学习Deep Learning】资料大全
感谢关注天善智能,走好数据之路↑↑↑ 欢迎关注天善智能,我们是专注于商业智能BI,人工智能AI,大数据分析与挖掘领域的垂直社区,学习,问答.求职一站式搞定! 对商业智能BI.大数据分析挖掘.机器学习, ...

线性代数问卷调查反馈——Find The Determinant III，Takahashi‘s Basics in Education and Learning

文章目录

Find The Determinant III

source

code

Takahashi’s Basics in Education and Learning

source

code

线性代数问卷调查反馈——Find The Determinant III，Takahashi‘s Basics in Education and Learning相关推荐

最新文章

热门文章