首页 > 专题系列 > Java解POJ > POJ 1742 Coins [解题报告] Java
2013
11-10

POJ 1742 Coins [解题报告] Java

Coins

问题描述 :

People in Silverland use coins.They have coins of value A1,A2,A3…An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn’t know the exact price of the watch.

You are to write a program which reads n,m,A1,A2,A3…An and C1,C2,C3…Cn corresponding to the number of Tony’s coins of value A1,A2,A3…An then calculate how many prices(form 1 to m) Tony can pay use these coins.

输入:

The input contains several test cases. The first line of each test case contains two integers n(1<=n<=100),m(m<=100000).The second line contains 2n integers, denoting A1,A2,A3...An,C1,C2,C3...Cn (1<=Ai<=100000,1<=Ci<=1000). The last test case is followed by two zeros.

输出:

For each test case output the answer on a single line.

样例输入:

3 10
1 2 4 2 1 1
2 5
1 4 2 1
0 0

样例输出:

8
4

解题代码:

/* @author: */
import java.util.Scanner;
import java.util.Arrays;
public class Main{
  public static void main(String args[])
{
   int N, M;
   Scanner sc=new Scanner(System.in);
   while(sc.hasNext())
   {
      N=sc.nextInt();//硬币的种数
      M=sc.nextInt();//
      if(N==0&&M==0) break;
      int a[]=new int[100];//a[i]表示第i种硬币的面值
      int c[]=new int [100];//c[i]表示第i种硬币的个数

      for (int i=0; i< N; i++) a[i]=sc.nextInt();
      for (int i=0; i< N; i++) c[i]=sc.nextInt();

      int nRes=0;
      boolean s[]=new boolean[100001];
      s[0]=true;

      for (int i=0; i< N; i++)
      {
          int u[]=new int[100001];
          for (int j=a[i]; j<=M; j++)
          {
             if (!s[j] && s[j-a[i]] && u[j-a[i]]< c[i])
              {
                   s[j]=true;
                   u[j]=u[j-a[i]]+1;
                   nRes++;
              }
          }
      }
      System.out.printf("%d\n", nRes);
   }
  } 
}