Kryptic
CodeChefOpen on judge ↗
Piyush was participating in Kryptic and was having a tough time decrypting the questions. After seeing the sample solutions, he suddenly realized that all the answers were following a pattern. He noticed that every question had two numbers (a1, a2)and the solution was the product of all primes between a1 and a2 (a1 and a2 inclusive). Since the solution may be very large, the solution had to be tra
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