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: Accepted)

#include <iostream>
#include <string>

using namespace std;
	
	
class Hoge{
			int A,B,T,inum;
			
		
		public:
			Hoge(){
								
					}
			
			
		void input();
		
		
	int getinum() const{return inum;}

			

									
		virtual ~Hoge(){	
					
					
					//cout<<"pyama is erased."<<endl;
						}
};



void Hoge::input(){
		
					//cin>>A;
					//cin>>B;
					//cin>>T;
					cin>>A>>B>>T;
						
					//cout<<"T/A="<<T/A<<endl;
					inum=T/A*B;
					
					}
					
					


int main()
{
	int inum;
	Hoge* ph0=new Hoge();
	ph0->input();
	
	inum=ph0->getinum();
	cout<<inum<<endl;
	delete ph0;
	
}