UshanGhosh's blog

Invitation to the Replay of ShellBeeHaken Presents Intra SUST Programming Contest 2024
By UshanGhosh, 5 months ago, In English

Hello, Codeforces!

We are thrilled to invite you to participate in the ShellBeeHaken Presents Intra SUST Programming Contest 2024 — Replay which will be held on [contest_time:527993].

You'll be given $$$13$$$ problems and $$$5$$$ hours to solve them. The contest will follow standard ICPC rules.

The problems were authored and prepared by UshanGhosh, SajidZakaria, AlveRahman, Raiden, Knight_of_Nineteen, YouKn0wWho,nh_nayeem, Alfeh, ammelid and MNnazrul.

We tried to create engaging problems with compact statements. Hopefully, the participants, with a rating of less than $$$2100$$$, will find the problems interesting. Shoutout to our sponsor ShellBeeHaken for collaborating with us to make the flagship contest of SUST a success.

UPD: The registration is open now. You can register here.

Editorial is out now.

Congratulations to the winners.

Place Participant Problem solved =
1 aryak05, kkkk1234, nandhagk1729 12 1093
2 Krypto_Ray, _gyrFalcon_, Coder_Nayak 10 920
3 shobyy, ShreyHehe, Shashwat_skr 10 1003
4 fahimcp495, amirhozaifa 10 1129
5 serialcomder 10 1241
  • Vote: I like it
  • +47
  • Vote: I do not like it

»
5 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Khela hobe

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

wow

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

Individual or team?

→ Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    You can do both.

    Team preferred as it's a 5 hour contest.

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

Where should I register ?

→ Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    The registration will open 6 hours before the contest starts. You can register using the url in the contest name, or check the UPD.

    → Reply
»
5 months ago, # |
  Vote: I like it +3 Vote: I do not like it

How to become purple.It feels so hard.

→ Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it +2 Vote: I do not like it
    • Solve harder problems.
    • Try not to do the same mistakes.
    • Virtual contests

    You'll go there, keep pushing.

    → Reply
»
5 months ago, # |
← Rev. 2   Vote: I like it +6 Vote: I do not like it

As a tester, I can assure you that the problems are indeed interesting and challenging. Happy coding!

→ Reply
»
5 months ago, # |
  Vote: I like it +2 Vote: I do not like it

Excited to know which problems were authored by YouKn0wWho

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

Enjoyed the contest. Will there be any editorial?

→ Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it +7 Vote: I do not like it

    Yes, we will publish the editorial as soon as possible.

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

Will editorial be provided for the contest ??

→ Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it
Spoiler
→ Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it
how to solve B help me pls
→ Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    From the given array you can create an array b where b[i] is the number of problems solved in i-th day.

    Then just find the maximum length sub-array where all b[i] > 0

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

    You can create the array B number of problems solved on each day

    B[0]=a[0], for (i<k) b[i]=a[i]-a[i-1] and for rest b[i]=a[i]+b[i-k]-a[i-1] (since a[i] stores data of last k days only)

    → Reply
»
5 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Will we get any editorial for the contest? Overall, nice problemset!

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

can not view others submission after AC.

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

It's too challenging for me to solve.

→ Reply