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.
  1. Prepare
  2. Functional Programming
  3. Ad Hoc
  4. Huge GCD
  5. Discussions

Huge GCD

  • julius_angres
     + 0 comments

    One-liner in Haskell (no focus on performance though):

    solve :: [Integer] -> [Integer] -> Integer
solve ns ms = flip mod (10^9 + 7) 
            $ gcd (product ns) (product ms)