MULTIPLUS

CodeChefOpen on judge ↗

Steve has a sequence $A1,A2,…,AN$. He needs to find the number of pairs ($i,j$) ($1 \le i < j \le N$) such that $Ai+Aj=Ai⋅Aj$. However, he is busy on fighting Thanos, so he asks for your help. ###Input The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. The first line of each test case contains a single

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