cpp/F20RecursionAssignment/CountZeros.cpp at main · roydevashish/cpp · GitHub

History

57 lines (43 loc) · 913 Bytes

Raw

Title: Count Zeros

Problem statement

Given an integer N, count and return the number of zeros that are present in the given integer

using recursion.

Detailed explanation ( Input/output format, Notes, Images )

Input Format :

Integer N

Output Format :

Number of zeros in N

Constraints :

0 <= N <= 10^9

Sample Input 1 :

Sample Output 1 :

Sample Input 2 :

00010204

Sample Output 2 :

Explanation for Sample Output 2 :

Even though "00010204" has 5 zeros, the output would still be 2 because when you convert it to an

integer, it becomes 10204.

Sample Input 3 :

708000

Sample Output 3 :

#include<iostream>

using namespace std;

int CountZeros(int n) {

if(n == 0) {

return 0;

}

int small_output = CountZeros(n/10);

int output = n % 10 == 0 ? 1 + small_output : small_output;

return output;

}

int main() {

int n;

cin >> n;

cout << CountZeros(n) << endl;

}

cpp/F20RecursionAssignment/CountZeros.cpp at main · roydevashish/cpp · GitHub

Expand file tree

Breadcrumbs

CountZeros.cpp

Latest commit

History

Breadcrumbs

CountZeros.cpp

File metadata and controls