# Solution for individual divisible digit algorithm in php

Given an integer, NN, traverse its digits (dd1,dd2,...,ddn) and determine how many digits evenly divide NN (i.e.: count the number of times NN divided by each digit ddi has a remainder of 00). Print the number of evenly divisible digits.

Note: Each digit is considered to be unique, so each occurrence of the same evenly divisible digit should be counted (i.e.: for N=111N=111, the answer is 33).

Input Format

The first line is an integer, TT, indicating the number of test cases.

The TT subsequent lines each contain an integer, NN.

Constraints

1<=T<=15

0

Output Format

For every test case, count and print (on a new line) the number of digits in NN that are able to evenly divide NN.

Sample Input

2

12

1012

Sample Output

2

3

Explanation

The number 1212 is broken into two digits, 11 and 22. When 1212 is divided by either of those digits, the calculation's remainder is 00; thus, the number of evenly-divisible digits in 1212 is 22.

The number 10121012 is broken into four digits, 11, 00, 11, and 22. 10121012 is evenly divisible by its digits 11, 11, and 22, but it is not divisible by 00 as division by zero is undefined; thus, our count of evenly divisible digits is 3.

**Solution**<?php

$handle = fopen ("find_digit.txt","r");

fscanf($handle,"%d",$t);

for($a0 = 0; $a0 < $t; $a0++){

fscanf($handle,"%d",$n);

$arr = str_split($n);

$cntArr=count($arr);

$cnt=0;

for($i=0;$i<$cntArr;$i++) {

$div=(int)$arr[$i];

if($div!=0 &&($n%$div)==0) {

$cnt++;

}

}

echo $cnt.PHP_EOL;

}

fclose($handle);?>

**NOTE:**find_digit.txt contains following

2

12

1012

Feel free to comment, if you face any issue

We need your support to operate it properly. We have lots of ideas but less fund, so help us with your funding.

If a country is to be corruption free and become a nation of beautiful minds, I strongly feel there are three key societal members who can make a difference. They are the father, the mother and the teacher.