Write a program counts how many times given digits appear in given integers. For example:
Input will consist of several lines each with a digit d and a number x where:
0 ≤ d ≤ 9
0 ≤ x ≤ 1 000 000 000
For each line of input, output should contain a single line with a number c indicating the number of times the digit d appears on x. Leading zeroes should be ignored, they should not account towards the count.
Input is terminated by the end-of-file (EOF).
1 6 6 6 7 720 3 1337
0 1 1 2
Your program should be implemented using a “digit count” function that receives two integers, the digit d and the number x, and returns an integer indicating how many times the digit d appears in the number x. Please refer to the information for the chosen language:
def digit_count(d, x):
int digit_sum(int d, int x);
digitCount :: Int -> Int -> Int
int digit_count(int d, int x);
public static int DigitCount(int d, int i)in a public class
public static int digitCount(int d, int i)in a public class
function digit_count (d, x)
Submit your solution to be graded according to the following list:
Here are some hints:
Automated judge: Keep in mind that when your program is submitted it will not be run by a human but instead by an automated judge. Instructions should be followed exactly or the judge will not give you a full score. (And sometimes no score at all!)
Produce output as you go: You do not need to accumulate input and then produce everything at the end. It is enough to produce output as you go. As soon as you read a pair of numbers, write the corresponding result to the screen.
Detecting the end of file. In this exercise, input is terminated by the end-of-file (EOF). The EOF can be simulated by the “ctrl-D” keystroke on the terminal/console session. Please see “processing input line by line” for details on how to do this.
Processing digits. You can isolate the last digit of an integer by computing the remainder of the division by 10 (a.k.a. modulo). Likewise, you can remove the last digit by dividing a number by 10.
try next: digit-reverse
Copyright © 2020-2021 Rudy Matela
All rights reserved