Adding and subtracting using bit arithmetic

I learned a bit about it today. Adding and subtracting with bitwise arithmetic because negative numbers are stored in a way that is complementary, the addition is realized by subtraction.

The addition operation is based on a theorem such as:

A + b = a^b + ((A & B) << 1)

It's good to go back to the point of rounding or zero.

Code:

1#include <iostream>2#include <cstdio>3#include <cstring>4 using namespacestd;5 6 int Get(intAintb) {7     intc = a ^b;8     intD = (A & B) <<1;9     if(c = =0|| D = =0) {Ten         returnB?D; One     } A     return Get(c, D); - } -  the intMain () { -     intA, B; -      while(EOF! = scanf ("%d%d", &a, &b)) { -printf"%d\n",Get(A, b)); +     } -     return 0; +}

Adding and subtracting using bit arithmetic