摘要：#include using namespace std; const int maxn = 1000; int n; double a[maxn][maxn]; double b[maxn]; void gaussin() { int Flg = -1,i,j,k; //判断方程组是否有解:0无解、1有唯一解、2有无穷解 double ... 阅读全文

摘要：Lanterns Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2534 Accepted Submission(s): 996 Problem 阅读全文

摘要：相关博客 https://blog.csdn.net/cheneyshark/article/details/78735987 https://blog.csdn.net/cheneyshark/article/details/78751550 https://blog.csdn.net/pengw 阅读全文