Chef and his friends

CodeChefOpen on judge ↗

Problem statement Chef and his 2 friends(Devu and Raju) start from the same place.If thier steps measures n1 cm,n2 cm,n3 cm respectively. Your task is to find at what distance from the starting point will they all meet? There is a speciality of these friends that the lengths of thier steps are always a prime number . Input The first line contains 3 positive Integers n1,n2,n3 Output at what

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