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 (GCC 5.4.1) (judge verdict: Runtime Error)

#include<stdio.h>
long int gcd(long int x, long int y)
{
	if (x%y==0)
	  return y;
	else
	  gcd(y, x%y);
}
long int a[100010];
main()
{
	long int n, i, p, q;
	scanf("%ld", &n);
	for (i=0; i<n; i++)
	{
		scanf("%ld", &a[i]);
	}
	if (a[0]>a[n-1])
	{
		p=gcd(a[0], a[n-1]);
	}
	else
	{
		p=gcd(a[n-1], a[0]);
	}
	if (a[0]>a[n-2])
	{
		q=gcd(a[0], a[n-2]);
	}
	else
	{
		q=gcd(a[n-2], a[0]);
	}
	if (n==2)
	{
		if (a[0]>a[1])
		  p=a[0];
		else
		  p=a[1];
	}
	if (p>q)
	  printf("%ld\n", p);
	else
	  printf("%ld\n", q);
	return 0;
}