pooty's blog

Invitation to NUS CS3233 Final Team Contest 2023 Mirror
By pooty, 20 months ago, In English

logo

Hello, Codeforces community!

We are happy to invite you to participate in National University of Singapore (NUS) CS3233 Final Team Contest 2023 Mirror on Monday, April 10, 2023, at 09:35 UTC. CS3233 is a course offered by NUS to prepare students in competitive problem solving.

The contest is unofficial and will be held in Codeforces Gym. Standard ICPC rules (Unrated, ICPC Rules, Teams Preferred) apply. The contest is unrated. Note the unusual starting time.

The problems are written and prepared by user202729_, rama_pang, and pooty.

We would also like to thank:

  • Dr. Steven Halim for coordinating and teaching the CS3233 course;
  • user202729_ and rama_pang as teaching assistants;
  • stack.py (Pyqe, hocky, faustaadp) for testing the contest;
  • errorgorn for existing;
  • the Kattis team for the platform used in the CS3233 course and in the official contest;
  • Codeforces Headquarters for letting us announce on the main page; and finally
  • MikeMirzayanov for the amazing Codeforces and Polygon platform!

The contest will last for 5 hours and consist of 14 problems. While it is preferred to participate in a team, individual participation is also allowed.

The problems themselves may be quite standard as they are targeted toward those who have just learned competitive problem solving. However, we have also included a few challenging problems for stronger teams, such as ex-IOI or ICPC participants taking part in the course as well. So, the participants can expect a good mix of problems of varying difficulty levels, that we hope can be educational!

We hope you will enjoy and have fun in the contest. Good luck!

UPD: Contest is over! Editorial is up!

Congratulations to P+P+P (998kover, 244mhq, 353cerega) for the win!

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

Comments Comments (24)
| Write comment?
»
20 months ago, # |
  Vote: I like it +24 Vote: I do not like it

As a CS3233(R) student, I can say rama_pang user202729_ pooty orz and problems will definitely be great :)

All the best everyone and enjoy!

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

Interesting read: https://www.comp.nus.edu.sg/~stevenha/cs3233.html

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

As a (former) CS3233 student, give me contribution

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

I couldn't manage to notice the unusual start time :(

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

    It seems that the timing URL is broken if you are logged out. It should work if you log back in. The contest should be 10 April 2023, 9.35am UTC.

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

      Thanks!

      Strangely, I am logged in, and nevertheless the time is missing, both in English and Russian locales. Haven't noticed anything like that before...

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

        It seems because the gym contest is hidden until you click on the invitation link, it can't get the contest-time attribute from the contest-id. Fixed it by manually typing the date now (although now it can't auto-adjust the time shown to your local time).

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

Dr. Halim orz

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

Are students not part of NUS allowed to take CS 3233 courses online? Or any other courses for that matter?

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

    From Dr Halim: CS3233 course is currently closed for NUS students and Singapore IOI trainees only. However, Dr Halim has written "Competitive Programming Book" where he publicly shared many of CP techniques that are covered in this class. This is the first time the final contest is opened to the general public as a mirror contest while the official students are within the Internet firewall inside our programming lab.

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

      The book contains 3 parts right? Some recommend to do only 3rd.... Would you recommend me doing all 3 or the third one alone? Thank you so much for replying by the way...

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

        They are not three parts, but rather three editions of the same book. Now there is a fourth edition as well, which indeed have two separate parts, one containing basic topic in CP, another intermediate-advanced ones.

        → Reply
»
20 months ago, # |
  Vote: I like it -8 Vote: I do not like it

orz

→ Reply
»
20 months ago, # |
  Vote: I like it -21 Vote: I do not like it

I am a gay

→ Reply
  • »
    »
    20 months ago, # ^ |
      Vote: I like it -8 Vote: I do not like it

    Don't do fatherless activities here. This platform is for enthusiastic coders who solve problem on daily basis. Please don't ruin the environment Sir.

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

Where's the onsite scoreboard + is there going to be any kind of editorial?

I want to know how to solve L and K.

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

    Editorial is just released. The onsite scoreboard can be found here.

    → Reply
»
20 months ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

How to compute C(n-1,k-1) % P where n and k can be up to 10^18 and P is not prime, in either O(1) or O(log n) time (referring to problem C)

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

how to check for prime in M very fast ?

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

Wishing you all the best with your endeavors.

→ Reply