2016a_83que1

    public static int minPoints(int[][] m)
    {
        return minPoints(m, 0, 0, 1);
    }

    private static int minPoints(int[][] m, int i, int j, int num)
    {
        if(num <= 0)
            return Integer.MAX_VALUE;
        if(i == m.length || j == m[0].length)
            return Integer.MAX_VALUE;
        if(i == m.length - 1 && j == m[0].length - 1)
            return (num - m[i][j]) > 0 ? (num - m[i][j]) : 1;
        return Math.min(minPoints(m, i + 1, j, num - m[i][j]), minPoints(m, i, j + 1, num - m[i][j]));
    }