Mathematician

CodeChefOpen on judge ↗

Chandresh is a great Mathematician he is doing a research work but he gets stuck in a problem.The problem is:- you are given a number $N$, You have to find the total number of unique Prime numbers formed by concatinating all pairs of $Prime Numbers$<=$N$. He wants your help. Can you help chandresh? ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each

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