Cerinta completa

An integer is a divisor of an integer if the remainder of .

Given an integer, for each digit that makes up the integer determine whether it is a divisor. Count the number of divisors occurring within the integer.

Example

Check whether , and are divisors of . All 3 numbers divide evenly into so return .

Check whether , , and are divisors of . All 3 numbers divide evenly into so return .

Check whether and are divisors of . is, but is not. Return .

Function Description

Complete the findDigits function in the editor below.

findDigits has the following parameter(s):

  • int n: the value to analyze

Returns

  • int: the number of digits in that are divisors of

Input Format

The first line is an integer, , the number of test cases.
The subsequent lines each contain an integer, .

Constraints


Sample Input

2
12
1012

Sample Output

2
3

Explanation

The number is broken into two digits, and . When is divided by either of those two digits, the remainder is so they are both divisors.

The number is broken into four digits, , , , and . is evenly divisible by its digits , , and , but it is not divisible by as division by zero is undefined.

Limbajul de programare folosit: python3

Cod:

#!/bin/python3

def findDigits(n):
    x = n
    cnt = 0
    while x > 0:
        d = x % 10
        if d != 0 and n % d == 0:
            cnt += 1
        x //= 10
    return cnt

if __name__ == '__main__':
    t = int(input().strip())
    out = []
    for _ in range(t):
        n = int(input().strip())
        out.append(str(findDigits(n)))
    print(*out, sep='\n')

Scor obtinut: 1.0

Submission ID: 464587976

Link challenge: https://www.hackerrank.com/challenges/find-digits/problem

Find Digits