基础算法文章总目录[转]
本文的博主致力于基础算法的学习与研究,文章每字每句都经过仔细斟酌。如果您对算法或C++/STL感兴趣,相信随便看看也会有所收获!
OJ Problems
OJ解题志
- 关于OJ系列文章的说明
- 转载:UVa OJ全部题目列表(按难度分级,仅标题)
- ZOJ 1002 - Fire Net
- UVa OJ 100 - The 3n + 1 problem (3n + 1问题)
- UVa OJ 101 - The Blocks Problem (积木问题)
- UVa OJ 102 - Ecological Bin Packing (生态学装箱问题)
- UVa OJ 103 - Stacking Boxes (嵌套盒子)
- UVa OJ 105 - The Skyline Problem (地平线问题)
- UVa OJ 106 - Fermat vs. Pythagoras (费马对毕达哥拉斯)
- UVa OJ 107 - The Cat in the Hat (戴帽子的猫)
- UVa OJ 108 - Maximum Sum (最大和)
- UVa OJ 109 - SCUD Busters (SCUD重磅炸弹)
- UVa OJ 110 - Meta-Loopless Sorts (无循环-元排序)
- UVa OJ 111 - History Grading (历史成绩评定)
- UVa OJ 112 - Tree Summing (树的求和)
- UVa OJ 113 - Power of Cryptography (密文的乘方)
- UVa OJ 114 - Simulation Wizardry (模拟弹珠台)
- UVa OJ 115 - Climbing Trees (家谱树)
- UVa OJ 116 - Unidirectional TSP (单向旅行商问题)
- UVa OJ 117 - The Postal Worker Rings Once (让邮差只走一圈)
- UVa OJ 118 - Mutant Flatworld Explorers (变体扁平世界探索器)
- UVa OJ 119 - Greedy Gift Givers (贪婪的送礼者)
- UVa OJ 120 - Stacks of Flapjacks (烙饼叠)
- UVa OJ 121 - Pipe Fitters (装管子)
- UVa OJ 122 - Trees on the level (分层树)
- UVa OJ 123 - Searching Quickly (快速查找)
- UVa OJ 124 - Following Orders (保持有序)
- UVa OJ 125 - Numbering Paths (路径计数)
- UVa OJ 126 - The Errant Physicist (粗心的物理学家)
- UVa OJ 127 - "Accordian" Patience (“手风琴”纸牌)
- UVa OJ 128 - Software CRC (软件CRC)
- UVa OJ 129 - Krypton Factor (氪因素)
- UVa OJ 130 - Roman Roulette (罗马轮盘赌)
- UVa OJ 132 - Bumpy Objects (倾覆的物体)
- UVa OJ 134 - Loglan-A Logical Language (Loglan逻辑语言)
- UVa OJ 135 - No Rectangles (没有矩形)
- UVa OJ 137 - Polygons (多边形)
- UVa OJ 139 - Telephone Tangles (话费之纠结)
- UVa OJ 142 - Mouse Clicks (鼠标点击)
- UVa OJ 143 - Orchard Trees (果树林)
- UVa OJ 147 - Dollars (钱币)
- UVa OJ 148 - Anagram checker (回文构词检测)
- UVa OJ 149 - Forests (森林)
- UVa OJ 150 - Double Time (双时间)
- UVa OJ 199 - Partial differential equations (偏微分方程)
- UVa OJ 571 - Jugs (罐子)
- UVa OJ 641 - Do the Untwist (解密工作)
- UVa OJ 732 - Anagrams by Stack (堆栈字迷)
Algorithms
算法
Advanced C++
进阶C++
作者:王雨濛;来源:《程序控》博客 -- http://www.cnblogs.com/devymex/ 此文章版权归作者所有(有特别声明的除外),转载必须注明作者及来源。您不能用于商业目的也不能修改原文内容。 |