Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

MladenP's blog

By MladenP, history, 3 years ago, In English

Since a new season of COCI (Croatian Open Competition in Informatics) started last saturday, here is the first in a series of COCI appreciation posts (I will post one after each COCI round, so six in total!). For my coaching, I went through all COCI contests since 2006 to gather tasks and selected some of my favorite ones.

Notes

  • I skipped a lot of the really hard tasks because they weren't useful for my students. I kept a list of these tasks, if someone wants it, they can PM me. Also, I only considered COCI, not COI. This current season is not being considered.
  • There are many great tasks outside of the 48 shown (throughout the series), so it's worth it to go through other tasks as well. I have selected just my favorite ones.
  • These tasks are maybe not always the most innovative, I have selected the tasks that are most useful for coaching and learning new ideas, so for people who already know the idea, the difficulty might be much lower. Still, there are some really interesting tasks.
  • You can do these tasks either individually or as a virtual contest. There is a lot of them, so I wouldn't recommend less than 3h.
  • The notes are meant for coaches, to know if they can use that task for a lecture that they are preparing. They can also serve as hints for competitors (but sometimes they just give out the solution). Both the tags and the notes should be considered spoilers.
  • The given difficulty ranges might be completely wrong as I might be out of touch with the easier grades, they are just given as a loose guide.
  • Most solutions can be found on the official site by looking up the appropriate season and contest. If not, I'll try to provide the best resource I can.
  • Let me know if you know some missing info (author/author cf handle).

Tasks

A: 2015/2016, Contest 4: Deathstar

Author: Dominik Gleich (Dgleich)

Tags:

Spoiler

Note:

Spoiler

Difficulty range: 1100-1300

B: 2013/2014, Contest 1: Organizator

Author: Domagoj Ćevid

Tags:

Spoiler

Note:

Spoiler

Difficulty range: 1300-1500

C: 2017/2018, Contest 5: Birokracija

Author: Ivan Zufić (falanga)

Solution (thanks bmerry)

Tags:

Spoiler

Note:

Spoiler

Difficulty range: 1400-1600

D: 2009/2010, Contest 7: Svemir

Author: Goran Žužić (Zuza)

Tags:

Spoiler

Note:

Spoiler

Difficulty range: 1600-1800

E: 2014/2015, Contest 6: Kratki

Author: Dominik Gleich (Dgleich)

Tags:

Spoiler

Note:

Spoiler

Difficulty range: 1600-1800

F: 2019/2020, Contest 6: Index

Author: Marin Kišić (mkisic)

Tags:

Spoiler

Note:

Spoiler

Difficulty range: 2100-2300

H: 2016/2017, Contest 1: Vještica

Author: Dominik Gleich (Dgleich)

Tags:

Spoiler

Note:

Spoiler

Difficulty range: 2200-2400

I hope you find these tasks useful!

  • Vote: I like it
  • +237
  • Vote: I do not like it

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by MladenP (previous revision, new revision, compare).

»
3 years ago, # |
  Vote: I like it +74 Vote: I do not like it

I love this idea, please keep going! It will be very useful for both students and teachers.

  • »
    »
    3 years ago, # ^ |
      Vote: I like it +61 Vote: I do not like it

    Thank you, I'm glad you like it! There's definitely many more tasks I want to showcase, maybe later even from some other sources, so definitely not stopping soon :)

»
3 years ago, # |
  Vote: I like it +24 Vote: I do not like it

mkisic KILE ANIMAL

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Please make a recent update, The problems are excellent!

  • »
    »
    6 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks! :) I did kind of slack off after the second iteration. I was thinking to maybe return it as a Youtube series in abit.. we'll see!

»
6 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

As erering I can confirm these are W problems