POWER OF THREE
CodeChefOpen on judge ↗
You are given $n$ integers $(a1,a2,...,an)$. Find the number of pairs of indexes $i,j$ ($i$ < $j$) that $ai+aj$ is a power of $3$ (i. e. some integer $x$ exists so that $ai+aj$ = $3^x$). ### Input The first line contains the single positive integer $n$ — the number of integers. The second line contains n positive integers $a1,a2,...,an$ ### Output Print the number of pairs of indexes $i,j$ ($i$
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