Morning Walk Distance

                        Morning Walk Distance

A man in order to reduce his weight walks along the boundary of a rectangular plot every morning. Depending on his energy level he walks for N rounds on a given day.
Given the length L and breadth B of the rectangular plot along with the number of rounds N, the program must print the total distance D covered in the morning walk.

Note: Do not worry about the units like meters or kilometers.

Input Format:
The first line contains L and B separated by a space.
The second line contains N.

Output Format:
The first line contains D.

Boundary Conditions:
1 <= N <= 100
1 <= L, B <= 999999

Example Input/Output 1:
Input:
10 20
5

Output:
300

Code:

#include <iostream>

using namespace std;

int main(int argc, char** argv)

{

    int l,b,n,p;

    cin>>l>>b>>n;

    p=2*(l+b);

   cout<<p*n;

}

Please do comment If u have any Queries!