Find the number of integers from 1 to n which contains digits 0’s and 1’s only in C++

Suppose, we have a number n. Our task is to find the number of integers from 1 to n, which contains digits 0s and 1s only. So if n = 15, then output will be. As the numbers are 1, 10, 11

To solve this, we will create integers using 0s and 1s using recursive function. Following code will help us to understand this better.

Example

 Live Demo

#include<iostream>
using namespace std;
int numberOfValues(int p, int n) {
   if (p > n)
      return 0;
   return 1 + numberOfValues(p * 10, n) + numberOfValues(p * 10 + 1, n);
}
int main() {
   int n = 120;
   cout << "Number of values using 0s and 1s: " << numberOfValues(1, n);
}

Output

Number of values using 0s and 1s: 7

Arnab Chakraborty

Published on 19-Dec-2019 07:26:07

• Related Questions & Answers
• Count number of binary strings of length N having only 0’s and 1’s in C++
• Construct DFA of alternate 0’s and 1’s
• Sort an arrays of 0’s, 1’s and 2’s using C++
• Count subarrays with equal number of 1’s and 0’s in C++
• Maximum length of segments of 0’s and 1’s in C++
• Largest number with binary representation is m 1’s and m-1 0’s in C++
• Sort an arrays of 0’s, 1’s and 2’s using Java
• Count subarrays consisting of only 0’s and only 1’s in a binary array in C++
• Find a Symmetric matrix of order N that contain integers from 0 to N-1 and main diagonal should contain only 0’s in C++
• 1’s and 2’s complement of a Binary Number?
• Count the number of 1’s and 0’s in a binary array using STL in C++
• Binary representation of next greater number with same number of 1’s and 0’s in C Program?
• Segregate 0’s and 1’s in an array list using Python?
• Given a sorted array of 0’s and 1’s, find the transition point of the array in C++
• Maximum 0’s between two immediate 1’s in binary representation in C++