Bullet's blog

Invitation to SeriousOJ Happy New Year Round (Tuesday 6 January, Rated for all)
By Bullet, history, 9 months ago, In English

We're thrilled to invite you to participate in our upcoming Happy New Year 2026 programming contest at SeriousOJ.

Special thanks to CLown1331, owner of SeriousOJ.

Update 1: Time extended by 15 minutes.

Update 2: Congrats to the winners!

  1. physics0523

  2. zanj0

  3. hieptk

  4. drydock

  5. buko

Update 3 : Editorial

Registration: Please register for the contest on SeriousOJ. If you encounter any issues on the register, be sure to check your spam folder for the confirmation email.

Good luck & Have fun!!!

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

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

After a long time, we finally have a SeriousOJ round.

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

New year new contest. Happy coding :D

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Contest after a long time. Perfect way to start the year. Thanks SeriousOJ and our Senior brothers.

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Really excited to participate in this contest!

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Was eagerly waiting for this. Thanks to SeriousOJ and our senior brothers for arranging the round.

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Grateful to our seniors and SeriousOJ for organizing this. Excited to participate.

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

GL to all!!!

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Best of luck to all.

→ Reply
»
9 months ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

Reminder : only 15 minutes left to start the contest.

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

How to do Problem E ;-;

→ Reply
  • »
    »
    9 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    We will publish the full editorial for all problems on our website tomorrow, and the website link will be added to this blog post.

    For Problem E, the task reduces to a classic 0-1 Knapsack (subset sum) problem. A standard DP solution may result in TLE due to constraints, so an optimised bitset-based DP should be used to pass within time limits.

    → Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

enjoyed the problems!

→ Reply
  • »
    »
    9 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Glad to hear that you enjoyed the round. Thank you for participating in this contest. Stay connected with us for our upcoming educational rounds, we will provide even more interesting problems.

    → Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Good problem set. Thank you. :)

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply