Problem:
Score : 100 points

Problem Statement

A biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.

Find the total number of biscuits produced within T + 0.5 seconds after activation.

Constraints

All values in input are integers.

1 \leq A, B, T \leq 20

Input

Input is given from Standard Input in the following format:

A B T

Output

Print the total number of biscuits produced within T + 0.5 seconds after activation.

Sample Input 1

3 5 7

Sample Output 1

10

Five biscuits will be produced three seconds after activation.

Another five biscuits will be produced six seconds after activation.

Thus, a total of ten biscuits will be produced within 7.5 seconds after activation.

Sample Input 2

3 2 9

Sample Output 2

6

Sample Input 3

20 20 19

Sample Output 3

0

Solution in C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;

namespace Temp
{
    class Program
    {
        static void Main(string[] args)
        {
            int N;

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

            string[] input = Console.ReadLine().Split(' ');
            var A = new int[N];
            for (int h = 0; h < N; h++)
            {
                A[h] = int.Parse(input[h]);
            }

            int Za;
            int Zb;
            var B = new int[N];

            int Ans = 0;

            for (int h = 0; h < N; h++)
            {


                for (int i = 0; i < N; i++)
                {
                    B[i] = A[i];
                }
                for (int i = 0; i < N-1; i++)
                {
                    if(h <= i)
                    {
                        B[i] = B[i + 1];
                    }
                }

                int Counter = N - 2;

                var BAns = new int[N];



                    while (Counter > -1)
                {
                    for (int i = 0; i < Counter; i++)
                    {
                        Za = B[i];
                        Zb = B[i + 1];

                        int Z = 1;

                        while (Z > 0)
                        {
                            Z = Za % Zb;
                            Za = Zb;
                            Zb = Z;
                        }
                        B[i] = Za;

                    }
                    Counter--;
                }

                    if(Ans < B[0])
                {
                    Ans = B[0];
                }

            }
            //

            Console.WriteLine(Ans);
        }
    }
}