Problem:
Score : 200 points

Problem Statement

There are N points in a D-dimensional space.

The coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).

The distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.

How many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?

Constraints

All values in input are integers.

2 \leq N \leq 10

1 \leq D \leq 10

-20 \leq X_{ij} \leq 20

No two given points have the same coordinates. That is, if i \neq j, there exists k such that X_{ik} \neq X_{jk}.

Input

Input is given from Standard Input in the following format:

N D
X_{11} X_{12} ... X_{1D}
X_{21} X_{22} ... X_{2D}
\vdots
X_{N1} X_{N2} ... X_{ND}

Output

Print the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.

Sample Input 1

3 2
1 2
5 5
-2 8

Sample Output 1

1

The number of pairs with an integer distance is one, as follows:

The distance between the first point and the second point is \sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.

The distance between the second point and the third point is \sqrt{|5-(-2)|^2 + |5-8|^2} = \sqrt{58}, which is not an integer.

The distance between the third point and the first point is \sqrt{|-2-1|^2+|8-2|^2} = 3\sqrt{5}, which is not an integer.

Sample Input 2

3 4
-3 7 8 2
-12 1 10 2
-2 8 9 3

Sample Output 2

2

Sample Input 3

5 1
1
2
3
4
5

Sample Output 3

10

Solution in Rust (1.15.1) (judge verdict: Accepted)

fn read_split<T : std::str::FromStr>() -> Vec<T> {
    let mut input = String::new();
    std::io::stdin().read_line(&mut input).unwrap();
    input.trim().split_whitespace().map(|x| x.parse().ok().unwrap()).collect()
}

fn read_split_multi<T : std::str::FromStr>(count : i32) -> Vec<Vec<T>> {
    (0..count).map(|_| read_split()).collect()
}

fn main() {
    let inputs1 : Vec<i32> = read_split();
    let num_d = inputs1[0];
    let num_n = inputs1[1];
    let points : Vec<Vec<f32>> = read_split_multi(num_d);
    let mut result = 0;
    for point_a in 0..num_d {
        for point_b in (point_a + 1)..num_d {
            let mut total_distance = 0f32;
            let a_p = &points[point_a as usize];
            let b_p = &points[point_b as usize];
            for i in 0..num_n {
                let total = &a_p[i as usize] - &b_p[i as usize];
                total_distance += total * total;
            }
            let a = total_distance.sqrt();
            let b = *&a as i32;
            if a == b as f32 {
                result += 1;
            }
        }
        
    }

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