# Awwwolf的從零開始的刷題之路
###### tags: `Awwwolf的刷題之路`
## 基哥ㄧ生推(這個很重要，信基哥大神，幫你會寫code)
這是真的！！
## 資料結構
### UVa problems Involving C++ STL map:
* UVa 10226 - Hardwood Species [這裡是code](https://hackmd.io/vq0hP-ZUSl64b0rYyF6S7A#UVA-10226---Hardwood-Species)
* UVa 10282 - Babelfish [這裡是code](https://hackmd.io/NeilhWs9SPeafPrJ009zFQ)
* UVa 11286 – Conformity //沒空重寫啦
### UVa problems Involving C++ STL set:
* UVa 00978 - Lemmings Battle! [這裡是code](https://hackmd.io/j3o36sKkSwS4qiVwBaRZeA)
* UVa 11136 - Hoax or what [這裡是code](https://hackmd.io/EUXAj07cRUK1sdY7ckSsUQ?both)
* UVa 11572 - Unique Snowflakes //總覺得可以用其他方法，我想想
### UVa problems Involving C++ STL list and deque:
* UVa 11988 - Broken Keyboard (a.k.a. Beiju Text) [這裡是code](https://hackmd.io/Zm-uZVLQSXGRIW7tadYNTw)
* UVa 12207 - That is Your Queue [這裡是code](https://hackmd.io/1crGW0RgSim3xBiPiT1wyA?both)
### UVa problems Involving C++ STL stack:
* UVa 00514 - Rails [這裡是code](https://hackmd.io/IKiXOgDeRuWL1uNyN0INkA?both)
* UVa 00732 - Anagrams by Stack
* UVa 01062 – Containers
### UVa problems Involving C++ STL queue:
* UVa 10172 - The Lonesome Cargo Distributor
* UVa 10901 - Ferry Loading III
* UVa 11034 - Ferry Loading IV
### DFS:
* UVa 00168 - Theseus and the Minotaur
* UVa 11906 - Knight in a War Grid
* UVa 12442 - Forwarding Emails
### Finding Articulation Points / Bridges:
* UVa 00315 - Network [這裡是code](https://hackmd.io/Llx6Ry75TuSyUr4Q1jUXrQ?both)
* UVa 00796 - Critical Links
* UVa 10765 - Doves and Bombs
### Topological Sort:
* UVa 00200 - Rare Order
* UVa 00872 - Ordering
* UVa 10305 - Ordering Tasks
### Finding Biconnected / Bridge Connected Components:
* UVa 01108 - Mining Your Own Business
* UVa 10972 - RevolC FaeLoN
### Finding Strongly Connected Components:
* UVa 00247 - Calling Circles
* UVa 11504 - Dominos
* UVa 11838 - Come and Go
### BFS:
* UVa 00429 - Word Transformation
* UVa 00924 - Spreading the News
* UVa 10653 - Bombs; NO they are Mines!!
### Minimum Spanning Tree:
* UVa 11228 - Transportation System
* UVa 11631 - Dark Roads
* UVa 11747 - Heavy Cycle Edges
### Dijkstra’s Algorithm
* UVa 00929 - Number Maze
* UVa 01112 - Mice and Maze
* UVa 10986 - Sending
### The Bellman-Ford Algorithm
* UVa 00558 - Wormholes
* UVa 10449 - Traffic
* UVa 10557 – XYZZY
### 期末上機考
* UVa 00673 - Parentheses Balance [這裡是code](/a9YgX3YBTci3OJHOvPQ-sQ)
* UVa 10972 - RevolC FaeLoN
### //還在整修ing
#### p.s.如果對你有幫助給我個讚賞吧www
Loading...
## 演算法
Longest Common Subsequences [這裡是題目，還加碼送code](https://hackmd.io/KtkfN9ASShq4R_p8W6nE4Q)
Minimum Spanning Tree [這裡是題目，還加碼送code](https://hackmd.io/mCTyKZE-TLWt493S567zwg)
### p.s.有空在弄詳細的思路啦，先丟各種演算法上來