|All-time Popular Problems|
|Inorder Successor in BST|
|Depth First Traversal for a Graph|
|Delete nodes having greater value on right|
|Column name from a given column number|
|Search an Element in an array|
|Diameter of Binary Tree|
|Get minimum element from stack|
|Subset Sum Problem|
|Reverse words in a given string|
|Reverse a linked list|
Given a number N, the task is to count all the digits in N which divide N. Divisibility by 0 is not allowed. If any digit in N which is repeated divides N, then all repetitions of that digit should be counted
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integer N.
Print the count of all digits of n which divide n for each test case in a new line.
1<= T <=100
1<= No of digits in N <=105
For testcase 1: N=35. Now, 3 does not completely divide 35, but 5 does; so our count is 1.
For testcase 2: N=122324. Here, 1 divides N. 2 divides N. Again, 2 divides N. 3 does not divide N. 2 divides N. 4 divides N. So, total number of digits that divide N are 5.