We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Implementation
  4. Between Two Sets
  5. Discussions

Between Two Sets

  • ScienceD + 1 comment

    What do you think about recursive approach? I think its better code. For such small array sizes its not that much slower.

    int between(vector < int > a, vector < int > b, int x){
    if(x <= 100)
    {
        bool good_x = true;
        for(int i = 0; i < a.size(); ++i)
            good_x &= x%a[i] == 0;
        for(int i = 0; i < b.size(); ++i)
            good_x &= b[i]%x == 0;
        return good_x + between(a, b, x+1);
    }
    else
        return 0;
}
    • elvis_dukaj + 0 comments

      In this case I think is more readable non recursive solution: 

      vector<int> A(m);
vector<int> B(n);
/// [...]
auto lcmOfA = lcm_element(A);
auto gcdOfB = gcd_element(B);
    
auto counter = 0;
auto multipleOfLcm = lcmOfA;
    
while (multipleOfLcm <= gcdOfB)
{
    counter += is_divisible(gcdOfB, multipleOfLcm);
    multipleOfLcm += lcmOfA;
}