Fake GCD

CodeChefRating 1362Open on judge ↗

### Read problems statements in [Russian](https://www.codechef.com/download/translated/COOK133/russian/FAKEGCD.pdf) and [Bengali](https://www.codechef.com/download/translated/COOK133/bengali/FAKEGCD.pdf). You are given an integer $N$. Output a permutation of values from $1$ to $N$ that satisfies the following condition: - $\gcd([1+A_1,2+A_2,3+A_3,\ldots,N+A_N]) > 1$ It can be proven that a solu

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI