Count numbers having 0 as a digit
Last Updated :
28 Dec, 2023
Problem: Count how many integers from 1 to N contains 0 as a digit.
Examples:
Input: n = 9
Output: 0
Input: n = 107
Output: 17
The numbers having 0 are 10, 20,..90, 100, 101..107
Input: n = 155
Output: 24
The numbers having 0 are 10, 20,..90, 100, 101..110,
120, ..150.
A naive solution is discussed in previous post
In this post an optimized solution is discussed. Let's analyze the problem closely.
Let the given number has d digits .
The required answer can be computed by computing the following two values:
- Count of 0 digit integers having maximum of d-1 digits.
- Count of 0 digit integers having exactly d digits (less than/ equal to the given number of course!)
Therefore, the solution would be the sum of above two.
The first part has already been discussed here.
How to find the second part?
We can find the total number of integers having d digits (less than equal to given number), which don't contain any zero.
To find this we traverse the number, one digit at a time.
We find count of non-negative integers as follows:
- If the number at that place is zero, decrement counter by 1 and break (because we can't move any further, decrement to assure that the number itself contains a zero)
- else , multiply the (number-1), with power(9, number of digits to the right to it)
Let's illustrate with an example.
Let the number be n = 123. non_zero = 0
We encounter 1 first,
add (1-1)*92 to non_zero (= 0+0)
We encounter 2,
add (2-1)*91 to non_zero (= 0+9 = 9)
We encounter 3,
add (3-1)*90 to non_zero (=9+3 = 12)
We can observe that non_zero denotes the number of integer consisting of 3 digits (not greater than 123) and don't contain any zero. i.e., (111, 112, ....., 119, 121, 122, 123) (It is recommended to verify it once)
Now, one may ask what's the point of calculating the count of numbers which don't have any zeroes?
Correct! we're interested to find the count of integers which have zero.
However, we can now easily find that by subtracting non_zero from n after ignoring the most significant place.i.e., In our previous example zero = 23 - non_zero = 23-12 =11 and finally we add the two parts to arrive at the required result!!
Below is implementation of above idea.
C++
//Modified C++ program to count number from 1 to n with
// 0 as a digit.
#include <bits/stdc++.h>
using namespace std;
// Returns count of integers having zero upto given digits
int zeroUpto(int digits)
{
// Refer below article for details
// https://www.geeksforgeeks.org/count-positive-integers-0-digit/
int first = (pow(10,digits)-1)/9;
int second = (pow(9,digits)-1)/8;
return 9 * (first - second);
}
// utility function to convert character representation
// to integer
int toInt(char c)
{
return int(c)-48;
}
// counts numbers having zero as digits upto a given
// number 'num'
int countZero(string num)
{
// k denoted the number of digits in the number
int k = num.length();
// Calculating the total number having zeros,
// which upto k-1 digits
int total = zeroUpto(k-1);
// Now let us calculate the numbers which don't have
// any zeros. In that k digits upto the given number
int non_zero = 0;
for (int i=0; i<num.length(); i++)
{
// If the number itself contains a zero then
// decrement the counter
if (num[i] == '0')
{
non_zero--;
break;
}
// Adding the number of non zero numbers that
// can be formed
non_zero += (toInt(num[i])-1) * (pow(9,k-1-i));
}
int no = 0, remaining = 0,calculatedUpto=0;
// Calculate the number and the remaining after
// ignoring the most significant digit
for (int i=0; i<num.length(); i++)
{
no = no*10 + (toInt(num[i]));
if (i != 0)
calculatedUpto = calculatedUpto*10 + 9;
}
remaining = no-calculatedUpto;
// Final answer is calculated
// It is calculated by subtracting 9....9 (d-1) times
// from no.
int ans = zeroUpto(k-1) + (remaining-non_zero-1);
return ans;
}
// Driver program to test the above functions
int main()
{
string num = "107";
cout << "Count of numbers from 1" << " to "
<< num << " is " << countZero(num) << endl;
num = "1264";
cout << "Count of numbers from 1" << " to "
<< num << " is " <<countZero(num) << endl;
return 0;
}
Java
//Modified Java program to count number from 1 to n with
// 0 as a digit.
public class GFG {
// Returns count of integers having zero upto given digits
static int zeroUpto(int digits)
{
// Refer below article for details
// https://www.geeksforgeeks.org/count-positive-integers-0-digit/
int first = (int) ((Math.pow(10,digits)-1)/9);
int second = (int) ((Math.pow(9,digits)-1)/8);
return 9 * (first - second);
}
// utility function to convert character representation
// to integer
static int toInt(char c)
{
return (int)(c)-48;
}
// counts numbers having zero as digits upto a given
// number 'num'
static int countZero(String num)
{
// k denoted the number of digits in the number
int k = num.length();
// Calculating the total number having zeros,
// which upto k-1 digits
int total = zeroUpto(k-1);
// Now let us calculate the numbers which don't have
// any zeros. In that k digits upto the given number
int non_zero = 0;
for (int i=0; i<num.length(); i++)
{
// If the number itself contains a zero then
// decrement the counter
if (num.charAt(i) == '0')
{
non_zero--;
break;
}
// Adding the number of non zero numbers that
// can be formed
non_zero += (toInt(num.charAt(i))-1) * (Math.pow(9,k-1-i));
}
int no = 0, remaining = 0,calculatedUpto=0;
// Calculate the number and the remaining after
// ignoring the most significant digit
for (int i=0; i<num.length(); i++)
{
no = no*10 + (toInt(num.charAt(i)));
if (i != 0)
calculatedUpto = calculatedUpto*10 + 9;
}
remaining = no-calculatedUpto;
// Final answer is calculated
// It is calculated by subtracting 9....9 (d-1) times
// from no.
int ans = zeroUpto(k-1) + (remaining-non_zero-1);
return ans;
}
// Driver program to test the above functions
static public void main(String[] args) {
String num = "107";
System.out.println("Count of numbers from 1" + " to "
+ num + " is " + countZero(num));
num = "1264";
System.out.println("Count of numbers from 1" + " to "
+ num + " is " +countZero(num));
}
}
// This code is contributed by 29AjayKumar
Python3
# Python3 program to count number from 1 to n
# with 0 as a digit.
# Returns count of integers having zero
# upto given digits
def zeroUpto(digits):
first = int((pow(10, digits) - 1) / 9);
second = int((pow(9, digits) - 1) / 8);
return 9 * (first - second);
# counts numbers having zero as digits
# upto a given number 'num'
def countZero(num):
# k denoted the number of digits
# in the number
k = len(num);
# Calculating the total number having
# zeros, which upto k-1 digits
total = zeroUpto(k - 1);
# Now let us calculate the numbers which
# don't have any zeros. In that k digits
# upto the given number
non_zero = 0;
for i in range(len(num)):
# If the number itself contains a zero
# then decrement the counter
if (num[i] == '0'):
non_zero -= 1;
break;
# Adding the number of non zero numbers
# that can be formed
non_zero += (((ord(num[i]) - ord('0')) - 1) *
(pow(9, k - 1 - i)));
no = 0;
remaining = 0;
calculatedUpto = 0;
# Calculate the number and the remaining
# after ignoring the most significant digit
for i in range(len(num)):
no = no * 10 + (ord(num[i]) - ord('0'));
if (i != 0):
calculatedUpto = calculatedUpto * 10 + 9;
remaining = no - calculatedUpto;
# Final answer is calculated. It is calculated
# by subtracting 9....9 (d-1) times from no.
ans = zeroUpto(k - 1) + (remaining - non_zero - 1);
return ans;
# Driver Code
num = "107";
print("Count of numbers from 1 to",
num, "is", countZero(num));
num = "1264";
print("Count of numbers from 1 to",
num, "is", countZero(num));
# This code is contributed by mits
C#
// Modified C# program to count number from 1 to n with
// 0 as a digit.
using System;
public class GFG{
// Returns count of integers having zero upto given digits
static int zeroUpto(int digits)
{
// Refer below article for details
// https://www.geeksforgeeks.org/count-positive-integers-0-digit/
int first = (int) ((Math.Pow(10,digits)-1)/9);
int second = (int) ((Math.Pow(9,digits)-1)/8);
return 9 * (first - second);
}
// utility function to convert character representation
// to integer
static int toInt(char c)
{
return (int)(c)-48;
}
// counts numbers having zero as digits upto a given
// number 'num'
static int countZero(String num)
{
// k denoted the number of digits in the number
int k = num.Length;
// Calculating the total number having zeros,
// which upto k-1 digits
int total = zeroUpto(k-1);
// Now let us calculate the numbers which don't have
// any zeros. In that k digits upto the given number
int non_zero = 0;
for (int i=0; i<num.Length; i++)
{
// If the number itself contains a zero then
// decrement the counter
if (num[i] == '0')
{
non_zero--;
break;
}
// Adding the number of non zero numbers that
// can be formed
non_zero += (toInt(num[i])-1) * (int)(Math.Pow(9,k-1-i));
}
int no = 0, remaining = 0,calculatedUpto=0;
// Calculate the number and the remaining after
// ignoring the most significant digit
for (int i=0; i<num.Length; i++)
{
no = no*10 + (toInt(num[i]));
if (i != 0)
calculatedUpto = calculatedUpto*10 + 9;
}
remaining = no-calculatedUpto;
// Final answer is calculated
// It is calculated by subtracting 9....9 (d-1) times
// from no.
int ans = zeroUpto(k-1) + (remaining-non_zero-1);
return ans;
}
// Driver program to test the above functions
static public void Main() {
String num = "107";
Console.WriteLine("Count of numbers from 1" + " to "
+ num + " is " + countZero(num));
num = "1264";
Console.WriteLine("Count of numbers from 1" + " to "
+ num + " is " +countZero(num));
}
}
// This code is contributed by 29AjayKumar
JavaScript
<script>
// Modified javascript program to count number from 1 to n with
// 0 as a digit.
// Returns count of integers having zero upto given digits
function zeroUpto(digits)
{
// Refer below article for details
// https://www.geeksforgeeks.org/count-positive-integers-0-digit/
var first = parseInt( ((Math.pow(10,digits)-1)/9));
var second = parseInt( ((Math.pow(9,digits)-1)/8));
return 9 * (first - second);
}
// utility function to convert character representation
// to integer
function toInt(c)
{
return parseInt((c.charCodeAt(0))-48);
}
// counts numbers having zero as digits upto a given
// number 'num'
function countZero(num)
{
// k denoted the number of digits in the number
var k = num.length;
// Calculating the total number having zeros,
// which upto k-1 digits
var total = zeroUpto(k-1);
// Now let us calculate the numbers which don't have
// any zeros. In that k digits upto the given number
var non_zero = 0;
for (i=0; i<num.length; i++)
{
// If the number itself contains a zero then
// decrement the counter
if (num.charAt(i) == '0')
{
non_zero--;
break;
}
// Adding the number of non zero numbers that
// can be formed
non_zero += (toInt(num.charAt(i))-1) * (Math.pow(9,k-1-i));
}
var no = 0, remaining = 0,calculatedUpto=0;
// Calculate the number and the remaining after
// ignoring the most significant digit
for (i=0; i<num.length; i++)
{
no = no*10 + (toInt(num.charAt(i)));
if (i != 0)
calculatedUpto = calculatedUpto*10 + 9;
}
remaining = no-calculatedUpto;
// Final answer is calculated
// It is calculated by subtracting 9....9 (d-1) times
// from no.
var ans = zeroUpto(k-1) + (remaining-non_zero-1);
return ans;
}
// Driver program to test the above functions
var num = "107";
document.write("Count of numbers from 1" + " to "
+ num + " is " + countZero(num));
var num = "1264";
document.write("<br>Count of numbers from 1" + " to "
+ num + " is " +countZero(num));
// This code is contributed by shikhasingrajput
</script>
PHP
<?php
// PHP program to count
// number from 1 to n
// with 0 as a digit.
// Returns count of integers
// having zero upto given digits
function zeroUpto($digits)
{
$first = (int)((pow(10,
$digits) - 1) / 9);
$second = (int)((pow(9,
$digits) - 1) / 8);
return 9 * ($first - $second);
}
// counts numbers having
// zero as digits upto a
// given number 'num'
function countZero($num)
{
// k denoted the number
// of digits in the number
$k = strlen($num);
// Calculating the total
// number having zeros,
// which upto k-1 digits
$total = zeroUpto($k-1);
// Now let us calculate
// the numbers which don't
// have any zeros. In that
// k digits upto the given
// number
$non_zero = 0;
for ($i = 0;
$i < strlen($num); $i++)
{
// If the number itself
// contains a zero then
// decrement the counter
if ($num[$i] == '0')
{
$non_zero--;
break;
}
// Adding the number of
// non zero numbers that
// can be formed
$non_zero += (($num[$i] - '0') - 1) *
(pow(9, $k - 1 - $i));
}
$no = 0;
$remaining = 0;
$calculatedUpto = 0;
// Calculate the number
// and the remaining after
// ignoring the most
// significant digit
for ($i = 0;
$i < strlen($num); $i++)
{
$no = $no * 10 + ($num[$i] - '0');
if ($i != 0)
$calculatedUpto = $calculatedUpto *
10 + 9;
}
$remaining = $no - $calculatedUpto;
// Final answer is calculated
// It is calculated by subtracting
// 9....9 (d-1) times from no.
$ans = zeroUpto($k - 1) +
($remaining -
$non_zero - 1);
return $ans;
}
// Driver Code
$num = "107";
echo "Count of numbers from 1 to " .
$num . " is " .
countZero($num) . "\n";
$num = "1264";
echo "Count of numbers from 1 to " .
$num . " is " .
countZero($num);
// This code is contributed
// by mits
?>
Output:
Count of numbers from 1 to 107 is 17
Count of numbers from 1 to 1264 is 315
Complexity Analysis:
Time Complexity : O(d), where d is no. of digits i.e., O(log(n)
Auxiliary Space : O(1)
Approach#2: Using for loop
This code defines a function count_zeros_brute_force that takes an integer n as input and counts the number of integers from 1 to n that have the digit 0. The function simply iterates over all integers from 1 to n and checks if the string representation of each integer contains the character '0'. If it does, the count is incremented.The code then calls the function count_zeros_brute_force twice with different values of n and prints the results.
Algorithm
1. Initialize a counter variable to 0.
2. Traverse from 1 to n and for each number check if it has 0 in it.
3. If the number has 0, increment the counter variable.
4. Return the counter variable as the output.
C++
#include <string> // for string data type
#include <iostream>
int count_zeros_brute_force(int n) {
int count = 0; // initialize count variable to 0
for (int i = 1; i <= n; i++) { // loop through numbers 1 to n (inclusive)
if (std::to_string(i).find('0') != std::string::npos) {
// convert i to string and check if it contains '0'
count++; // increment count if '0' is found in i
}
}
return count; // return the final count
}
int main() {
int n = 107;
std::cout << count_zeros_brute_force(n) << std::endl; // output: 17
n = 1264;
std::cout << count_zeros_brute_force(n) << std::endl; // output: 315
return 0;
}
Java
public class CountZeros {
// Function to count the number of integers from 1 to n (inclusive) that contain the digit '0'
static int countZerosBruteForce(int n) {
int count = 0; // Initialize a count variable to 0
for (int i = 1; i <= n; i++) { // Loop through numbers from 1 to n (inclusive)
if (String.valueOf(i).contains("0")) {
// Convert i to a string and check if it contains the character '0'
count++; // Increment count if '0' is found in i
}
}
return count; // Return the final count
}
public static void main(String[] args) {
int n = 107;
System.out.println(countZerosBruteForce(n)); // Output: 17
n = 1264;
System.out.println(countZerosBruteForce(n)); // Output: 315
}
}
Python3
def count_zeros_brute_force(n):
count = 0
for i in range(1, n+1):
if '0' in str(i):
count += 1
return count
n=107
print(count_zeros_brute_force(n))
n=1264
print(count_zeros_brute_force(n))
C#
using System;
class Program
{
// Function to count the number of zeros in numbers from 1 to n (inclusive)
static int CountZerosBruteForce(int n)
{
int count = 0; // Initialize count variable to 0
// Loop through numbers 1 to n (inclusive)
for (int i = 1; i <= n; i++)
{
// Convert i to string and check if it contains '0'
if (i.ToString().Contains('0'))
{
count++; // Increment count if '0' is found in i
}
}
return count; // Return the final count
}
static void Main()
{
int n = 107;
Console.WriteLine(CountZerosBruteForce(n)); // Output: 17
n = 1264;
Console.WriteLine(CountZerosBruteForce(n)); // Output: 315
}
}
JavaScript
function countZerosBruteForce(n) {
let count = 0;
for (let i = 1; i <= n; i++) {
if (i.toString().includes('0')) {
// convert i to string and check if it includes '0'
count++;
}
}
return count;
}
let n = 107;
console.log(countZerosBruteForce(n)); // output: 17
n = 1264;
console.log(countZerosBruteForce(n)); // output: 315
Time Complexity: O(nlogn) for converting integer to string.
Space Complexity: O(1)
Similar Reads
Count n digit numbers not having a particular digit
We are given two integers n and d, we need to count all n digit numbers that do not have digit d. Example : Input : n = 2, d = 7 Output : 72 All two digit numbers that don't have 7 as digit are 10, 11, 12, 13, 14, 15, 16, 18, ..... Input : n = 3, d = 9 Output : 648 A simple solution is to traverse t
8 min read
Count of unique digits in a given number N
Given a number N, the task is to count the number of unique digits in the given number. Examples: Input: N = 22342 Output: 2 Explanation:The digits 3 and 4 occurs only once. Hence, the output is 2. Input: N = 99677 Output: 1Explanation:The digit 6 occurs only once. Hence, the output is 1. Naive Appr
6 min read
Count of N-digit numbers having digit XOR as single digit
Given an integer N, the task is to find the total count of N-Digit numbers such that the Bitwise XOR of the digits of the numbers is a single digit. Examples: Input: N = 1Output: 9Explanation: 1, 2, 3, 4, 5, 6, 7, 8, 9 are the numbers. Input: N = 2Output: 66Explanation: There are 66 such 2-digit num
14 min read
Count even and odd digits in an Integer
A certain number is given and the task is to count even digits and odd digits of the number and also even digits are present even a number of times and, similarly, for odd numbers. Print Yes If: If number contains even digits even number of time Odd digits odd number of times Else Print No Examples
13 min read
Count 'd' digit positive integers with 0 as a digit
Given a number d, representing the number of digits of a positive integer. Find the total count of positive integer (consisting of d digits exactly) which have at-least one zero in them.Examples: Input : d = 1 Output : 0 There's no natural number of 1 digit that contains a zero. Input : d = 2 Output
5 min read
Count of N digit numbers not having given prefixes
Given an integer N and a vector of strings prefixes[], the task is to calculate the total possible strings of length N from characters '0' to '9'. such that the given prefixes cannot be used in any of the strings. Examples: Input: N = 3, prefixes = {"42"}Output: 990Explanation: All string except{"42
8 min read
Count of repeating digits in a given Number
Given a number N, the task is to count the total number of repeating digits in the given number. Examples: Input: N = 99677 Output: 2Explanation:In the given number only 9 and 7 are repeating, hence the answer is 2. Input: N = 12Output: 0Explanation:In the given number no digits are repeating, hence
12 min read
Count of strictly increasing N-digit numbers
Given a positive integer N, the task is to find the number of N-digit numbers such that every digit is smaller than its adjacent digits. Examples: Input: N = 1Output: 10Explanation: All numbers from [0 - 9] satisfy the condition as there is only one digit. Input: N = 3Output: 525 Naive Approach: The
13 min read
Count of Binary Digit numbers smaller than N
Given a limit N, we need to find out the count of binary digit numbers which are smaller than N. Binary digit numbers are those numbers that contain only 0 and 1 as their digits, like 1, 10, 101, etc are binary digit numbers. Examples: Input : N = 200 Output : 7 Count of binary digit number smaller
6 min read
Count of N digit numbers with at least one digit as K
Given a number N and a digit K, The task is to count N digit numbers with at least one digit as K. Examples: Input: N = 3, K = 2Output: 252Explanation: For one occurrence of 2 - In a number of length 3, the following cases are possible:=>When first digit is 2 and other two digits can have 9 value
6 min read