For this Question: Sara wants to be the best programmer in the world but today she is stuck on an easy problem. Help her to solve it. 

<b>Problem description:- </b>
Choose an integer N and subtract the sum of digits of the number N from it i. e. if N is 245 then subtract 2+4+5 from it making it 245 - 11 = 234.
Keep on doing this operation until the number becomes 0 (for eg. 25 requires 3 operations to reduce to 0 
25 - > 18 - > 9 - > 0).

Given a number N, your task is to print the number of operations required to make the number 0.The first line of input contains a single integer containing the number of test cases T. Next T lines contain a single integer N.

Constraints:-
1 <= T <= 10000
1 <= N <= 1000000For each test case print the number of operations required to make the number 0.Sample Input:-
4
25
8
17
842

Sample Output:-
3
1
2
72

Explanation:-
25 - > 18 - > 9 - > 0
8 - > 0
17 - > 9 - > 0, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;

#define LL long long
int dp[1000001];

void solve() {
    int n; cin >> n;
    cout << dp[n] << '\n';
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    
    for(int i = 1; i <= 1000000; i++) {
        int s = 0, j = i;
        while(j > 0) {
            s += j % 10;
            j /= 10;
        }
        dp[i] = dp[i - s] + 1;
    }        

    int tt; cin >> tt;
    while(tt--) solve();
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?