Pi
来源:互联网 发布:淘宝充值网易宝 编辑:程序博客网 时间:2024/04/25 20:34
#include <iostream>
#include <iomanip>
#include <math.h>
using namespace::std;
int cal(int a,int b)
{
if(b==0)
return a;
else
return cal(b,a%b);
}
int main()
{
int n;
while(cin >> n&&n)
{
int i,j,a[52]={0};
double k,m=0;
for(i=0;i<n;i++)
cin >> a[i];
k=n*(n-1)/2;
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if(cal(a[i],a[j])==1)
m++;
if(m==0)
cout << "No estimate for this data set.\n";
else
printf("%.6f\n",sqrt(6.0*k/m));
}
return 0;
}
/*
Problem description
Professor Robert A. J. Matthews of the Applied Mathematics and Computer Science Department at the University of Aston in Birmingham, England has recently described howthe positions of stars across the night skymay be used to deduce a surprisingly accurate value of . This result followed from the application of certain theorems in number theory.
Here, we don'thave the night sky, but can use the same theoretical basis to form an estimate for :
Given any pair of whole numbers chosen from a large, random collection of numbers, the probability that the twonumbers have no common factor other than one (1) is
6/(Pi*Pi)
For example, using the small collection of numbers: 2, 3, 4, 5, 6; there are 10 pairs that can be formed: (2,3), (2,4), etc. Six of the 10 pairs: (2,3), (2,5), (3,4), (3,5), (4,5) and (5,6) have no common factor other than one. Using the ratio of the counts as the probability we have:
6/(Pi*Pi)约等于6/10
Pi=3.162
In this problem, you'll receive a series of data sets. Each data set contains a set of pseudo-random positive integers. For each data set, find the portion of the pairs which may be formed that have nocommon factor other than one (1), and use the method illustrated above to obtain an estimate for . Report this estimate for each data set.
Input
The input consists of a series of data sets.
The first line of each data set contains a positive integer value, N, greater than one (1) and less than 50.
There is one positive integer per line for the next N lines that constitute the set for which the pairs are to be examined. These integers are each greater than 0 and less than 32768.
Each integer of the input stream has its first digit as the first character on the input line.
The set size designator, N, will be zero to indicate the end of data.
Output
A line with a single real value is to be emitted for each input data set encountered. This value is the estimate for for the data set. An output format like the sample below should be used. Answers must be rounded to six digits after the decimal point.
For some data sets, it may be impossible to estimate a value for . This occurs when there are no pairs without common factors. In these cases, emit the single-line message:
No estimate for this data set.
exactly, starting with the first character, "N", as the first character on the line.
Sample Input
5
2
3
4
5
6
2
13
39
0
Sample Output
3.162278
No estimate for this data set.
- PI
- pi
- Pi
- PI
- pi
- Pi
- Pi
- [pi
- pi
- PI
- π (PI)
- pi演算
- PI system
- 蒙特卡洛法求Pi
- 圆周率PI
- 求PI
- pi 函数
- Pi Monte
- Spring 3.0 OXM - Spring 3.0 框架新特性
- 素数槽
- LeetCode-Search a 2D Matrix
- Poj 1742 Coins(多重背包)
- How to think like a Computer Scientist: 课后习题第八章
- Pi
- #杜七的飘3#一次做不了几件事
- 面向服务的体系架构(SOA)和业务组件(BC)的思考
- Pollard_rho算法模板(大整数的因子分解)
- 黑马程序员 Java枚举
- 病毒实验
- 面向接口设计——软硬件开发的原则
- 最近遇到的web开发的一些小问题,该死的,几年没做这东西,太生手了
- Spring OXM使用体验