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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;

int gcd(int x,int y){
    if(x==0)return y;
    return gcd(y%x,x);
}

int main(){
    int N;scanf("%d",&N);
    vector<int> a(N),l(N),r(N);
    for(int i=0;i<N;i++){
        scanf("%d",&a[i]);
    }
    for(int i=0;i<N-1;i++){
        l[i+1] = gcd(l[i],a[i]);
    }
    for(int i=N-1;i>=1;i--){
        r[i-1] = gcd(r[i],a[i]);
    }
    int ans=1;
    for(int i=0;i<N;i++){
        ans=max(ans,gcd(l[i],r[i]));
    }
    printf("%d",ans);
}