Buying Flowers

CodeChefRating 931Open on judge ↗

Chef wants to buy $N$ ($N \ge 2$) flowers. He can either pay $4$ coins and receive $2$ flowers, or pay $5$ coins and receive $3$ flowers. Both types of transactions can be repeated as many times as he likes. Find the **minimum** number of coins Chef needs to pay to buy **exactly** $N$ flowers. ### Input - The first line of input will contain a single integer $T$, denoting the number of test c

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