A *k*-multiple free set is a set of integers where there is no pair of integers where one is equal to another integer multiplied by *k*. That is, there are no two integers *x* and *y* (*x* &lt; *y*) from the set, such that *y* = *x*·*k*.

You're given a set of *n* distinct positive integers. Your task is to find the size of it's largest *k*-multiple free subset.
The first line of the input contains two integers *n* and *k* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *k* ≤ 10<sup class="upper-index">9</sup>). The next line contains a list of *n* distinct positive integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).

All the numbers in the lines are separated by single spaces.
#include <bits/stdc++.h> 
using namespace std; 

int main() 
{ 
   long long n,i,k;
   double temp,B[n];
   set <int> s;
   cin >> n >> k;
   long long A[n];
   long long count = 0;
   for(i = 0 ; i<n ; i++ ){
       cin >> A[i];
   }
   sort(A,A+n);
   long long l,j;

   for(i = 0;i<n;i++){
    //   flag = 0;
        temp = A[i]/k;
       for(l = 0;l<n; l++){
   
    if(A[i]%k!=0 ||  !s.count(temp))
    s.insert(A[i]);
              
   }}
//   cout << sizeof(B)/sizeof(B[0]);
cout << s.size();
}