题解 | #称砝码#

//
// Created by Dell on 2024/3/27.
//
#include <iostream>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int n;
    while (cin >> n) {
        vector<int> weight(n);
        vector<int> num(n);
        for (int i = 0; i < n; i++) {
            cin >> weight[i];
        }
        for (int i = 0; i < n; i++) {
            cin >> num[i];
        }
        unordered_set<int> s;
        s.insert(0);
        for (int i = 0; i < n; i++) {
            for (int j = 1; j <= num[i]; j++) {
                unordered_set<int> temp(s);
                for (auto it = temp.begin(); it != temp.end(); it++) {
                    s.insert(*it + weight[i]);
                }

            }
        }
        cout << s.size() << endl;

    }
    return 0;
}
// 64 位输出请用 printf("%lld")