chokudai's blog

AtCoder Beginner Contest 266 Announcement
By chokudai, history, 21 month(s) ago, In English

We will hold AtCoder Beginner Contest 266.

The point values will be 100-200-300-400-500-500-600-600. We are looking forward to your participation!

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

Comments Comments (21)
| Write comment?
»
21 month(s) ago, # |
  Vote: I like it -9 Vote: I do not like it

As a contestant,I have registered for this contest as a Rated participant.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +11 Vote: I do not like it

Oh,I found C much more difficult than DEF. Maybe I'm not good at geometry:(

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it +25 Vote: I do not like it

    dw, it was same for me =)

    took me more time to do C than F

    → Reply
»
21 month(s) ago, # |
← Rev. 2   Vote: I like it +7 Vote: I do not like it

https://oeis.org/A181371 , when you find the sequence in OEIS but cant solve the problem cause you dont know how generating functions work.

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it -8 Vote: I do not like it

    which problem uses this ?

    → Reply
    • »
      »
      »
      21 month(s) ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      G i think, 012 <-> RGB

      however constraint on k is different

      → Reply
»
21 month(s) ago, # |
  Vote: I like it +3 Vote: I do not like it

How to Solve C?

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    You can just judge area ABC + area ACD == area ABD + area BCD

    → Reply
»
21 month(s) ago, # |
  Vote: I like it -29 Vote: I do not like it

Fuck

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +11 Vote: I do not like it

Why does this submission on problem G get WA?

My idea
→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone help me with problem D? I made a submission with a code that gives me the correct answer for the 3 sample test cases on my machine, but the online judge gives wildly different outputs and I can't figure out what the problem is. Here is my submission: code

Thanks!

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
    ← Rev. 2   Vote: I like it +1 Vote: I do not like it

    On line $$$137$$$, do $$$snukes[x][t] += a$$$. Also provide the base case of recursion, like $$$t == 1e5 + 1$$$ return 0; code

    → Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone please explain problem B? I'm not getting idea in the editorial.

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    just make the input number +ve (if it is -ve now) by adding $$$998244353$$$ then just take the modulo with $$$998244353$$$.

    → Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Passed A~G except D. I am now a goddamn joker. :)

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +30 Vote: I do not like it

The editorial of problem G mentions a fast algorithm to compute a factorial in $$$O(\sqrt{mod}\log{(mod)})$$$, where can I learn this from?

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

somebody knows why this doesnt work in D? does this have any undefined behavior cuz it was not running on my compiler as well as online here but it was running on CF custom invocation so I submitted it anyway.

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    In the problem statement, it is clearly mentioned that you may move on the line (left or right) where you're just moving in the right direction. Add helper(pit-1,time+1) and corresponding conditions as well.

    → Reply
»
21 month(s) ago, # |
  Vote: I like it -13 Vote: I do not like it

I found that C was quite doable because the problem is asking if the size of the convex hull is those 4 points.

→ Reply