蓝桥杯PREV_08买不到的数目(动态规划)

标签：动态规划   dp   算法   性能   优化   

题目：

代码如下：

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		int a = sc.nextInt();
		int b = sc.nextInt();
		sc.close();
		int one = Math.min(a, b);
		int two = Math.max(a, b);

		int[] array = new int[1000000];
		array[0] = one;
		int i = 1;
		int begin = one + 1;
		while (true) {

			if (begin % one == 0 || begin % two == 0
					|| begin % (one + two) == 0) {
				array[i] = begin;
				i++;
			} else {
				for (int j = i - 1; j >= 0; j--) {
					int temp = begin % array[j];
					if (temp == one || temp == two || temp == 0) {
						array[i] = begin;
						i++;
						break;
					}
				}
			}
			begin++;
			
			if (i >= one) {
				int sum = array[i - 1] - array[i - one];
				if (sum == one - 1) {
					System.out.println(array[i - one] - 1);
					return;
				}
			}
		}
	}
}

蓝桥杯PREV_08买不到的数目(动态规划)

标签：动态规划   dp   算法   性能   优化   

原文地址：http://blog.csdn.net/u011333588/article/details/45952157