← All problemsSign in

C - Alex and Integer

Alex likes Composite numbers. He wants to find beautiful number for an integer n. A beautiful number $m$ for an integer $n$ is the smallest positive integer that n·m + 1 is a Composite number. ### Input First line will contain t, number of testcases. Then the testcases follow The first line of each test case contains a single integer n. ### Output Output the smallest positive integer $m$ such t

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

Sign in to chat with the tutor and save your progress.

Sign in to start