code/FindingNumbers.cpp at master · ananth99/code · 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
50
51
52
53
54
55
56
57
58
59
/* Author: Ananth Madhavan */
/* Finding Numbers Problem. Freshdesk hiring challenge. */
#include <iostream>
#include <vector>

using namespace std;
int main(){
    int T;
    cin>>T;
    while(T--){
        unsigned long Z,M,N;
        vector <int> a;
        vector <int> b;
        int count=0;
        cin>>Z;
        cin>>M;
        cin>>N;
        int i,j;
        for(i=1;i<=M;++i)
            a.push_back(i);
        for(i=1;i<=N;++i)
            b.push_back(i);

        if(M<Z && N<Z){
            for(i=1;i<M;++i){
                for(j=1;a[i]*b[j]<=Z;++j)
                    if(a[i]*b[j]==Z)
                        count++;
            }
            cout<<count<<endl;
        }
	    else if(M<Z && N>=Z){
	        for(i=0;i<M;++i){
                for(j=0;a[i]*b[j]<=Z;++j)
                    if(a[i]*b[j]==Z)
                        count++;
            }
            cout<<count<<endl;
        }
	    else if(M>=Z && N<Z){
	        for(i=0;i<Z;++i){
                for(j=0;a[i]*b[j]<=Z;++j)
                    if(a[i]*b[j]==Z)
                        count++;
            }
            cout<<count<<endl;
        }
	    else if(M>=Z && N>=Z){
	        //count=count+2;
            for(i=0;i<Z;++i){
                for(j=0;a[i]*b[j]<=Z;++j)
                    if(a[i]*b[j]==Z)
                        count++;
            }
            cout<<count<<endl;
        }
	}
    return 0;
}