Maximum Sum

CodeChefOpen on judge ↗

Aman was in a market and bought " N " packages with package types 1 to N ( all distinct packages) . He faced a problem : The shop provided Aman " M " offers of type " A -> B " where one could exchange package of type A with package of type B only if package of type B could be exchanged with package of type A .The offer could be used any number of times . Help Aman to find the maximum sum he can

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