# Program to convert Hexa-Decimal Number to its equivalent BCD

Given a HexaDecimal Number N, the task is to convert the number to its equivalent Binary Coded Decimal.

Examples:

Input: 11F
Output: 0001 0001 1111
Explanation:
Binary of 1 – 0001
Binary of F – 1111
Thus, Equivalent BCD is 0001 0001 1111

Input: A D
Output: 1010 1101
Explanation:
Binary of A – 1010
Binary of D – 1101
Thus, Equivalent BCD is 1010 1101

Approach: The idea is to iterate over each digit of the given Hexa-Decimal number and find the four digit Binary Equivalent of that digit. Finally, print all the converted digits one by one.

Below is the implementation of the above approach:

## C++

 `// C++ implementation  to convert the given ` `// HexaDecimal number to its equivalent BCD. ` ` `  `#include ` `using` `namespace` `std; ` ` `  `// Function to convert ` `// HexaDecimal to its BCD ` `void` `HexaDecimaltoBCD(string s) ` `{ ` `    ``int` `len = s.length(), check = 0; ` `    ``int` `num = 0, sum = 0, mul = 1; ` ` `  `    ``// Iterating through the digits ` `    ``for` `(``int` `i = 0; i <= len - 1; i++) { ` ` `  `        ``// check whether s[i] is a character ` `        ``// or a integer between 0 to 9 ` `        ``// and compute its equivalent BCD ` `        ``if` `(s[i] >= 47 && s[i] <= 52) ` `            ``cout << bitset<4>(s[i]) ` `                 ``<< ``" "``; ` `        ``else` `            ``cout << bitset<4>(s[i] - 55) ` `                 ``<< ``" "``; ` `    ``} ` `} ` ` `  `// Driver Code ` `int` `main() ` `{ ` `    ``string s = ``"11F"``; ` ` `  `    ``// Function Call ` `    ``HexaDecimaltoBCD(s); ` ` `  `    ``return` `0; ` `} `

Output:

```0001 0001 1111
```

GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.