A check digit is a form of redundancy check used for mistake detection on identification numbers, such as bank account numbers, which are used in an application where they will at least sometimes be input manually. With a check digit, one can detect simple mistakes in the input of a series of characters (normally digits) such as a individual mistyped digit or some permutations of two successive digits.

COMING SOON!

```
/**
* You are given an integer N. Find the digits in this number that exactly divide N (division that leaves 0 as remainder) and display their count.
* For N=24, there are 2 digits (2 & 4). Both of these digits exactly divide 24. So our answer is 2.
*
* Note
*
* If the same number is repeated twice at different positions, it should be counted twice,
* e.g., For N=122, 2 divides 122 exactly and occurs at ones' and tens' position. So for this case, our answer is 3.
* Division by 0 is undefined.
*
*
* Input Format
* The first line contains T (the number of test cases), followed by T lines (each containing an integer N).
*
* Constraints
* 1≤T≤15
* 0<N<1010
* Output Format
*
* For each test case, display the count of digits in N that exactly divide N in a separate line.
*
* Sample Input
*
* 2
* 12
* 1012
*
* Sample Output
* 2
* 3
*/
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int T, num;
cin >> T;
for (int t = 0; t < T; ++t) {
cin >> num;
int c = 0, d =0;
int x = num;
while(x > 0) {
d = x % 10;
if ( d != 0 && num % d == 0) {
++c;
}
x = x/10;
}
cout << c << endl;
}
return 0;
}
```