4 ms·
Haskell: import Data.Numbers.Primes import Data.Counter countPrimeTransitions n = count $ zip primeEndings (tail primeEndings) where primeEndings =
by mudita 11y ago
Haskell:
import Data.Numbers.Primes
import Data.Counter
countPrimeTransitions n = count $ zip primeEndings (tail primeEndings)
where primeEndings = take (n+1) (map (`mod` 10) primes)
- odbol_ 11y agoI have no idea what's happening but I think you just won