The task is to Increment a number without using ++ and + operators.
Examples:
Input : 3 Output : 4 Input : 9 Output : 10
The idea is based on the fact that the negative numbers are stored using 2’s complement form. 2’s complement form is obtained by inverting bits and then adding one. So if we invert all bits of given number and apply negative sign, we get the number plus 1.
C++
// CPP program to increment an unsigned // int using bitwise operators. #include <bits/stdc++.h> using namespace std; // function that increment the value. int increment(unsigned int i) { // Invert bits and apply negative sign i = -(~i); return i; } // Driver code int main() { int n = 3; cout << increment(n); return 0; } |
chevron_right
filter_none
Java
// Java program to increment // an unsigned int using // bitwise operators. import java.io.*; class GFG { // function that increment // the value. static long increment(long i) { // Invert bits and // apply negative sign i = -(~i); return i; } // Driver code public static void main (String[] args) { long n = 3; System.out.print( increment(n)); } } // This code is contributed // by inder_verma. |
chevron_right
filter_none
Python3
# Python3 program to increment # an unsigned int using # bitwise operators. # function that increment the value. def increment(i): # Invert bits and # apply negative sign i = -(~i); return i; # Driver code if __name__ == "__main__": n = 3; print(increment(n)); # This code is contributed by mits |
chevron_right
filter_none
C#
// C# program to increment // an unsigned int using // bitwise operators. using System; class GFG { // function that increment // the value. static long increment(long i) { // Invert bits and // apply negative sign i = -(~i); return i; } // Driver code public static void Main () { long n = 3; Console.WriteLine(increment(n)); } } // This code is contributed // by inder_verma. |
chevron_right
filter_none
PHP
<?php // PHP program to increment // an unsigned int using // bitwise operators. // function that increment the value. function increment($i) { // Invert bits and // apply negative sign $i = -(~$i); return $i; } // Driver code $n = 3; echo increment($n); // This code is contributed by mits ?> |
chevron_right
filter_none
Output:
4
It also works for characters.
Example:
Input : a Output : b Input : o Output : p
C++
// CPP program to increment an unsigned // char using bitwise operators. #include <bits/stdc++.h> using namespace std; // function that increment the value. char increment(unsigned char i) { // Invert bits and apply negative sign i = -(~i); return i; } // Driver code int main() { char n = 'a'; cout << increment(n); return 0; } |
chevron_right
filter_none
Java
// Java program to increment // an unsigned char using // bitwise operators. class GFG { // function that increment the value. static char increment(char i) { // Invert bits and apply // negative sign int i1 = -(~(int)(i)); return (char)(i1); } // Driver code public static void main(String[] args) { char n = 'a'; System.out.println(increment(n)); } } // This code is contributed by mits |
chevron_right
filter_none
Python3
# Python3 program to increment # an unsigned char using # bitwise operators. # function that increment # the value. def increment(i): # Invert bits and # apply negative sign i = -(~ord(i)); return chr(i); # Driver code n = 'a'; print(increment(n)); # This code is contributed by mits |
chevron_right
filter_none
C#
// C# program to increment // an unsigned char using // bitwise operators. class GFG { // function that increment the value. static char increment(char i) { // Invert bits and apply // negative sign int i1 = -(~(int)(i)); return (char)(i1); } // Driver code static void Main() { char n = 'a'; System.Console.WriteLine(increment(n)); } } // This code is contributed by mits |
chevron_right
filter_none
PHP
<?php // PHP program to increment // an unsigned char using // bitwise operators. // function that increment // the value. function increment($i) { // Invert bits and // apply negative sign $i = -(~ord($i)); return chr($i); } // Driver code $n = 'a'; echo increment($n); // This code is contributed by mits ?> |
chevron_right
filter_none
Output:
b
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Increment a number by one by manipulating the bits
- Count of suffix increment/decrement operations to construct a given array
- Count number of trailing zeros in Binary representation of a number using Bitset
- Find the largest number smaller than integer N with maximum number of set bits
- Maximize a given unsigned number number by swapping bits at it's extreme positions.
- Find a number which give minimum sum when XOR with every number of array of integers
- Number of ways to split a binary number such that every part is divisible by 2
- Number which has the maximum number of distinct prime factors in the range M to N
- Check if the binary representation of a number has equal number of 0s and 1s in blocks
- Number of leading zeros in binary representation of a given number
- C/C++ Program to Find the Number Occurring Odd Number of Times
- Minimum number of given powers of 2 required to represent a number
- Check if a number has same number of set and unset bits
- Maximum number of splits of a binary number
- C++ Program for How to check if a given number is Fibonacci number?
- Program to Convert BCD number into Decimal number
- Find the Number Occurring Odd Number of Times
- Number of pairs with Bitwise OR as Odd number
- Find third number such that sum of all three number becomes prime
- M-th smallest number having k number of set bits.
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.
