Find Digits

Find Digits


Given an integer, , traverse its digits (1,2,...,n) and determine how many digits evenly divide  (i.e.: count the number of times  divided by each digit i has a remainder of ). Print the number of evenly divisible digits.
Note: Each digit is considered to be unique, so each occurrence of the same evenly divisible digit should be counted (i.e.: for , the answer is ).
Solution---

#include<stdio.h>
int main()
{
        int t,i,a,d,c,count,j;
        scanf("%d",&t);
        for(i=0;i<t;i++)
        {       count=0;
                scanf("%d",&a);
                c=a;
                while(a!=0){
                d=a%10;
                a=a/10;
                
             if(d!=0 && c%d==0)
                        count++;
                              
               
                }
                printf("%d\n",count);
        }
return 0;
}

Comments

Post a Comment

Popular posts from this blog

HackeRank Problem John Watson performs an operation called a  right circular rotation  on an array of integers,  . After performing one  right circular rotation  operation, the array is transformed from   to  . Watson performs this operation   times. To test Sherlock's ability to identify the current element at a particular position in the rotated array, Watson asks   queries, where each query consists of a single integer,  , for which you must print the element at index   in the rotated array (i.e., the value of  ). -----Solution---- #include <math.h> #include <stdio.h> #include <string.h> #include <stdlib.h> #include <assert.h> #include <limits.h> #include <stdbool.h> int main(){     int n,k,q     scanf("%d %d %d",&n,&k,&q);     int *a = malloc(sizeof(int) * n);     for(int a_i = 0; a_i < n; a_i++){        scanf("%d",&a[a_i]);     }     for(int a0 = 0; a0 < q; a0++){  
Read more

Cut the sticks

Cut the sticks     You are given   sticks, where the  length  of each stick is a positive integer. A  cut operation  is performed on the sticks such that all of them are reduced by the length of the smallest stick. ---Solution--- #include <cmath> #include <cstdio> #include <vector> #include <iostream> #include <algorithm> using namespace std; int compare (const void * a, const void * b) {   return ( *(int*)a - *(int*)b ); } int main() {     /* Enter your code here. Read input from STDIN. Print output to STDOUT */        int element,k;     cin>>element;     int array[element];     for(int i=0;i<element;i++)         {             cin>>array[i];     }      qsort (array, element, sizeof(int), compare);     int p=element;     for(int i=0;i<element;i++)         {                            if(array[i]!=0)              {cout<<p<<endl;          if(p<=1)          {break;}             for(int j=element-1;j>=i;j--)    
Read more

Library Fine

Library Fine Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is as follows: If the book is returned on or before the expected return date, no fine will be charged (i.e.:  . If the book is returned after the expected return  day  but still within the same calendar month and year as the expected return date,  . If the book is returned after the expected return  month  but still within the same calendar year as the expected return date, the  . If the book is returned after the calendar  year  in which it was expected, there is a fixed fine of  . --Solution-- #include<stdio.h> int main() {         unsigned int dd1,mm1,yy1;         unsigned int dd2,mm2,yy2;         int dif=0;         scanf("%d%d%d",&dd1,&mm1,&yy1);         scanf("%d%d%d",&dd2,&mm2,&yy2);     if(dd1==6 &&
Read more