Competitive-Coding/Question_31.cpp at main · Coder404x2/Competitive-Coding · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <iostream>
using namespace std;


int product(int num) {
    int product = 1;
    while (num != 0) {
        product *= num%10;
        num /= 10;
    }

    return product;
}

int sum(int num) {
    int sum = 0;
    while (num != 0) {
        sum += num%10;
        num /= 10;
    }

    return sum;
}

int checkSpecial(int a, int b) {
    int count = 0;
    for(int i = a; i <= b; i++) {
        if(product(i)%sum(i) == 0) {
            count++;
        }
    }
    return count;
}

int main() {
    int n;
    cin >> n;

    int a[n], b[n];

    for(int i = 0; i < n; i++) {
        cin >> a[i];
        cin >> b[i];
    }

    for(int i = 0; i < n; i++) {
        cout << "Case #" << i +1 << ": " << checkSpecial(a[i], b[i]) << endl;
    }
}