Hi Codeforces, it has been a long time since I wrote a note blog.

This is the 8th episode of this "note" series. I will write notes on problems (normally around 2500-ish problems), that are both interesting and educational. I normally will spend a few hours on each problem so please be patient when reading the blog.

Problem link

Problem paraphrased：

You are given an integer $$$N$$$.

You would need to start from node $$$0$$$ and visit every other node once and end at node $$$0$$$ again.

When we reach node $$$i$$$, we can only go to $$$(2i) mod N$$$ or $$$(2i + 1) mod N$$$.

Print a cycle that contains all N nodes and starts and ends at node $$$0$$$.

AC code link