Difference between revisions of "Oxx1108"
Jump to navigation
Jump to search
Line 23: | Line 23: | ||
|Done | |Done | ||
|O | |O | ||
− | | | + | |· |
|O | |O | ||
|O | |O | ||
Line 38: | Line 38: | ||
! scope="row"|[[Andrew Stankevich Contest 45 (ASC 45)]] | ! scope="row"|[[Andrew Stankevich Contest 45 (ASC 45)]] | ||
|7/11 | |7/11 | ||
− | |||
|O | |O | ||
|Ø | |Ø | ||
+ | |· | ||
|O | |O | ||
|Ø | |Ø | ||
Line 48: | Line 48: | ||
|· | |· | ||
|· | |· | ||
− | | | + | |! |
|- | |- | ||
! scope="row"|[[2015-2016 Nizhny Novgorod SU Contest]] | ! scope="row"|[[2015-2016 Nizhny Novgorod SU Contest]] | ||
|7/9 | |7/9 | ||
− | | | + | |· |
|O | |O | ||
|O | |O | ||
|· | |· | ||
− | | | + | |· |
|O | |O | ||
+ | |· | ||
|Ø | |Ø | ||
− | |||
|· | |· | ||
|- | |- |
Revision as of 11:31, 26 March 2018
Trainings
Complete Status (Team Sessions Only)
Name | Solved | A | B | C | D | E | F | G | H | I | J | K | L | M |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2017 Benelux Algorithm Programming Contest (BAPC 17) | Done | O | · | O | O | O | O | Ø | Ø | O | Ø | O | O | O |
Andrew Stankevich Contest 45 (ASC 45) | 7/11 | O | Ø | · | O | Ø | O | · | · | · | · | ! | ||
2015-2016 Nizhny Novgorod SU Contest | 7/9 | · | O | O | · | · | O | · | Ø | · | ||||
ACM ICPC World Finals 2013 | 4/11 | ! | · | · | O | · | O | · | Ø | · | Ø | · |
Comment:
- O for passing during the contest
- Ø for passing after the contest
- ! for attempted but failed
- · for having not attempted yet
Weekend Trainings (Spring 2018)
First time training in spring ever...
I will (try to) announce the training problems a couple of days before the contest. If you have seen this contest or done some of the problems, please let me know...
- Week 1: BAPC 17 (contest problems solution)
- Week 2: ASC 45 (contest problems analysis)
- Week 3: 2015-2016 Nizhny Novgorod SU Contest (contest editorial)
- Week 4: ACM ICPC World Finals 2013 (contest solution)
- Week 5: 2015-2016 Makoto rng_58 Soejima Сontest 4 (contest team report 1 team report 2)
Plans (possibly options in the future):