Matjaz's blog

By Matjaz, history, 9 years ago, In English

There are lots of problems on Codeforces — and most of them will never be seen by most users of the site.

Share a problem you think more people should know about!

(It can be because it's fun, educational, interesting or any other reason.)

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

| Write comment?
»
9 years ago, hide # |
 
Vote: I like it +23 Vote: I do not like it

276C

Spoiler
»
9 years ago, hide # |
 
Vote: I like it -6 Vote: I do not like it

733C

Spoiler
»
9 years ago, hide # |
 
Vote: I like it +8 Vote: I do not like it

P1, P2, P3, P4

»
9 years ago, hide # |
 
Vote: I like it +16 Vote: I do not like it

706E - Working routine

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

    What I love about this is that it can only be solved for a 2D matrix, and not if it was an array of size $$$10^5$$$.

    So in a sense, there is no easy 1D variant of the problem.

»
9 years ago, hide # |
Rev. 3  
Vote: I like it -7 Vote: I do not like it

86D

Spoiler

321E

Spoiler

617E

Spoiler
»
9 years ago, hide # |
 
Vote: I like it +3 Vote: I do not like it
»
6 years ago, hide # |
Rev. 2  
Vote: I like it +6 Vote: I do not like it

484D - Kindergarten

Spoiler