Challenge: Counting Money

Problem statement:

Given an infinite number of quarters $(25 cents)$, dimes $(10 cents)$, nickels $(5 cents)$, and pennies $(1 cent)$, implement a function to calculate the minimum number of coins to represent $v$ cents.