l_igor

#include <iostream>
#include <algorithm>
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include <vector>
#include <utility>

using namespace std;

typedef pair<int, int> pii;

int matrix[17][11] = {
    {0, 5, 0, 11, 0, 12, 0, 9, 0, 5, 0},
    {11, 0, 3, 0, 5, 0, 8, 0, 3, 0, 6},
    {0, 7, 0, 5, 0, 10, 0, 8, 0, 7, 0},
    {11, 0, 13, 0, 11, 0, 10, 0, 17, 0, 7},
    {0, 11, 0, 5, 0, 4, 0, 12, 0, 13, 0},
    {8, 0, 9, 0, 9, 0, 9, 0, 9, 0, 5},
    {0, 6, 0, 11, 0, 10, 0, 5, 0, 8, 0},
    {12, 0, 14, 0, 10, 0, 14, 0, 14, 0, 9},
    {0, 10, 0, 5, 0, 9, 0, 7, 0, 9, 0},
    {1, 0, 3, 0, 8, 0, 10, 0, 8, 0, 7},
    {0, 5, 0, 6, 0, 4, 0, 6, 0, 14, 0},
    {2, 0, 9, 0, 11, 0, 6, 0, 13, 0, 8},
    {0, 7, 0, 4, 0, 8, 0, 9, 0, 6, 0},
    {8, 0, 4, 0, 8, 0, 9, 0, 11, 0, 9},
    {0, 8, 0, 11, 0, 13, 0, 5, 0, 10, 0},
    {12, 0, 9, 0, 17, 0, 8, 0, 10, 0, 6},
    {0, 8, 0, 16, 0, 2, 0, 5, 0, 7, 0},
};

int main() {
    for (int i = 0; i < 17; i += 2) {
        for (int j = 0; j < 11; j += 2) {
            if (i == 0 && j == 0) j += 2;
            int mn = INT_MAX;
            if (i - 2 >= 0) {
                mn = min(mn, matrix[i - 1][j] + matrix[i - 2][j]);
            }
            if (j - 2 >= 0) {
                mn = min(mn, matrix[i][j - 1] + matrix[i][j - 2]);
            }
            //printf("i = %d, j = %d, mn = %d\n", i, j, mn);
            matrix[i][j] = mn;
        }
    }
    vector<pii> v;
    int i = 16;
    int j = 10;
    v.push_back(pii(i, j));
    while (i != 0 || j != 0) {
        if (i - 2 >= 0 && (matrix[i][j] == matrix[i - 1][j] + matrix[i - 2][j])) {
            i -= 2;
            v.push_back(pii(i, j));
        }
        else if (j - 2 >= 0 && (matrix[i][j] == matrix[i][j - 1] + matrix[i][j - 2])) {
            j -= 2;
            v.push_back(pii(i, j));
        }
    }
    reverse(v.begin(), v.end());
    for (auto p : v) {
        cout << p.first << " " << p.second << endl;
    }
    cout << matrix[16][10] << endl;
    return 0;
}