Many people think about their height in feet and inches, even in some countries that primarily use the metric system. Write a program that reads a number of feet from the user, followed by a number of inches.

Once these values are read, your program should compute and display the equivalent number of centimetres.

Hint: One foot is 12 inches. One inch is 2.54 centimetres.

**Input:**
Feet: 7
Inch's: 1
**Output:**
Your height in centimeters is 215.90

import java.io.*; import java.util.*; public class temp { public static void main(String[] args) { double foot,inch,cm=0; Scanner scan = new Scanner(System.in); System.out.println("Enter the Height Feet and Inches: "); foot = scan.nextDouble(); foot *= 30.48; inch = scan.nextDouble(); inch *= 2.54; cm = foot + inch; System.out.println(String.format("Your height in centimeters is %.2f",cm)); } }

**INPUT_1:**

Enter the Height Feet and Inches:

5

7

**OUTPUT:**

Your height in centimeters is 170.18

**INPUT_2:**

Enter the Height Feet and Inches:

6

1

**OUTPUT:**

Your height in centimeters is 185.42

**INPUT_3:**

Enter the Height Feet and Inches:

6

5

**OUTPUT:**

Your height in centimeters is 195.58

**INPUT_4:**

Enter the Height Feet and Inches:

7

5

**OUTPUT:**

Your height in centimeters is 226.06

**INPUT_5:**

Enter the Height Feet and Inches:

5

5

**OUTPUT:**

Your height in centimeters is 165.10

**ILLUSTRATION**

**Morae Q!**

- Convert from binary number to decimal number.
- Swap two numbers by using division and multiplication.
- Compute foot and inches into centimetres.
- Concatenate Strings.
- Convert lowercase letters to uppercase letters.
- Compute the sum of all the digits of N.
- Compute the area of the pentagon.
- Get input using scanner.
- Find the distance between two points (x1,y1) and (x2,y2).
- Finding patterns in a file using frep and egrep .
- Detecting a cycle in a directed graph using Depth First Traversal.
- Topological ordering in a Graph.
- Storing graphs using adjacency list.
- Introduction to graph theory.
- Graph Adjacency Matrix pseudo code.
- Adjacency Matrix for storing graphs.
- Dijkstra’s shortest path algorithm .
- Breadth first search (BFS) Algorithm.
- Find the multiple of given number in the list of integers.
- Finding patterns in files using grep .