Third Permutation
You are given two permutations a and b such that a_i \neq b_i in every position. Create a third permutation c such that a_i \neq c_i and b_i \neq c_i in every position. Input The first line has an integer n: the permutation size. The second line has n integers a_1,a_2,\dots,a_n. The third line has n integers b_1,b_2,\dots,b_n. Output Print n integers c_1,c_2,\dots,c_n. You can print any vali
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.
Sign in to chat with the tutor and save your progress.
Sign in to start