Play with prime

CodeChefOpen on judge ↗

There are $N$ quires which are of two types type 1 only one integer is given print the first subset(might not continues) whose sum is equal to given number in prime number sequence until 200.Type 2 quires as 2 integers first sum to be be represented and second the prime number until which you need to considered including given number then print total number of ways in which you can represent fir

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