1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

bool sum(int x, int len, int target) {
    while (x) {
        --len;
        target -= x % 10;
        x /= 10;
    }
    return !len && !target;
}
 void solve() {
    int _;
    cin >> _;
    for (int ts = 1; ts <= _; ++ts) {
        int n;
        cin >> n;
        // get n length
        int len = 0, tmp = n;
        while (tmp) {
            ++len;
            tmp /= 10;
        }
         // test for len
        int ans = 0;
        for (int i = 0; i <= len * 9; ++i)
            ans += sum(n + i, len, i);
        for (int i = 0; i <= (len + 1) * 9; ++i)
            ans += sum(n + i, len + 1, i);
         cout << ans << endl;
    }
}

1
2
3
4
5
6
7

1  2  3
 \   /
  \ /
   X
   |\
   | \
x  3  1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

void solve() {
    int _;
    cin >> _;
    for (int ts = 1; ts <= _; ++ts) {
        int n;
        cin >> n;
        vector<int> p(n), a(n);
        for (int i = 0; i < n; ++i) cin >> p[i];
        for (int i = 0; i < n; ++i) cin >> a[i];
         int t = 0;
        bool ans = true;
        for (int i = 0; i < n; ++i) {
            while (t < n && p[t] != a[i]) ++t;
            if (p[t] != a[i]) ans = false;
        }
         cout << (ans ? "YES" : "NO") << endl;
    }
}

1
2
3
4
5
6
7
8
9
10
11
12

#define int long long
 void solve() {
    int _;
    cin >> _;
    for (int ts = 1; ts <= _; ++ts) {
        int p, q;
        cin >> p >> q;
        int x = p * 3 - 2 * q;
        cout << (x >= 0 && p - x >= 2 ? "Bob" : "Alice") << endl;
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

#define int long long
 void solve() {
    int _;
    cin >> _;
    for (int ts = 1; ts <= _; ++ts) {
        int n;
        cin >> n;
        vector<int> a(n);
        set<int> cnt;
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
            cnt.insert(a[i]);
        }
         int ans = 0;
        for (auto i = 0; i < n; ++i) {
            const auto end = cnt.upper_bound(a[i]);
            for (auto j = cnt.begin(); j != end; ++j) {
                const int v = a[i] * *j;
                if (v >= n) break;
                if (i - v >= 0 && a[i - v] == *j) ++ans;
                if (i + v < n && a[i + v] == *j && a[i] != *j) ++ans;
            }
        }
         cout << ans << endl;
    }
}