Another Contest 6 Problem 9 - Obligatory Wood IV Problem

View as PDF
Submit solution
Points: 0 (partial)
Time limit: 1.0s
Memory limit: 1K
Problem type

A frequent complaint about programming contests is that the problems are too hard. This makes competitors upset.

It is the goal of this problem to make a problem which hopefully anyone can solve.

How do you produce a problem which anyone can solve? The way to do so is to make the problem as accessible as possible. If we look at the solved.ac ranking model, we can see that all topics have a lower bound on their difficulty. For example, problems which require knowledge of strings must be rated at least bronze II, problems which require knowledge of loops must be rated at least bronze III, and problems which require knowledge of conditional statements must be rated at least bronze IV.

The easiest problems are rated bronze V, but generally assume knowledge of I/O. However, they also have some other implicit assumptions, such as the ability to write programs that compile or the ability to read and comprehend a problem statement.

This problem has been designed in a way that it should be solvable by anyone who is capable of making a submission to this problem, which we lower bound at Wood IV.

The problem author would like to thank Ninjaclasher for providing assistance in making this problem a reality.

Comments


  • 1
    WenhanZhang  commented on Oct. 19, 2024, 5:03 p.m.

    You can get an error by aborting the program


    • 0
      dchoo333  commented on Oct. 27, 2024, 11:26 a.m.

      Wait actually how did you do that... the question judges so fast the Abort button doesn't even show up for me


  • 0
    Millenia  commented on Sept. 14, 2024, 9:38 p.m.

    Genuinely took me so much brain power


  • 0
    22KamilMazur  commented on Feb. 21, 2024, 2:28 p.m. ← edit 3

    hello


  • -11
    Wenhan_Zhang  commented on Jan. 28, 2024, 11:26 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


  • -7
    kevinduan2041  commented on Jan. 17, 2024, 11:05 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


  • -6
    Shark_tom_555  commented on Feb. 16, 2023, 1:03 a.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


  • 0
    ryanshi  commented on Dec. 28, 2022, 6:24 p.m.

    ez


  • -16
    gavin_chen  commented on April 3, 2022, 8:22 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


  • -21
    gavin_chen  commented on March 20, 2022, 6:37 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


  • -5
    Code  commented on Jan. 16, 2022, 2:10 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


  • 2
    Jinx  commented on Oct. 20, 2021, 12:50 a.m.

    does aborting a submission even work here


    • 10
      wleung_bvg  commented on Nov. 25, 2021, 10:39 p.m. ← edit 2

      Yes. Because of how fast this problem judges, what you need to do is have other submissions to other problems hold up the DMOJ judging queue (might need some friends to help since you can only have 2 submissions running in the queue at one time and there are 3 judges). That will give you enough time to click the abort button while the submission is still in the queue.

      Edit: it was now rejudged to AC :(


      • 3
        Jinx  commented on Dec. 2, 2021, 1:52 a.m. ← edit 3

        time to grind for temporary DMOJ flex

        edit: ez I broke the question

        edit 2: never mind


  • 6
    pjkda1da  commented on Aug. 25, 2021, 4:50 p.m. ← edit 2

    Umm.... I don't see an actual question. Just a goal statement about the accessability of computer problems. What am I missing? -- Later edit: OK, I got it solved now :-)


  • 39
    Bobbychuck12  commented on May 11, 2021, 7:27 p.m.

    The hardest problem