# Increment a number without using ++ or +

The task is to Increment a number without using ++ and + operators.

Examples:

Input : 3
Output : 4

Input : 9
Output : 10

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

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 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; }

## 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.

## 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

## 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.

## PHP



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 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; }

## 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

## 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

## 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

## PHP



Output:

b

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.

Improved By : inderDuMCA, Mithun Kumar

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.