Count the numbers satisfying (m + sum(m) + sum(sum(m))) equals to N
Basic Accuracy: 24.25% Submissions: 488 Points: 1

Given an integer N, the task is to find out the count of numbers M that satisfy the condition M + sum(M) + sum (sum(M)) = N, where sum(M) denotes the sum of digits in M.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a number N as input.

Output:
For each test case, print the count of numbers in new line.

Constraints:
1 <= T <= 500
1 <= N <= 109

Example:
Input:
2

5
9
Output:
0
1

Explanation:

Input: 9
Output: 1
Explanation: 
Only 1 positive integer satisfies the condition that is 3, 
3 + sum(3) + sum(sum(3)) = 3 + 3 + 3  = 9

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.