Submission #1775420

---

Source Code Expand

#include <iostream>
#include <queue>
using namespace std;

int main()
{
    int a, b;
    cin >> a >> b;
    queue< pair<int, int> > q;
    pair<int, int> initial;
    initial.first = a;
    initial.second = 0;
    q.push(initial);

    while (q.size() > 0) {
        pair<int, int> cur = q.front();
        q.pop();
        if (cur.first == b) {
            cout << cur.second << endl;
            break;
        }
        pair<int, int> tmp;
        tmp.second = cur.second + 1;
        tmp.first = cur.first + 10;
        q.push(tmp);
        tmp.first = cur.first + 5;
        q.push(tmp);
        tmp.first = cur.first + 1;
        q.push(tmp);
        tmp.first = cur.first - 1;
        q.push(tmp);
        tmp.first = cur.first - 5;
        q.push(tmp);
        tmp.first = cur.first - 10;
        q.push(tmp);

    }

    return 0;
}

Submission Info

Judge Result