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;
using System.Collections.Generic;
using System.Linq;
    class Program
    {
        static void Main()
        {
            var cnt = int.Parse(Console.ReadLine());
            var num = Console.ReadLine().Split(' ');
            int[] numArray = Array.ConvertAll<string, int>(num, delegate (string value) { return int.Parse(value); });
            var output = 1;
            var min1 = numArray.Min();
            var numList = new List<int>();
            numList.AddRange(numArray);
            numList.Remove(min1);
            var min2 = numList.Min();
            var tmp = 0;

            for (int n = (min1 / 2); n >= 2 ; n--)
            {
                if(min1 % n == 0)
                {
                    tmp = 0;
                    for (int m = 0; m < cnt && tmp <= 1; m++)
                    {
                        if (numArray[m] % n != 0)
                        {
                            tmp++;
                        }
                    }
                    if(tmp <= 1)
                    {
                        output = n;
                        n = 1;
                    }
                }
            }

            for (int n = (min2 / 2); n >= 2 && n > output; n--)
            {
                if (min2 % n == 0)
                {
                    tmp = 0;
                    for (int m = 0; m < cnt && tmp <= 1; m++)
                    {
                        if (numArray[m] % n != 0)
                        {
                            tmp++;
                        }
                    }
                    if (tmp <= 1)
                    {
                        output = n;
                        n = 1;
                    }
                }
            }

            Console.WriteLine(output);
            Console.ReadLine();
        }
    }