Codeforces 221B - Little Elephant and Numbers
The Little Elephant loves numbers.
He has a positive integer x. The Little Elephant wants to find the number of positive integers d, such that d is the divisor of x, and x and d have at least one common (the same) digit in their decimal representations.
Help the Little Elephant to find the described number.
Input:
A single line contains a single integer x (1 ≤ x ≤ 109).
Output:
In a single line print an integer — the answer to the problem.
範例:
input:
1 | 1 |
output:
1 | 1 |
input:
1 | 10 |
output:
1 | 2 |
題意:
輸入N，問你所有N的因數中，有幾個因數有使用到N本身使用過的數字。
思路:
找因數只需要找到平方根就好。另一邊的因數可以用除的得知。