Problem:
Change-Making Problem

You want to make change for $n$ cents. Assuming that you have infinite supply of coins of 1, 5, 10 and/or 25 cents coins respectively, find the minimum number of coins you need.

Input

$n$

The integer $n$ is given in a line.

出力

Print the minimum number of coins you need in a line.

Constraints

$1 \le n \le 10^9$

Sample Input 1

100

Sample Output 1

4

Sample Input 2

54321

Sample Output 2

2175

Solution in C# (judge verdict: Accepted)

using System;

public class hello
{
    public static void Main()
    {
        var n = int.Parse(Console.ReadLine().Trim());
        Console.WriteLine(getAns(n));
    }
    static int getAns(int n)
    {
        var c = new int[] { 25, 10, 5, 1 };
        var ans = 0;
        foreach (var x in c)
        {
            var cc = n / x;
            ans += cc;
            n -= cc * x;
        }
        return ans;
    }
}