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;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace alg
{
    class Program
    {
        static void Main(string[] args)
        {
            int c25, c10, c5, c1 ,ans;

            int n = int.Parse(Console.ReadLine());

            c25 = n / 25;
            n = n % 25;

            c10 = n / 10;
            n = n % 10;

            c5 = n / 5;
            n = n % 5;

            c1 = n / 1;
            n = n % 1;

            ans = c25 + c10 + c5 + c1;

            Console.WriteLine(ans);

            //Console.ReadLine();

        }
    }
}