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 Rust (1.15.1) (judge verdict: Runtime Error)

use std::str::FromStr;
use std::io::*;
 
fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

fn main(){
    let n: usize = read();
    let mut a: Vec<i32> = (0..n).map(|_| read()).collect();
    a.sort();
    let mut minus = 0;
    let mut ans = 0;
    
    loop {
    	if a[minus] >= 0 {
        	break;
        }
                
        minus += 1;
    }
    
    if minus % 2 == 0 {
    	for k in 0..n {
        	ans += a[k].abs();
        }
    } else {
    	ans += a[0];
        for k in 1..n {
        	ans += a[k].abs();
        }
    }
    
    println!("{}",ans);
}