Problem:
Score : 900 points

Problem Statement

Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.

The mayor Ringo is planning to connect every pair of two different towns with a bidirectional road. The length of each road is undecided.

A Hamiltonian path is a path that starts at one of the towns and visits each of the other towns exactly once.
The reversal of a Hamiltonian path is considered the same as the original Hamiltonian path.

There are N! / 2 Hamiltonian paths. Ringo wants all these paths to have distinct total lengths (the sum of the lengths of the roads on a path), to make the city diverse.

Find one such set of the lengths of the roads, under the following conditions:

The length of each road must be a positive integer.

The maximum total length of a Hamiltonian path must be at most 10^{11}.

Constraints

N is a integer between 2 and 10 (inclusive).

Input

Input is given from Standard Input in the following format:

N

Output

Print a set of the lengths of the roads that meets the objective, in the following format:

w_{1, 1} \ w_{1, 2} \ w_{1, 3} \ ... \ w_{1, N}
w_{2, 1} \ w_{2, 2} \ w_{2, 3} \ ... \ w_{2, N}
: : :
w_{N, 1} \ w_{N, 2} \ w_{N, 3} \ ... \ w_{N, N}

where w_{i, j} is the length of the road connecting Town i and Town j, which must satisfy the following conditions:

w_{i, i} = 0

w_{i, j} = w_{j, i} \ (i \neq j)

1 \leq w_{i, j} \leq 10^{11} \ (i \neq j)

If there are multiple sets of lengths of the roads that meet the objective, any of them will be accepted.

Sample Input 1

3

Sample Output 1

0 6 15
6 0 21
15 21 0

There are three Hamiltonian paths. The total lengths of these paths are as follows:

1 → 2 → 3: The total length is 6 + 21 = 27.

1 → 3 → 2: The total length is 15 + 21 = 36.

2 → 1 → 3: The total length is 6 + 15 = 21.

They are distinct, so the objective is met.

Sample Input 2

4

Sample Output 2

0 111 157 193
111 0 224 239
157 224 0 258
193 239 258 0

There are 12 Hamiltonian paths, with distinct total lengths.

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

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

/**
 * Returns the least index of elements that are modified, wrapped with Some.
 * If the entire array is reversed, it returns None instead.
 * v's elements must be pairwise distinct.
 */
fn next_permutation<T: Ord>(v: &mut [T]) -> Option<usize> {
    let mut tail_dec: usize = 1;
    let n = v.len();
    while tail_dec < n {
        if v[n - tail_dec - 1] > v[n - tail_dec] {
            tail_dec += 1;
        } else {
            break;
        }
    }
    // v[n - tail_dec .. n] is strictly decreasing
    if tail_dec < n {
        let x = n - tail_dec - 1;
        let mut y = n;
        {
            let pivot = &v[x];
            for i in (n - tail_dec .. n).rev() {
                if v[i] > *pivot {
                    y = i;
                    break;
                }
            }
            assert!(y < n);
        }
        v.swap(x, y);
    }
    v[n - tail_dec .. n].reverse();
    if tail_dec < n {
        Some(n - tail_dec - 1)
    } else {
        None
    }
}

fn check(n: usize, dist: &[Vec<u64>]) -> Result<(), (usize, Vec<usize>, HashSet<u64>)> {
    let mut seen = HashSet::new();
    let mut p: Vec<_> = (0..n).collect();
    let mut col = 0;
    let mut ret = Ok(());
    loop {
        if p[0] < p[n - 1] {
            let mut tot = 0;
            for i in 0..n - 1 {
                tot += dist[p[i]][p[i + 1]];
            }
            if seen.contains(&tot) || tot > 100_000_000_000 {
                ret = Err(p.clone());
                col += 1;
            }
            seen.insert(tot);
        }
        if let None = next_permutation(&mut p) { break; }
    }
    ret.map_err(|x| (col, x, seen))
}

fn wrap(n: usize, dist: &[Vec<u64>], a: u64, b: u64) -> Vec<Vec<u64>> {
    let seq = [1, 2, 3, 5, 8, 13, 21, 34, 55];
    let mut ret = vec![vec![0; n + 1]; n + 1];
    let ma = seq[n - 1] + seq[n - 2];
    for i in 0..n {
        for j in 0..n {
            if i == j { continue; }
            ret[i][j] = dist[i][j] * a + b
        }
    }
    for i in 0..n {
        ret[i][n] = seq[i];
        ret[n][i] = seq[i];
    }
    ret
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (write!(out,$($format)*).unwrap());
    }
    input!(n: usize);
    let seq = [1, 2, 3, 5, 8, 13, 21, 34, 55];
    let mut dist = vec![vec![0, 1], vec![1, 0]];
    for i in 2..n {
        if i == 2 {
            dist = vec![vec![0, 1, 2], vec![1, 0, 3], vec![2, 3, 0]];
        } else {
            let ma = seq[i - 1] + seq[i - 2];
            let a = if i < 9 { [0, 0, 0, 6, 8, 14, 29, 49, 65][i] } else { 2 * ma };
            let b = if i < 9 { [0, 0, 0, 3, 8, 11, 21, 30, 43][i] } else { ma };
            /*
            if i >= 7 && false {
                let mut na = 0;
                let mut nb = 0;
                'outer:
                for a in ma..2 * ma + 1 {
                    for b in 0..ma + 1 {
                        let ndist = wrap(i, &dist, a, b);
                        if let Ok(_) = check(i + 1, &ndist) {
                            dist = ndist;
                            na = a;
                            nb = b;
                            break 'outer;
                        }
                    }
                }
                eprintln!("i = {}, na = {}, nb = {}, ma = {}", i, na, nb, ma);
            } else */ {
                dist = wrap(i, &dist, a, b);
            }
        }
    }
    for i in 0..n {
        for j in 0..n {
            puts!("{}{}", dist[i][j], if j + 1 == n { "\n" } else { " " });
        }
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}