Find the Digits that can divide the number N

Question

Given an integer N, traverse it's digits {d1,d2,d3,d4.....dn} and find out how many of them evenly dived the number N?
for example:1012 ,digits 1, 1 and 2 evenly divide 1012 while 0 does not
so the output is =3

Answer 1

Try this c++14 code and link below for compiled code where I tested this with some custom inputs:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int number,numberDigit,newnumber,countD,Orinumber,test;
    scanf("%d",&test);
    while(test--){
    scanf("%d",&number);
    Orinumber=number;
    countD=0;
    while(number){

           numberDigit=number%10;
           number=number/10;
           if(numberDigit==0){
            continue;
           }
           else{
            if((Orinumber%numberDigit)==0){
            countD++;
           }
       }
    }
    printf("%d\n",countD);
    }
    return 0;
}

Compile Online:
https://ideone.com/ba9oPD

Comments

worked perfectly thanks shivam.