Problem:
Score : 300 points

Problem Statement

You are given N real values A_1, A_2, \ldots, A_N.
Compute the number of pairs of indices (i, j)
such that i < j and the product A_i \cdot A_j is integer.

Constraints

2 \leq N \leq 200\,000

0 < A_i < 10^4

A_i is given with at most 9 digits after the decimal.

Input

Input is given from Standard Input in the following format.

N
A_1
A_2
\vdots
A_N

Output

Print the number of pairs with integer product A_i \cdot A_j (and i < j).

Sample Input 1

5
7.5
2.4
17.000000001
17
16.000000000

Sample Output 1

3

There are 3 pairs with integer product:

7.5 \cdot 2.4 = 18

7.5 \cdot 16 = 120

17 \cdot 16 = 272

Sample Input 2

11
0.9
1
1
1.25
2.30000
5
70
0.000000001
9999.999999999
0.999999999
1.000000001

Sample Output 2

8

Solution in Ruby (2.7.1) (judge verdict: Runtime Error)

require "prime"

class Problem
  attr_accessor *(?a..?z).to_a.map(&:to_sym)
  def initialize
    @n = gets.to_s.to_i
    @a = Array.new(n){ 
      x, y = gets.chomp.split(".")
      y ||= ""
      y = y.ljust(9,"0")
      (x + y).to_i
    }
  end

  def rec
    # dp[2の指数][5の指数] := 個数
    @dp = Array.new(40){ Array.new(18, 0) }
    a.each do |x|
      m2 = count_mod(x, 2)
      m5 = count_mod(x, 5)
      @dp[m2][m5] += 1
    end
  end

  def count_mod(x,n)
    ans = 0
    while x % n == 0
      x /= n
      ans += 1
    end
    ans
  end

  def solve
    rec
    ans = 0
    40.times do |i|
      18.times do |j|
        40.times do |k|
          18.times do |l|
            next if i + k < 18
            next if j + l < 18
            next if i * 20 + j < k * 20 + l

            if i == k && j == l
              ans += @dp[i][j] * (@dp[k][l] - 1) / 2
            else
              ans += @dp[i][j] * @dp[k][l]
            end
          end
        end
      end
    end
    ans
  end

  def show(ans)
    puts ans
  end
end

Problem.new.instance_eval do
  show(solve)
end