Submission #2120345

---

Source Code Expand

N = gets.to_i
c = N.times.map { gets.split.map(&:to_i) }

ans = 0
ex = []

(0..(N-1)).to_a.combination(2) do |i, j|
  a = c[i]
  b = c[j]
  ex << i
  4.times do
    b.rotate!
    N.times do |n1|
      next if (ex + [i, j]).include?(n1)
      p1 = c[n1]
      4.times do
        p1.rotate!
        next if p1[0] != b[1] || p1[1] != a[0] || p1[2] != a[3] || p1[3] != b[2]
        N.times do |n2|
          next if (ex + [i, j, n1]).include?(n2)
          p2 = c[n2]
          4.times do
            p2.rotate!
            next if p2[0] !=b[2] || p2[1] != a[3] || p2[2] != a[2] || p2[3] != b[3]
            N.times do |n3|
              next if (ex + [i, j, n1, n2]).include?(n3)
              p3 = c[n3]
              4.times do
                p3.rotate!
                next if p3[0] != b[3] || p3[1] != a[2] || p3[2] != a[1] || p3[3] != b[0]
                N.times do |n4|
                  next if (ex + [i, j, n1, n2, n3]).include?(n4)
                  p4 = c[n4]
                  4.times do
                    p4.rotate!
                    next if p4[0] != b[0] || p4[1] != a[1] || p4[2] != a[0] || p4[3] != b[1]
                    ans += 1
                  end
                end
              end
            end
          end
        end
      end
    end
  end
end

p ans

Submission Info

Judge Result