用python编写“生日悖论”的解决方法

Question

The Birthday Paradox (http://en.wikipedia.org/wiki/Birthday_problem) states
that if 23 people are selected at random, there is better than 50% chance that at
least two of them will have the same birthday (not considering the birth year).
You are to write a Python function to simulate selecting n people at random
and checking the probability of having at least two people with the same
birthday. You should ignore the leap years and assume 365-day years. To be
more specific, devise a Python function, call it bdp(n,k), that once invoked, will
select n numbers with replacement from the set of numbers 1 through 365
inclusive, determine if two or more of the numbers selected are the same (call
it a hit), and repeat this task k times, and finally return the percentage of the
hits. Plot your results similar to the graph in the above URL.
题目如上
悬赏100

Answer 1

import random

def bdp(n,k):

    cv = []

    for i in range(k):

        m = []

        for j in range(n):

            m.append(random.randint(1,365))

        counter = 0

            for k1 in m:

                for k2 in m:

                    if k1 == k2:

                        counter += 1

        cv.append(float(counter/2)/float(n))

        ss = 0

        for i in cv:

            ss += i

        return ss/float(len(cv))

亲测能用：

Answer 2

http://jsongo.com/2013/09/birthday-paradox/

追问

虽然是用python语句解决的 但是没根据题目要求啊