For this Question: The factor of a number is been divided into two types:-
1. Prime factors
2. Factors that can be further divided into more factors.

A number N is called a super number if all the factors other than the primes one's are divisible by each and every prime factor of N. 
Given a Number N check if it is a Super number or not.

Note:- 1 will not be counted as a factor<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>superNumber()</b> that takes integer N argument.

Constraints:-
1 <= N <= 100Return 1 if the given number is super else return 0.Sample Input:-
15

Sample Output:-
1

Explanation:-
Prime factors:- 3 and 5
15 is only factor, which is divisible by both 3 and 5

Sample Input:-
12

Sample Output:-
0

Explanation:-
Prime factors:-2 and 3
4 is a factor and it is not divisible by 3, I have written this Solution Code: 
int superNumber(int N){
    int x=1;
    int a[101];
    for(int i=0;i<=100;i++){
        a[i]=0;
    }
    int i=2;
    while(N>1){i=2;
        while(N%i!=0){
            i++;
        }
        a[i]++;
        N/=i;
    }
    int cnt1=0,cnt2=0;
    for(int i=2;i<=100;i++){
        if(a[i]>0){cnt1++;}
        if(a[i]>1){cnt2++;}
    }
   // cout<<cnt1<<" "<<cnt2;
    if((cnt1==2 && cnt2==0) || (cnt2>=0 && cnt1==1)){return 1;}
    return 0;
}

, In this Programming Language: C++, Now tell me if this Code is compilable or not?