Difference between revisions of "Oxx1108"

From EOJ Wiki
Jump to navigation Jump to search
(Created blank page)
 
Line 1: Line 1:
 +
== Trainings ==
  
 +
=== Complete Status (Team Sessions Only) ===
 +
 +
{| class="wikitable" style="text-align:center;"
 +
! scope="col"|Name
 +
! scope="col"|Solved
 +
! scope="col"|A
 +
! scope="col"|B
 +
! scope="col"|C
 +
! scope="col"|D
 +
! scope="col"|E
 +
! scope="col"|F
 +
! scope="col"|G
 +
! scope="col"|H
 +
! scope="col"|I
 +
! scope="col"|J
 +
! scope="col"|K
 +
! scope="col"|L
 +
! scope="col"|M
 +
|-
 +
! scope="row"|[[2017 Benelux Algorithm Programming Contest (BAPC 17)]]
 +
|Done
 +
|O
 +
 +
|O
 +
|O
 +
|O
 +
|O
 +
 +
 +
|O
 +
 +
|O
 +
|O
 +
|O
 +
|-
 +
! scope="row"|[[Andrew Stankevich Contest 45 (ASC 45)]]
 +
|7/11
 +
|O
 +
|O
 +
 +
|O
 +
 +
|O
 +
 +
 +
 +
 +
|O
 +
|-
 +
! scope="row"|[[2015-2016 Nizhny Novgorod SU Contest]]
 +
|7/9
 +
 +
|O
 +
|O
 +
 +
 +
|O
 +
 +
|O
 +
 +
|-
 +
! scope="row"|[[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
 +
 +
=== ITMO Chinese Winter Camp (2018) ===
 +
 +
Transferred complete. Raw problems and solution slides are not published here, due to possible use of future trainings. But you can always find them on the Internet. :)
 +
 +
* Day 1 (problems solutions)
 +
* Day 2 (problems solutions)
 +
* Day 3 (problems solutions)
 +
* Day 4 (problems solutions)
 +
* Day 5 (problems solutions)
 +
* Day 6 (problems solutions)
 +
 +
=== 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 ([http://codeforces.com/gym/101666 contest] [[Media:Bapc2017problems.pdf|problems]] [[Media:Bapc2017solutions.pdf|solution]])
 +
* Week 2: ASC 45 ([http://codeforces.com/gym/100520 contest] [[Media:Asc45problems.pdf|problems]] [[Media:Asc45analysis.pdf|analysis]])
 +
* Week 3: 2015-2016 Nizhny Novgorod SU Contest ([http://codeforces.com/gym/100960 contest] [[Media:Nizhny2016editorial.pdf|editorial]])
 +
* Week 4: ACM ICPC World Finals 2013 ([https://vjudge.net/contest/218389 contest] [[Media:Finals2013solutions.pdf|solution]])
 +
* Week 5: 2015-2016 Makoto rng_58 Soejima Сontest 4 ([http://codeforces.com/gym/100959 contest] [http://clatisus.com/2015-2016%20Petrozavodsk%20Winter%20Training%20Camp,%20Makoto%20rng_58%20Soejima%20Contest%204 team report 1] [https://wiki-ascender.icpc-camp.org/2016_WTC_MRS team report 2])
 +
 +
Plans (possibly options in the future):
 +
 +
* NEERC 2016 ([http://codeforces.com/gym/101190 contest])
 +
* Asia Daejeon 2017 ([http://codeforces.com/gym/101667 contest])

Revision as of 11:28, 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 Ø O · · · · O
2015-2016 Nizhny Novgorod SU Contest 7/9 Ø O 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

ITMO Chinese Winter Camp (2018)

Transferred complete. Raw problems and solution slides are not published here, due to possible use of future trainings. But you can always find them on the Internet. :)

  • Day 1 (problems solutions)
  • Day 2 (problems solutions)
  • Day 3 (problems solutions)
  • Day 4 (problems solutions)
  • Day 5 (problems solutions)
  • Day 6 (problems solutions)

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...

Plans (possibly options in the future):