CSUST_搜索专题:
| Problem A | POJ 2488 | A Knight's Journey |
| Problem B | POJ 3083 | Children of the Candy Corn |
| Problem C | POJ 3009 | Curling 2.0 |
| Problem D | POJ 1321 | 棋盘问题 |
| Problem E | POJ 2251 | Dungeon Master |
| Problem F | POJ 3278 | Catch That Cow |
| Problem G | POJ 1426 | Find The Multiple |
| Problem H | POJ 3126 | Prime Path |
| Problem I | POJ 3087 | Shuffle'm Up |
| Problem J | POJ 3414 | Pots |
| Problem K | POJ 2531 | Network Saboteur |
| Problem L | POJ 1416 | Shredding Company |
| Problem M | POJ 2676 | Sudoku |
| Problem N | POJ 1129 | Channel Allocation |
CSUST_hash 及二分法:
| Problem A | POJ 3349 | SnowflakeSnowSnowflakes |
| Problem B | POJ 3274 | Gold Balanced Lineup |
| Problem C | POJ 2151 | Check the difficulty of problems |
| Problem D | POJ 1840 | Eqs |
| Problem E | POJ 2002 | Squares |
| Problem F | POJ 2503 | Babelfish |
| Problem G | POJ 3273 | Monthly Expense |
| Problem H | POJ 3258 | River Hopscotch |
| Problem I | POJ 1905 | Expanding Rods |
| Problem J | POJ 3122 | Pie |
CSUST_数论:
| Problem A | POJ 1067 | 取石子游戏 |
| Problem B | POJ 1183 | 反正切函数的应用 |
| Problem C | POJ 1430 | Binary Stirling Numbers |
| Problem D | POJ 2888 | Magic Bracelet |
| Problem E | POJ 1006 | Biorhythms |
| Problem F | POJ 1014 | Dividing |
| Problem G | POJ 1023 | The Fun Number System |
| Problem H | POJ 1061 | 青蛙的约会 |
| Problem I | POJ 1152 | An Easy Problem! |
| Problem J | POJ 1730 | Perfect Pth Powers |
| Problem K | POJ 2262 | Goldbach's Conjecture |
CSUST_contest1 :
| Problem A | HDU 1228 | A+B |
| Problem B | HDU 2605 | Snake |
| Problem C | POJ 2388 | Who's in the Middle |
| Problem D | POJ 3252 | Round Numbers |
| Problem E | POJ 2586 | Y2K Accounting Bug |
| Problem F | POJ 1836 | Alignment |
| Problem G | HDU 1088 | Write aimple HTML Browser |
| Problem H | POJ 3258 | River Hopscotch |
CSUST_计算几何:
| Problem A | POJ 1113 | Wall |
| Problem B | POJ 2007 | Scrambled Polygon |
| Problem C | POJ 3130 | How I Mathematician Wonder What You Are! |
| Problem D | POJ 1654 | Area |
| Problem E | POJ 1039 | Pipe |
| Problem F | POJ 1319 | Pipe Fitters |
| Problem G | POJ 1473 | There's Treasure Everywhere! |
| Problem H | POJ 1927 | Area in Triangle |
| Problem I | POJ 1005 | I Think I Need a Houseboat |
| Problem J | POJ 1106 | Transmitters |
| Problem K | POJ 1971 | Parallelogram Counting |
| Problem L | POJ 2208 | Pyramids |
| Problem M | POJ 2398 | Toy Storage |
| Problem N | POJ 2318 | TOYS |
CSUST_最小生成树和最短路径:
| Problem A | Truck History | |
| Problem B | Agri-Net | |
| Problem C | Highways | |
| Problem D | 昂贵的聘礼 | |
| Problem E | Frogger | |
| Problem F | Stockbroker Grapevine | |
| Problem G | Arbitrage | |
| Problem H | Borg Maze | |
| Problem I | Currency Exchange | |
| Problem J | Minimum Cost | |
| Problem K | Wormholes | |
| Problem L | Dijkstra, Dijkstra. |
本博客汇总了CSUST算法题集,包括搜索专题、hash及二分法、数论、计算几何等多个方向的经典题目,每部分精选了若干问题,并提供了对应的在线评测平台链接。
382

被折叠的 条评论
为什么被折叠?



