Bankoos Problem

CodeChefOpen on judge ↗

BANKOO'S PROBLEM PROBLEM STATEMENT: Bankoo is a serial bunker and always trys to bunk classes whenever possible. But as luck would have it, his college announced a new rule that a minimum percentage of attendance in each subject is necessary to write the semester examination. Thus, Bankoo wants to compute the maximum number of classes he can bunk so that he can still appear for the exams. But ha

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