dukig的博客

链接:http://www.51nod.com/Challenge/Problem.html#!#problemId=1265 把他们转化为行列式 #include<stdio.h> #include<string.h> int main() { int i,j,k,t,n,x1,x2,x3,x4,y1,y2,y3,y4,z1,z2,z3,z4,r1,r2,r...

链接:http://www.51nod.com/Challenge/Problem.html#!#problemId=1256 #include<iostream> using namespace std; void egcd(long long a,long long b,long long &x,long long &y){ if(b == 0){ x ...

链接:http://www.51nod.com/Challenge/Problem.html#!#problemId=1242 矩阵快速幂说白了就是用矩阵找规律+快速幂乘矩阵 #include<iostream> #include<algorithm> #include<cstdio> #include<cstring> using names...

链接:http://www.51nod.com/Challenge/Problem.html#!#problemId=1185 本来威佐夫博弈只用a*(sqrt(5)+1)/2就行了，可这题精度太高，必须将0.618的精度再扩大很多倍 #include <iostream> #include <cstdio> #include <cstring> #inc...

链接:http://www.51nod.com/Challenge/Problem.html#!#problemId=1130 特林公式以及本题参考代码:https://blog.youkuaiyun.com/qq_41003528/article/details/82840908 #include<iostream> #include<algorithm> #include&l...