{"post":"

Problem – Binary Number as a string, we have to print its 1’s complement.

1’s complement of a binary number is another binary number obtained by transforming all the 0 bit to 1 and the 1 bit to 0.

Example:

Input: 101010

One’s complement the number: 010101

Algorithm:

Take binary number input as a string, having a length of size.
Initialize int fail=0.
Start a loop from i = 0 to i<size.
Inside the loop, check if the character at the current index i is '0' or '1'. If it is '0', assign '1' to the corresponding index in the complement string. If it is '1', assign '0' to the corresponding index in the complement string.
If the character at the current index i is not '0' or '1', print an error message and set fail = 1.
If fail is still 0 after the loop, print the ones complement.

Code:

#include <iostream>\n#define size 6\nusing namespace std;\n\nint main() {\n  int i, fail = 0;\n  char binary[size + 1], comp[size + 1];\n  cout << \"Input a \" << size << \" bit binary number: \";\n  cin >> binary;\n  for (i = 0; i < size; i++) {\n    if (binary[i] == '1') {\n      comp[i] = '0';\n    }\n    else if (binary[i] == '0') {\n      comp[i] = '1';\n    }\n    else {\n      cout << \"Error! Input the number of assigned bits.\" << endl;\n      fail = 1;\n      break;\n    }\n  }\n  comp[size] = '\\0';\n  if (fail == 0) {\n    cout << \"The original binary number = \" << binary << endl;\n    cout << \"Ones complement the number = \" << comp << endl;\n  }\n}\n\n

Output

Input a 6 bit binary number: 101101\nThe original binary number = 101101\nOnes complement the number = 010010\n\nInput a 6 bit binary number: 10101\nError! Input the number of assigned bits.\n\n

\n","title":"Program to find 1's complement of a binary number in C++","authorDetails":{"name":"Prabhnoor Maingi","slug":"prabhnoor-maingi"},"description":"Learn how to find the 1's complement of a binary number in C++ with this easy-to-follow program. ","slug":"cpp/examples/program-to-find-1s-complement-cpp/","articleId":"636a83417bb1ce5072622b48","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}