How to sum two integers without using arithmetic operators in C/C++?
Last Updated :
20 Nov, 2023
Given two integers a and b, how can we evaluate the sum a + b without using operators such as +, -, ++, --, ...?
Method 1 (Using pointers)
An interesting way would be:
CPP
// May not work with C++ compilers and
// may produce warnings in C.
// Returns sum of 'a' and 'b'
int sum(int a, int b)
{
char *p = a;
return (int)&p[b];
}
Despite its awkwardness at first sight, we can easily understand what is happening. First, we created a pointer p. The value of a pointer is a memory address. In this case, the value of p is the address a.
Remember: p points to position a. In that example, if we want to know the value of position a (999) we ask to *p. If we want to know the address of variable a (41), we ask to &a. If we evaluated p[b], we'd get the value of memory in position p + b. In fact, we evaluate &p[b], which is the same as getting address p + b without accessing its value. As p = a, &p[b] will return the address a + b. We don't want to return a memory address (int*). We want to return an integer (int). So, we cast &p[b] to int. What happens if we change the type of p from char* to int*? Let me fix what I said before: When we evaluate p[b] we don't evaluate p + b. We evaluate p + sizeof(*p) * b. Why? Imagine this example: Variables of type int occupies fours positions in the memory.
This sizeof(*p) considers the quantity of positions each variable occupies in the memory. We want to evaluate p + b. In other words, we want sizeof(*p) equals to 1. Consequently, if *p is a char, we're happy.
Method 2 (Using bitwise operators)
Let's look the sum's truth table (forgive the carry for now): Looking carefully, we notice that the sum's and xor's truth table are the same. It's 1 only when the input differs. Now, how can we detect carry? Let's look the carry's truth table.
Looking carefully, we notice that the sum's and xor's truth table are the same. It's 1 only when the input differs. Now, how can we detect carry? Let's look the carry's truth table.
Looking carefully one more time, we notice that the carry's and logical and's truth table are identicals. Now, we have to shift a & 1 to left and sum with a ^ b. However, these operations may have carries as well. No problem, just sum a ^ b with a & 1 shifted to left recursively.
CPP
// Returns sum of a and b using bitwise
// operators.
int sum(int a, int b)
{
int s = a ^ b;
int carry = a & b;
if (carry == 0) return s;
else return sum(s, carry << 1);
}
This solution has been discussed here.
Method 3 (Using printf)
Let's remember some facts:
- The printf returns the number of characters printed successfully.
- The specifier %*c requests two parameters: The first one is the customized width and the second is character. For example, printf("%*c", 5, 'a') will print " a".
- The special character '\r' returns the cursor from the beginning of output string. For example, printf("abcd\r12") will print "12cd".
Keeping that in mind, we can understand this function:
CPP
// Returns sum of a and b using printf
// Constraints: a, b > 0.
int sum(int a, int b)
{
return printf("%*c%*c", a, '\r', b, '\r');
}
This solution has been discussed here.
Method 4 (using conversion)
Unlike above other methods, it doesn't shows any error or warning in both C and C++.
Here, we add 2 integers using conversion.
C++
// CPP program to check if a given input is a valid integer
// or a string
#include <bits/stdc++.h>
using namespace std;
int sum(int a, int b) { return (long)&((char*)(long)a)[b]; }
int main()
{
int st = 12;
int pt = 122;
int ans = sum(st, pt);
printf("%d", ans);
return 0;
}
// This code is contributed by Susobhan Akhuli
C
// C program to check if a given input is a valid integer or
// a string
#include <stdio.h>
int sum(int a, int b) { return (long)&((char*)(long)a)[b]; }
int main()
{
int st = 12;
int pt = 122;
int ans = sum(st, pt);
printf("%d", ans);
return 0;
}
// This code is contributed by Susobhan Akhuli
Time Complexity: O(1)
Auxiliary Space: O(1)
Similar Reads
Add two numbers without using arithmetic operators Given two integers a and b, the task is to find the sum of a and b without using + or - operators. Examples: Input: a = 10, b = 30Output: 40Input: a = -1, b = 2Output: 1Approach:The approach is to add two numbers using bitwise operations. Let's first go through some observations: a & b will have
5 min read
Arithmetic operations with std::bitset in C++ A bitset is an array of boolean values, but each boolean value is not stored separately. Instead, bitset optimizes the space such that each bool takes 1-bit space only, so space taken by bitset say, bs is less than that of bool bs[N] and vector<bool> bs(N). However, a limitation of bitset is,
3 min read
Sum of array using pointer arithmetic Given an array, write a program to find the sum of array using pointers arithmetic. In this program we make use of * operator . The * (asterisk) operator denotes the value of variable. The * operator at the time of declaration denotes that this is a pointer, otherwise it denotes the value of the mem
2 min read
C++ Arithmetic Operators Arithmetic Operators in C++ are used to perform arithmetic or mathematical operations on the operands (generally numeric values). An operand can be a variable or a value. For example, â+â is used for addition, '-' is used for subtraction, '*' is used for multiplication, etc. Let's take a look at an
4 min read
Character Arithmetic in C++ Character arithmetic in C++ involves performing mathematical operations on characters. In C++, characters are represented using the char data type, which is essentially an integer type that stores ASCII values. In this article, we will discuss character arithmetic and how to perform character arithm
2 min read
Find sum of integers in a file which contains any characters You are given a text file which contains any type of characters. You have to find the sum of integer values. Examples: Input : text.txt Let contents of test.txt be : :-,,$%^5313&^*1)(*( 464sz29>>///11!!! (*HB%$#)(*0900 Output : 6727 Input : text1.txt Let contents of test.txt be : 234***3r3
2 min read