蓝桥杯2013年第四届真题-买不到的数目

动态规划法

package com.lanqiao2013;

import java.util.Arrays;
import java.util.Scanner;

public class T1427 {
	public static void main(String[] args) {
		Scanner scan=new Scanner(System.in);
		int m = scan.nextInt();
		int n= scan.nextInt();
		int max=Math.max(m, n);
		
		long[]dp=new long[9999999];
		Arrays.fill(dp, 0);
		dp[m]=1;
		dp[n]=1;
		
		int count=0; long index=0;
		for(int i=0;i<dp.length;i++) {
			if(dp[i]==1) {
				dp[i+m]=1;
				dp[i+n]=1;
				count++;
			}else {
				index=i;
				count=0;
			}
			if(count>=max) break;
		}
		System.out.println(index);
	}
	

}