We will hold AtCoder Beginner Contest 266.
- Contest URL: https://atcoder.jp/contests/abc266
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20220827T2100&p1=248
- Duration: 100 minutes
- Number of Tasks: 8
- Writer: kyopro_friends, [user:nok0, [user:m_99]
- Tester: m_99, leaf1415
- Rated range: ~ 1999
The point values will be 100-200-300-400-500-500-600-600. We are looking forward to your participation!
As a contestant,I have registered for this contest as a Rated participant.
Oh,I found C much more difficult than DEF. Maybe I'm not good at geometry:(
dw, it was same for me =)
took me more time to do C than F
https://oeis.org/A181371 , when you find the sequence in OEIS but cant solve the problem cause you dont know how generating functions work.
which problem uses this ?
G i think, 012 <-> RGB
however constraint on k is different
How to Solve C?
You can just judge area ABC + area ACD == area ABD + area BCD
U R right.Nice solution.
Fuck
Why does this submission on problem G get WA?
Put $$$K$$$ "RG"s, then put the remaining $$$R - K, G - K, B$$$ in the remaining $$$N - 2K$$$ positions. I solved the second part using inclusion-exclusion.
Look at 2 2 0 1
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!
On line $$$137$$$, do $$$snukes[x][t] += a$$$. Also provide the base case of recursion, like $$$t == 1e5 + 1$$$ return 0; code
Can anyone please explain problem B? I'm not getting idea in the editorial.
just make the input number +ve (if it is -ve now) by adding $$$998244353$$$ then just take the modulo with $$$998244353$$$.
Passed A~G except D. I am now a goddamn joker. :)
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?
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.
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.I found that C was quite doable because the problem is asking if the size of the convex hull is those 4 points.