蓝桥杯——说好的进阶之买不到的数目

import java.util.Scanner;

public class Main{
	
	static int[] v = new int[100001];
	static int[] b ;//= { 3, 5 };

	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		String[] sarr=scanner.nextLine().split(" ");
		b=new int[sarr.length];
		for(int i=0;i<sarr.length;i++)
		{
			b[i]=Integer.parseInt(sarr[i]);
		}
		cal();
	}

	static void cal() {
		for (int i = 0; i < b.length; i++)
			v[b[i]] = 1;
		for (int i = 1; i < v.length; i++) {
			for (int j = 0; j < b.length; j++) {
				if (i - b[j] >= 0 && v[i - b[j]] == 1) {
					v[i] = 1;
				}
			}
		}
		int max = 0;
		for (int i = 1; i < v.length; i++) {
			if (v[i] != 1) {
				max = i;
			}
		}
		System.out.print(max);
	}
}