Introduction - If you have any usage issues, please Google them yourself
Of the problem: a coin flip from positive programming analog frequency map. Assuming throw 10 times for each event, record the number of times each receive a positive, throwing a total of 100,000 times, the calculated probability of a positive number of releases, and graphics output. Ideas: Numerical probabilistic algorithms commonly used in solving numerical problems, such algorithms are often derived from the approximate solution and the accuracy of approximate solution with the increase of computing time rising to a certain precision of the approximate solution to meet the problem requirements.