FZU 2278 概率

题目分析:http://acm.fzu.edu.cn/problem.php?pid=2278

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int T=sc.nextInt();
        int []a = new int[2010];
        int cnt=0;
        while (T>0)
        {
            int n=sc.nextInt();
            int m=sc.nextInt();
            BigInteger ans=BigInteger.valueOf(m);
            BigInteger card=BigInteger.valueOf(0);
            for (int i = 0; i < n; i++) a[i] = sc.nextInt();
            for (int i = 0; i < n; i++)
            {
                if (a[i+1]>a[i])
                {
                    card = card.add(ans.divide(BigInteger.valueOf(a[i])));
                    ans = ans.mod(BigInteger.valueOf(a[i]));
                }
                else
                {
                    ans = ans.add(card.multiply(BigInteger.valueOf(a[i])));
                    card = BigInteger.valueOf(0);
                }
            }
            System.out.printf("Case #%d: ",++cnt);
            System.out.println(ans.mod(BigInteger.valueOf(1000000007)));
            T--;
        }
    }
}