zoukankan      html  css  js  c++  java
  • FZU 2278 概率

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

     1 import java.math.BigInteger;
     2 import java.util.Scanner;
     3 
     4 public class Main {
     5     public static void main(String[] args) {
     6         Scanner sc=new Scanner(System.in);
     7         int T=sc.nextInt();
     8         int []a = new int[2010];
     9         int cnt=0;
    10         while (T>0)
    11         {
    12             int n=sc.nextInt();
    13             int m=sc.nextInt();
    14             BigInteger ans=BigInteger.valueOf(m);
    15             BigInteger card=BigInteger.valueOf(0);
    16             for (int i = 0; i < n; i++) a[i] = sc.nextInt();
    17             for (int i = 0; i < n; i++)
    18             {
    19                 if (a[i+1]>a[i])
    20                 {
    21                     card = card.add(ans.divide(BigInteger.valueOf(a[i])));
    22                     ans = ans.mod(BigInteger.valueOf(a[i]));
    23                 }
    24                 else
    25                 {
    26                     ans = ans.add(card.multiply(BigInteger.valueOf(a[i])));
    27                     card = BigInteger.valueOf(0);
    28                 }
    29             }
    30             System.out.printf("Case #%d: ",++cnt);
    31             System.out.println(ans.mod(BigInteger.valueOf(1000000007)));
    32             T--;
    33         }
    34     }
    35 }
  • 相关阅读:
    bzoj 1057: [ZJOI2007]棋盘制作
    【NOIP2012】开车旅行
    bzoj 2326: [HNOI2011]数学作业
    一本通1527欧拉回路
    一本通1530 Ant Trip
    一本通1528单词游戏
    luogu1856
    CF1045G
    10.18模拟赛
    10.16模拟赛
  • 原文地址:https://www.cnblogs.com/poler/p/7275605.html
Copyright © 2011-2022 走看看