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 Rust (1.42.0) (judge verdict: Wrong Answer)

#[allow(unused_imports)]
use proconio::{fastout, input};

#[fastout]
fn main() {
    input!(n: usize, a: [f64; n]);

    let aaa = 1000000000.0;
    let mut vvv = Vec::new();
    for v in a {
        let buff = (v * aaa) as usize;
        vvv.push(vec![count_div(buff, 2), count_div(buff, 5)]);
    }

    let mut count = 0;
    for i in 0..n {
        for j in i + 1..n {
            if vvv[i][0] + vvv[j][0] >= 18 && vvv[i][1] + vvv[j][1] >= 18 {
                count += 1;
            }
        }
    }

    println!("{}", count);
}

fn count_div(target: usize, div: usize) -> usize {
    let mut count = 0;
    let mut buff = target;
    loop {
        if buff % div == 0 {
            buff = buff / div;
            count += 1;
        } else {
            break;
        }
    }

    return count;
}