Submission #40085847

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long

using namespace std;
const int N = 15;
ll l[N], r[N];
double pw[] = {0, 1, 10, 100, 1000, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9};

int main () {
    ll a, b, x;
    cin >> a >> b >> x;
    for (int i = 1; i < 10; i++) {
        l[i] = pw[i] * a + i * b;
        r[i] = (pw[i+1] - 1) * a + i * b;
        // cout << l[i] << ' ' << r[i] << endl;
    }
    l[10] = r[10] = pw[10] * a + 10 * b;
    if (x >= l[10])     cout << (ll)1e9;
    else if (x >= r[9]) cout << (ll)(1e9-1);
    else {
        // cout << (ll)((1e9 - 1) * a + 9 * b) <<endl;
        for (int i = 9; i >= 1; i--) {
            if (x >= l[i] && x <= r[i]) {
                ll dx = x - l[i];
                dx /= a;
                cout << (ll)(pw[i] + dx) << endl;
                return 0;
            }
            if (x >= r[i-1]) {
                cout << (ll)(pw[i] - 1);
                return 0;
            }
        }
        cout << 0;
    }
    
}

Submission Info

Judge Result