fork download
copy 
  1. import Control.Applicative
  2. import Data.List
  3.  
  4. main = putStrLn $ unlines [concat [show $ count (x, y)|x<-[0..7]]| y<-[0..7]]
  5.  
  6. count pos = maybe 0 id $ findIndex (elem pos) positions
  7.  
  8. positions = iterate next [(0,0)]
  9. next x = g ((map p $ ((,)<$>[1,-1]<*>[2,-2]) ++ ((,)<$>[2,-2]<*>[1,-1])) <*> x)
  10. p (a,b) (c,d) = (a+c, b+d)
  11. g = filter (\(x, y) -> 0 <= x && 0 <= y)
  12.  
Success #stdin #stdout 0s 6268KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
03232345
34123434
21432345
32323434
23234345
34343454
43434545
54545456
https://ideone.com/LIp6N5
language:
Haskell (ghc 8.4.4)
created:
10 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!