Welcome to DSAA_LAB9! Enjoy this Lab!
It has twelve problems. Tow of them is bonus.
Easy problems: A(10), B(20), C(20), D(20), E(20).
Medium problems: F(45), G(35), H(30)
Hard problems: I(50), J(50)
Bonus problem: K(50), L(70)
Note: We give sample explanation for most of problems.
| Problem ID | Title | Source/Category | AC | Submit | |
| 1074 Problem A | Adjacency Matrix | Lab9 | 34 | 59 | |
| 1075 Problem B | Reachability Testing | Lab9 | 18 | 164 | |
| 1076 Problem C | Connected Regions | Lab9 | 21 | 72 | |
| 1077 Problem D | Minimum Bridge Cost | Lab9 | 11 | 87 | |
| 1078 Problem E | Students in CS203 | Lab9 | 15 | 56 | |
| 1079 Problem F | Course Selection | 9 | 36 | ||
| 1080 Problem G | Bob with Alice | Lab9 | 7 | 39 | |
| 1081 Problem H | Minimum Cycle Length | Lab9 | 8 | 11 | |
| 1084 Problem I | Break up | Lab9 | 8 | 24 | |
| 1083 Problem J | Convenience | Lab9 | 6 | 12 | |
| 1082 Problem K | The cheapest path | Lab9 | 3 | 20 | |
| 1085 Problem L | Proposition equivalence | Lab9 | 3 | 5 |