The number of specified digits (#1609)

Algorithm Analysis

Iterate through the digits of the number $n$ . Find the number of digits $a$ in the number $n$ . If the number $n$ is negative, then change its sign to the opposite.

Algorithm Implementation

Read the input data. If the number $n$ is negative, then calculate its absolute value.

scanf("%d %d", &n, &a);
if (n < 0) n = -n;

In the variable $res$ , count the number of digits $a$ .

res = 0;

Iterate through the digits of the number $n$ .

while (n > 0)
{
    if (n % 10 == a) res++;
    n /= 10;
}

Output the answer.

printf("%d\n", res);

Java Implementation

import java.util.*;

public class Main
{
    public static void main(String[] args)
    {
        Scanner con = new Scanner(System.in);
        int n = con.nextInt();
        int a = con.nextInt();
        if (n < 0) n = -n;
        int res = 0;
        while (n > 0)
        {
            if (n % 10 == a) res++;
            n /= 10;
        }
        System.out.println(res);  
        con.close();
    }
}

Python Implementation

n = int(input())
a = int(input())
if n < 0: n = -n

res = 0
while n > 0:
    if n % 10 == a:
        res += 1
    n = n // 10

print(res)