文件名称:acm_code
介绍说明--下载内容均来自于网络,请自行研究使用
ACM资料大集合,超多关于ACM的资料,全是很经典的,要是把这个全搞定,肯定是金奖!-ACM large collection of information, ultra more information on ACM, the whole is very classic, and if to get the whole is definitely gold!
(系统自动生成,下载前可以参看下载内容)
下载文件列表
文件名 | 大小 | 更新时间 |
---|---|---|
acm_code | ||
........\ACM答案 | ||
........\.......\Magic Bitstrings有答案.doc | ||
........\.......\Parencodings答案.doc | ||
........\.......\有答案Immediate Decodability.doc | ||
........\.......\有答案So You Want to Be a (2^n)-Aire.doc | ||
........\.......\答案Geometry Made Simple .doc | ||
........\.......\答案Yellow Code.doc | ||
........\GG_rr_sg | ||
........\........\update.log | ||
........\........\其他 | ||
........\........\....\分数.txt | ||
........\........\....\大数(整数类封装).txt | ||
........\........\....\日期.txt | ||
........\........\....\矩阵.txt | ||
........\........\....\线性方程组(gauss).txt | ||
........\........\....\线性相关.txt | ||
........\........\几何 | ||
........\........\....\三维几何.txt | ||
........\........\....\三角形.txt | ||
........\........\....\几何公式.txt | ||
........\........\....\凸包(graham).txt | ||
........\........\....\圆.txt | ||
........\........\....\多边形.txt | ||
........\........\....\多边形切割.txt | ||
........\........\....\整数函数.txt | ||
........\........\....\注意.txt | ||
........\........\....\浮点函数.txt | ||
........\........\....\球面.txt | ||
........\........\....\网格(pick).txt | ||
........\........\....\面积.txt | ||
........\........\列表.txt | ||
........\........\图论_NP搜索 | ||
........\........\...........\最大团(n小于64)(faster).txt | ||
........\........\...........\最大团.txt | ||
........\........\图论_匹配 | ||
........\........\.........\一般图匹配(正向表形式).txt | ||
........\........\.........\一般图匹配(邻接表形式).txt | ||
........\........\.........\一般图匹配(邻接表形式 | 邻接阵接口).txt | |
........\........\.........\一般图匹配(邻接阵形式).txt | ||
........\........\.........\二分图最佳匹配(kuhn_munkras邻接阵形式).txt | ||
........\........\.........\二分图最大匹配(hungary正向表形式).txt | ||
........\........\.........\二分图最大匹配(hungary邻接表形式).txt | ||
........\........\.........\二分图最大匹配(hungary邻接表形式 | 邻接阵接口).txt | |
........\........\.........\二分图最大匹配(hungary邻接阵形式).txt | ||
........\........\图论_应用 | ||
........\........\.........\前序表转化.txt | ||
........\........\.........\拓扑排序(邻接阵形式).txt | ||
........\........\.........\最佳边割集.txt | ||
........\........\.........\最佳顶点割集.txt | ||
........\........\.........\最小路径覆盖.txt | ||
........\........\.........\最小边割集.txt | ||
........\........\.........\最小顶点割集.txt | ||
........\........\.........\树的优化算法.txt | ||
........\........\.........\欧拉回路(邻接阵形式).txt | ||
........\........\图论_支撑树 | ||
........\........\...........\最小树形图(邻接阵形式).txt | ||
........\........\...........\最小生成树(kruskal正向表形式).txt | ||
........\........\...........\最小生成树(kruskal邻接表形式).txt | ||
........\........\...........\最小生成树(prim+binary_heap正向表形式).txt | ||
........\........\...........\最小生成树(prim+binary_heap邻接表形式).txt | ||
........\........\...........\最小生成树(prim+mapped_heap正向表形式).txt | ||
........\........\...........\最小生成树(prim+mapped_heap邻接表形式).txt | ||
........\........\...........\最小生成树(prim邻接阵形式).txt | ||
........\........\图论_最短路径 | ||
........\........\.............\最短路径(单源bellman_ford邻接阵形式).txt | ||
........\........\.............\最短路径(单源dijkstra+binary_heap正向表形式).txt | ||
........\........\.............\最短路径(单源dijkstra+binary_heap邻接表形式).txt | ||
........\........\.............\最短路径(单源dijkstra+mapped_heap正向表形式).txt | ||
........\........\.............\最短路径(单源dijkstra+mapped_heap邻接表形式).txt | ||
........\........\.............\最短路径(单源dijkstra_bfs正向表形式).txt | ||
........\........\.............\最短路径(单源dijkstra_bfs邻接表形式).txt | ||
........\........\.............\最短路径(单源dijkstra邻接阵形式).txt | ||
........\........\.............\最短路径(多源floyd_warshall邻接阵形式).txt | ||
........\........\图论_网络流 | ||
........\........\...........\上下界最大流(邻接表形式).txt | ||
........\........\...........\上下界最大流(邻接阵形式).txt | ||
........\........\...........\上下界最小流(邻接表形式).txt | ||
........\........\...........\上下界最小流(邻接阵形式).txt | ||
........\........\...........\最大流(邻接表形式).txt | ||
........\........\...........\最大流(邻接表形式 | 邻接阵接口).txt | |
........\........\...........\最大流(邻接阵形式).txt | ||
........\........\...........\最大流无流量(邻接阵形式).txt | ||
........\........\...........\最小费用最大 |