Difference between revisions of "Competitive Programming: For All (2019)"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
|||
| Line 30: | Line 30: | ||
2019.3.3 [[https://codeforces.com/group/ki6jEDpY8g/contest/239479 Training 01: Graphs, Shortest Paths, Flows]] [[https://codeforces.com/group/ki6jEDpY8g/blog/entry/4075 solutions]] | 2019.3.3 [[https://codeforces.com/group/ki6jEDpY8g/contest/239479 Training 01: Graphs, Shortest Paths, Flows]] [[https://codeforces.com/group/ki6jEDpY8g/blog/entry/4075 solutions]] | ||
| + | |||
| + | 2019.3.10 [[http://codeforces.com/group/ki6jEDpY8g/contest/240026 Training 02: Greedy Algorithms]] | ||
Revision as of 08:16, 7 March 2019
Announcement
Schedule
For all: Wednesday, Week 2 - ?
For beginers: Sunday, Week 2 - ?
Selections
2018.12.26 [2019 XCPC Newbie Selection #1 (South Pacific ICPC Regional Finals 2018)]
- Prepared by F0RE1GNERS.
2019.1.2 [2019 XCPC Newbie Selection #2 (Nordic Collegiate Programming Contest 2018)] [solutions]
- Prepared by Xiejiadong.
2019.2.22 [2019 ECNU XCPC February Selection] [solutions]
- Prepared by Xiejiadong and Kilo_5723.
2019.2.27 [2019 ECNU XCPC March Selection #1] [solutions]
- Prepared by Xiejiadong.
2019.3.6 [2019 ECNU XCPC March Selection #2] [solutions]
- Prepared by Kilo_5723.
2019.3.13 [[]]
- Prepared by Weaver_zhu.
Exercises
2019.3.3 [Training 01: Graphs, Shortest Paths, Flows] [solutions]
2019.3.10 [Training 02: Greedy Algorithms]