C++ Program to Replace all 0’s with 1 in a given integer

Program to Replace all 0’s with 1 in a given integer

Here we will discuss how to replace all the 0’s with 1 in a given integer using C++ programming language.

The concept is simple, find the digits of the integer. Compare each digit with 0 if the digit is equal to 0 then replace it with 1. Construct the new integer with the replaced digits.

Replace all 0’s with 1 in C++

The program for Implement a C Program to replace all 0’s with 1 in a given integer as an input, all the 0’s in the number has to be replaced with 1.

Algorithm

  • Take Input in num and initialize a variable num with with value 0
  • If num is equals to zero then update the value of num2 to 1
  • Iterate using a while loop until num is greater then 0
  • For each iteration initialize a variable rem and store unit digit of num
  • If rem equals to 0 then set rem to 1
  • Set num to num divide by 10 & num2 equals to num2*10+rem
  • Reverse and print num2
Replace all 0's with 1 in a given integer

C++ code

Run
 #include<bits/stdc++.h>
 using namespace std;

    //main program

    int main()

    {

        int num,num2=0;

        cout<<"Enter number: "; //user input cin>>num;

        //checking for 0 input

        if(num == 0)

            num2=1;

        //converting 0 to 1

        while(num>0)

        {

            int rem = num%10;

            if(rem == 0)

                rem = 1;

            num = num/10;

            num2=num2*10+rem;

        }

       num = 0 ; // Store the reverse of num2

       while(num2>0){

        int r = num2%10;

        num= num*10 + r;

        num2 /= 10;

      }

        //converted number

        cout<<"Converted number is: "<<num;

        return 0;

    }

Output

Enter number: 12090
Converted number is: 12191

Prime Course Trailer

Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

14 comments on “C++ Program to Replace all 0’s with 1 in a given integer”


  • entraj20

    long long int zeroTo1(long long int num){
    if(num == 0) return 1;
    int flag = 1;

    if(num < 0) {
    num *= -1;
    flag = -1;
    }
    long long int res = 0, base = 1;

    while(num != 0){
    res += ((num % 10) == 0 ? 1 : (num % 10)) * base;
    base *= 10;
    num /= 10;
    }

    return res * flag;
    }