SOR algorithm for solving linear equations, c++, numerical methods

刚才没注意，上传的是.c文件，重新上传，忘谅解！ 精确计算N的N次方，并完整显示结果！-just did not know, upload yes. C document, re-upload, forget understanding! N precise calculation of the N-th power and integrity of the result will be displayed!

精通matlab-proficient in Matlab

求行列式的代码，用了递归算法，要求行列式的元素为整型数据-Determinant for the code, with a recursive algorithm, the requirements for the integer determinant element data

采用了基本的蚁群算法来求解0-1背包问题，该算法不仅可以对0-1背包问题进行求解，还可以对多维背包问题进行求解。-Using the basic ant colony algorithm to solve the 0-1 knapsack problem, the algorithm not only for the 0-1 knapsack problem can be solved, but also multi-dimensional knapsack problem can be solved.

&此代码用于Dijkstra算法

动态规划的投资问题，c++方法，可参考，试过能用-Dynamic programming of investment issues, c++ Way of reference, never use

运筹学之模式搜索法及游泳问题！-tacticians search patterns and swimming!

#include < stdio.h > #include < stdlib.h > int main) { char str [20] ； printf ("Digite uma stringn"） ； setbuf(stdin,NULL) ； gets(str) ； int i; 为 (我 = 0 ； 我 < 4; i + +) { printf("%c",str[i]) ； } 返回 0 ； }

ACM大学生程序设计竞赛广东省赛2005年赛题-ACM Collegiate Programming Contest in Guangdong Province tournament title game in 2005

C++ split函数，可以实现字串的分割。可自定义分割符号，方便在编程时使用，根据需求设定分割字符或字符串均可。实用测试正常。