IEEE UNSW SB Competitive Programming Workshop
This workshop is heavily based on Steve Halim's CP book.
- Group tools at github
- Since Session 05 to present, IEEE UNSW SB training is done via hackerrank contest
- Extra training via IEEE Xtreme past problems
Start using hackerrank platform
- Session 05: DP
- Session 06: Graphs Part 1
- Session 07: Graphs Part 2
Problem Sets (UVa)
✔ = done and available in github ✖ = not yet solved
| Session | Problem | Solved? | Description |
|---|---|---|---|
| 2 | UVa 12150 | simple array | |
| 2 | UVa 01610 | simple sort | |
| 2 | UVa 11308 | simple set | |
| 3 | UVa 00750 - 8 Queens Chess Problem | ✖ | |
| 3 | UVa 00386 - Perfect Cubes | ✖ | |
| 3 | UVa 12488 - Start Grid | ✖ | |
| 3 | UVa 11195 - Another n-Queen Problem | ✖ | |
| 3 | UVa 01193 | ✖ | |
| 3 | UVa 12190 | ✖ | |
| 4 | UVa 11450 Wedding Shopping | ✖ | |
| 4 | UVa 10337 Flight Planner | ✖ | |
| 4 | UVa 11369 Shopaholic | ✖ | |
| 4 | UVa 10684 The Jackpot | ✖ | |
| 4 | UVa 10534 Wavio Sequence | ✖ | |
| 4 | UVa 10026 Shoemaker’s problem | ✖ | |
| 5 | UVa 10003 Cutting Sticks | ✔ | |
| 5 | Injured Queen | ✖ | |
| 5 | Dice Throwing | ✔ | |
| 5 | String Partition | ✖ | |
| 6 | UVa 11504 - Dominos | ✔ | Strongly connected components |
| 6 | UVa 00336 - A Node Too Far | ✖ | |
| 6 | UVa 11228 - Transportation system | ✖ | |
| 6 | UVa 12047 - Highest Paid Toll | ✔ | Single source shortest path |
| 7 | UVa 00820 Internet Bandwidth | ✔ | basic max flow problem |
| 7 | UVa 12644 Vocabulary | ✔ | classic maximal cardinality bipartite matching (MCBM) problem wrapped inside a creative problem statement |
| 8 | UVa 11879 - Multiple of 17 | ✔ | |
| 8 | UVa 10680 - LCM | ✖ | |
| 8 | UVa 10650 - Determinate Prime | ✔ | |
| 8 | UVa 11254 - Consecutive Integers | ✖ | |
| 8 | UVa 11231 - Black and white painting | ✖ |