package com.ford;

import java.util.LinkedList;
import java.util.List;

public class Ford {

    final static int max = Integer.MAX_VALUE;
    private static int[][] matrix = {{0, 5, 3, 4, 6, 8, max},
            {max, 0, max, 1, 4, max, max},
            {max, max, 0, max, 2, max, max},
            {max, max, max, 0, 3, 5, max},
            {max, max, max, max, 0, 4, 6},
            {max, max, max, max, max, 0, 5},
            {max, max, max, max, max, max, 0}};
    private static int[] m1 = {max, max, max, max, max, max, max};
//                                {max, max, max, max, max, max, max},
//                                {max, max, max, max, max, max, max},
//                                {max, max, max, max, max, max, max},
//                                {max, max, max, max, max, max, max},
//                                {max, max, max, max, max, max, max},
//                                {max, max, max, max, max, max, max}};

    static List<int[]> m2 = new LinkedList<>();


    public static void main(String[] args) {
        int[] tmp = new int[matrix[0].length];
        for (int i = 0; i < matrix.length; i++) {
        for (int j = 0; j < matrix[i].length; j++) {
            if (m1[j] - matrix[i][j] > matrix[i][j]) {
                tmp[j] = matrix[i][j];
            }
            System.out.print(tmp[j]);
            m2.add(tmp);
            }
        }
    }

    private static void count(int[][] matrix) {
        int[] tmp = new int[matrix[0].length];
        for (int i = 0; i < m2.get(i).length; i++) {
            for (int j = 0; j < matrix[i].length; j++) {
                if (m2.get(i)[j] - matrix[i][j] > matrix[i][j]) {
                    tmp[j] = matrix[i][j];
                }
                System.out.print(tmp[j]);
                m2.add(tmp);
            }
        }
    }
}