题解 | #称砝码#穷举

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        /**
         * 第一行：n --- 砝码的种数(范围[1,10])
         * 第二行：m1 m2 m3 ... mn --- 每种砝码的重量(范围[1,2000])
         * 第三行：x1 x2 x3 .... xn --- 每种砝码对应的数量(范围[1,10])
         */
        int n = in.nextInt();
        int[] weights = new int[n];
        int[] nums = new int[n];
        for(int i = 0;i<n;i++){
            weights[i] = in.nextInt();
        }
        for(int i = 0;i<n;i++){
            nums[i] = in.nextInt();
        }

        //所有砝码
        List<Integer> list = new ArrayList<>();
        for(int i = 0;i<n;i++){
            for(int j=0;j<nums[i];j++){
                list.add(weights[i]);
            }
        }

        Set<Integer> res = new HashSet<>();
        for(int i : list){
            List<Integer> temp = new ArrayList<>();
            for(Integer a : res){
                temp.add(a + i);
            }
            res.addAll(temp);
            res.add(i);
        }
        res.add(0);

        System.out.println(res.size());
    }

}