QUANTICO TALK

CodeChefOpen on judge ↗

Caleb Haas from Quantico joined a cult to start his new career of robbing. Being a beginner, he was asked to do a robbery in which he was given a bag having a capacity of C units. So, when he went to the shop to rob, there lay N items each having certain weight and certain profit associated with it. But, there is a twist, he has first 10 primes, which he can use at most once, if he takes any item

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