We will hold AtCoder Regular Contest 208 (Div. 2).
- Contest URL: https://atcoder.jp/contests/arc208
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20251012T2100&p1=248
- Duration: 120 minutes
- Number of Tasks: 5
- Writer: sounansya
- Tester: Nyaan, maspy
- Rated range: 1200 ~ 2399
The point values will be 500-600-700-700-1100.
We are looking forward to your participation!








1100 point E is so scary
*3070 D in ARC Div2 with 700 points??? Are you serious???
qp&good luck
Hope for a good result!
[deleted]
Totally agree. Why can't the writers just simply give us a high-quality round made up of standard problems only?
Agree.
[deleted]
it is palindrome lol
[deleted]
upd: im sorry i thought easily observable information like question categories wouldn't count as discussion contest topics
[deleted] UPD : sorry, i dont know discussing problem categories is also prohibited
Sharing any information related to problems (including problem categories) in an ongoing contest on social media is prohibited.
upd: Thank you for your understanding and for deleting the comment.
[deleted]
I'm the first solve of A!!!
But I can't solve CDE. Too hard. Losing rating again.
how to solve A?
If any bit occurs even no. of times; then Alice FTW else Bob is winning. Obviously ignore zero count of bits :)
https://atcoder.jp/contests/arc208/submissions/70095560
Think about $$$\operatorname{xor}$$$ sum of all of these numbers. $$$\operatorname{xor}$$$ sum of the final state is exactly $$$\operatorname{or}$$$ sum of the original state.
Do you have any formal proof why this works ? Grundy numbers do work when piles are independent but here; they're dependent so how does that work ? Or, am I missing something ?
Update : Okk Thanks; the editorial explains the XOR logic well.
A>B. Without proving my solution for A, I still solve it slower than B.
I just printed the bit count array in the last minutes of the contest and hurray; I was lucky enough to figure it out. CP also involves some luck and guesswork at times :((
The difficulty gap between C and D is tooo big.
Problem C is very uninteresting!
A is just 2155E - Mimo & Yuyu (unfortunately I did not remember this until after the contest)
5 nice problems $$$\ne$$$ nice contest. e. g. APIO 2025.
Maybe this can't even be called 5 nice problems.
Editorial of E is quite confusing.
when b \in S and b \notin S