CF28C.Bath Queue

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

There are nn students living in the campus. Every morning all students wake up at the same time and go to wash. There are mm rooms with wash basins. The ii -th of these rooms contains aia_{i} wash basins. Every student independently select one the rooms with equal probability and goes to it. After all students selected their rooms, students in each room divide into queues by the number of wash basins so that the size of the largest queue is the least possible. Calculate the expected value of the size of the largest queue among all rooms.

输入格式

The first line contains two positive integers nn and mm ( 1<=n,m<=501<=n,m<=50 ) — the amount of students and the amount of rooms. The second line contains mm integers a1,a2,... ,ama_{1},a_{2},...\ ,a_{m} ( 1<=ai<=501<=a_{i}<=50 ). aia_{i} means the amount of wash basins in the ii -th room.

输出格式

Output single number: the expected value of the size of the largest queue. Your answer must have an absolute or relative error less than 10910^{-9} .

输入输出样例

  • 输入#1

    1 1
    2
    

    输出#1

    1.00000000000000000000
    
  • 输入#2

    2 2
    1 1
    

    输出#2

    1.50000000000000000000
    
  • 输入#3

    2 3
    1 1 1
    

    输出#3

    1.33333333333333350000
    
  • 输入#4

    7 5
    1 1 2 3 1
    

    输出#4

    2.50216960000000070000
    
首页