每日一题 - 240412 - X进制减法

• X进制减法

---

• TAG - $芝士水题、算法-【进制转换、贪心】$
• 时间复杂度 - $O(N)$

//
#include <bits/stdc++.h>
using namespace std;
#define int long long 

const int MOD = 1e9 + 7;
vector<int> A, B;

void solve() {
    int n, m, x;
    scanf("%lld", &n);

    scanf("%lld", &m);
    while (m--) {
        scanf("%lld", &x);
        A.push_back(x);
    }
    scanf("%lld", &m);
    while (m--) {
        scanf("%lld", &x);
        B.push_back(x);
    }

    reverse(A.begin(), A.end());
    reverse(B.begin(), B.end());

    int maxx = max(A.size(), B.size());
    A.resize(maxx);
    B.resize(maxx);
    int ans = 0, r = 1; 
    for (int i = 0; i < maxx; i++) {
        ans = (ans + r * (A[i] - B[i])) % MOD;
        r = r * max(2LL, max(A[i], B[i]) + 1) % MOD;
    }                                   // + 1
    printf("%lld\n", ans);
}

signed main() {
    int t = 1;
    // scanf("%d", &t);
    while (t--) solve();
    return 0;
}

---

实现细节

• `

---

参考示意图

• `

---

参考链接

• `

---

作者 | 乐意奥AI