Counter

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

int main() {
    int x;
    cin >> x;
    
    if (x == 0) {
        cout << 0 << endl;
        exit(0);
    }
    
    vector<bool> visited(x + 1, false);
    queue<pair<int, int>> q;
    
    q.push(make_pair(0, 0));
    visited[0] = true;
    
    while (!q.empty()) {
        int curr = q.front().first;
        int moves = q.front().second;
        q.pop();
        
        if (curr + 11 <= x && !visited[curr + 11]) {
            if (curr + 11 == x) {
                cout << moves + 1 << endl;
                exit(0);
            }
            visited[curr + 11] = true;
            q.push(make_pair(curr + 11, moves + 1));
        }
        
        if (curr - 2 >= 0 && !visited[curr - 2]) {
            if (curr - 2 == x) {
                cout << moves + 1 << endl;
                exit(0);
            }
            visited[curr - 2] = true;
            q.push(make_pair(curr - 2, moves + 1));
        }
    }
    
    cout <<  -1 << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED