101250: [AtCoder]ABC125 A - Biscuit Generator

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

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

Input

题意翻译

已知 $a$ 元钱可以买 $1$ 盒饼干,每盒饼干有 $b$ 块。求 $t$ 元钱能买多少个饼干。(只能买整盒)

加入题单

算法标签: