In this question what I have to do is: find the no. of digits in the given string which are divisor of the complete number represented by the string.
For numbers without 0 in it it is working fine. for example t=1 , s="12" , output=2
#include<bits/stdc++.h>
using namespace std;
int main()
{
    string s;
    long long t,i,n,ct;
    cin>>t;
    while(t--)
    {
        ct=0;
        cin>>s;
        n=stoi(s);
        for(i = 0; i < s.length(); i++)
        {
            if(n%(s[i]-'0') == 0 && s[i] != '0')
            {
                ct++;
            }
        }
        cout<<ct<<endl;
    }
}
 
     
    