newhonor

https://ac.nowcoder.com/acm/contest/949/I 总结：高斯消元；A[i][j] 表示第i个方程第j个未知数的系数；n+1是常数项； #include <iostream> #include <cstring> #include <queue> #include <vector> #include <al...

https://www.cometoj.com/contest/59/problem/E?problem_id=2714 思路：高斯消元求dp[1]~dp[k-1];然后利用递推式矩阵快速幂求出dp[d]； #include <iostream> #include <cstring> #include <queue> #include &...