| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
看看这么怎么老说WA#include "stdio.h"
#include "stdlib.h"
#include "math.h"
int main()
{
while(1)
{
int *set;
int times;
int i,j,a,b,c=0,count=0;
double pi=0.0;
scanf("%d", ×);
if(times==0) break;
set = (int*)malloc(sizeof(int)*times);
for(i=0; i<times; i++)
scanf("%d", &set[i]);
for(i=0; i<times; i++)
for(j=i+1; j<times; j++)
{
a = set[i]>set[j]?set[i]:set[j];
b = set[j]+set[i]-a;
while(c=a%b)
{
a=b;
b=c;
}
if(b==1) count++;
}
if(count)
{
pi = sqrt(3*times*(times-1)/count);
printf("%.6lf\n", pi);
}
else
printf("No estimate for this data set.\n");
free(set);
}
return 0;
}
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator