id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
18,600 |
int main(int argc, char* argv[])
{
int n[200],i,j,k;
double a=0,x[200]={0},s=0,S=0,sum[200]={0};
scanf("%d",&k);
for(j=0;j<k;j++){
scanf("%d\n",&n[j]);
s=0;
S=0;
a=0;
for(i=0;i<n[j];i++){
scanf("%lf",&x[i]);
s=s+x[i];
}
a=s/n[j];
for(i=0;i<n[j];i++){
S=S+((x[i]-a)*(x[i]-a));
sum[j]=sqrt(S/n[j]);
}
}
for(j=0;j<k;j++){
printf("%.5lf\n",sum[j]);
}
return 0;
}
| 38 |
18,601 | int main()
{ int k,n,h,i,j=0;
double b[100]={0};
double a,s,sum,c[100]={0};
cin>>k;
h=k;
while(k){
a=0;sum=0;
cin>>n;
for(i=0;i<n;i++){
cin>>b[i];
a+=b[i];
}
a=a/n;
for(i=0;i<n;i++)
sum+=(b[i]-a)*(b[i]-a);
sum/=n;
c[j]=sqrt(sum);
j++;
k--;
}
for(i=0;i<h;i++)
printf("%.5f\n",c[i]);
return 0;
}
| 38 |
18,602 | int main(){
int n,i,k;
scanf("%d",&n);
int geshu[100];
double shuju[100],S[100];
for(i=0;i<n;i++){
scanf("%d",&geshu[i]);
for(k=1;k<geshu[i]+1;k++){
scanf("%lf",&(shuju[k]));
}
double sum=0,a,b=0;
for(k=1;k<geshu[i]+1;k++){
sum+=shuju[k];
}
a=sum/(geshu[i]);
for(k=1;k<geshu[i]+1;k++){
b+=(shuju[k]-a)*(shuju[k]-a);
}
S[i]=sqrt(b/geshu[i]);
}
for(i=0;i<n;i++){
printf("%.5lf\n",S[i]);
}
return 0;
}
| 38 |
18,603 | int main()
{
int n[100];
int k;
double a[100][100];
scanf("%d",&k);
int i,j;
double pingjun[100],s[100];
for(i=0;i<100;i++)
{
pingjun[i]=0;
s[i]=0;
}
for(i=0;i<k;i++)
{
scanf("%d",&n[i]);
for(j=0;j<n[i];j++)
{
scanf("%lf",&a[i][j]);
}
}
for(i=0;i<k;i++)
{
for(j=0;j<n[i];j++)
{
pingjun[i]=pingjun[i]+a[i][j];
}
pingjun[i]=(double)pingjun[i]/n[i];
for(j=0;j<n[i];j++)
{
s[i]=s[i]+(a[i][j]-pingjun[i])*(a[i][j]-pingjun[i]);
}
s[i]=(double)sqrt(s[i]/n[i]);
printf("%.5lf\n",s[i]);
}
return 0;
} | 38 |
18,604 | int isrunnian(int year);
int main()
{
int n,m,i,j;
double b[1000],sum=0.0,s=0.0,a=0.0,s2=0.0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
sum=0;
s2=0;
scanf("%d",&m);
for(j=0;j<m;j++)
{
scanf("%lf",&b[j]);
}
for(j=0;j<m;j++)
{
sum+=b[j];
}
a=(double)sum/m;
for(j=0;j<m;j++)
{
s2+=(b[j]-a)*(b[j]-a);
}
s=sqrt(s2/m);
printf("%.5lf\n",s);
}
return 0;
}
| 38 |
18,605 |
double sz[100];
void Read(double n)
{
int i;
for(i=0; i<n; i++)
scanf("%lf", (sz+i));
}
void Calculate(double n)
{
int i;
double S, x, sum=0;
for(i=0; i<n; i++)
sum+=*(sz+i);
x=sum/n;
sum=0;
for(i=0; i<n; i++)
sum+=pow((*(sz+i)-x),2);
S=pow((sum/n),0.5);
printf("%.5f\n", S);
}
int main()
{
int m, i;
double n;
scanf("%d", &m);
for(i=0; i<m; i++)
{
scanf("%lf", &n);
Read(n);
Calculate(n);
}
return 0;
} | 38 |
18,606 | int main(){
int n,k,i,j;
double a[1000],ave,sum[100]={0},s1[100]={0},s[100]={0};
scanf("%d",&k);
for(i=0;i<k;i++){
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%lf",&a[j]);
sum[i]+=a[j];
}
ave=sum[i]/n;
for(j=0;j<n;j++){
s1[i]+=(a[j]-ave)*(a[j]-ave);
}
s[i]=sqrt(s1[i]/n);
}
for(i=0;i<k;i++){
printf("%.5lf\n",s[i]);
}
return 0;
} | 38 |
18,607 | int main()
{
int k,n,i,j;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&n);
double a[n];
for(j=0;j<n;j++)
scanf("%lf",&a[j]);
double x=0,y=0;
for(j=0;j<n;j++)
x=x+a[j];
x=x/n;
for(j=0;j<n;j++)
y=y+(a[j]-x)*(a[j]-x);
y=sqrt(y/n);
printf("%.5lf\n",y);}
return 0;
} | 38 |
18,608 | double fangcha(double *pi,int n)
{
int i;
double *pa;
pa=pi;
// printf("hanshu%lf\n",*pi);
double sum=0,ave;
for(i=0;i<n;i++)
{
sum+=*pi;
pi++;
}
ave=sum/n;
// printf("hanshuave=%lf\n",ave);
double s=0;
for(i=0;i<n;i++)
{
s+=((*pa-ave)*(*pa-ave));
*pa++;
// printf("hanshuzhongs1=%lf\n",s);
}
// printf("hanshuzhongs1=%lf\n",s);
s=s/(double)n;
// printf("hanshuzhongs2=%lf\n",s);
s=sqrt(s);
return s;
}
int main()
{
int k,i,j;
double x[100][100];
int b[100];
double xx[100];
scanf("%d",&k);
// printf("%d",k);
for(i=0;i<k;i++)
{
scanf("%d",&b[i]);
for(j=0;j<b[i];j++)
{
scanf("%lf",&x[i][j]);
// printf("%lf")
}
}
double *pi;
for(i=0;i<k;i++)
{
pi=&x[i][0];
// printf("waiwei%lf\n",*pi);
xx[i]=fangcha(pi,b[i]);
printf("%.5f\n",xx[i]);
}
return 0;
} | 38 |
18,609 | int main()
{
int k,n,i,j;
double x[100][1000],a,s[100]={0},*px,*ps;
px=x[0];
ps=s;
scanf("%d",&k);
for(i=0;i<k;i++){
a=0;
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%lf",((px+i)+j));
}
for(j=0;j<n;j++){
a=a+*((px+i)+j);
}
a=a/n;
for(j=0;j<n;j++){
*(ps+i)=*(ps+i)+(*((px+i)+j)-a)*(*((px+i)+j)-a);
}
*(ps+i)=*(ps+i)/n;
*(ps+i)=sqrt(*(ps+i));
}
for(i=0;i<k;i++){
printf("%.5lf\n",*(ps+i));
}
return 0;
} | 38 |
18,610 |
double calculate(double a[1000],int n)
{
int i;
double m,sum=0,s;
for(i=0;i<n;i++)
sum=sum+a[i];
m=sum/n;
sum=0;
for(i=0;i<n;i++)
sum=(a[i]-m)*(a[i]-m)+sum;
s=sqrt(sum/n);
return s;
}
int main()
{
int k,n,i,j;
double s;
double a[1000];
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%lf",&a[j]);
}
s=calculate(a,n);
printf("%.5lf\n",s);
}
return 0;
} | 38 |
18,611 |
int main()
{
int k,n;
scanf("%d",&k);
double sum=0,sum1=0,S,a,b,sz[100];
int i=0;
while(i<k){
scanf("%d",&n);
int j=0;
while(j<n){
scanf("%lf",&(sz[j]));
sum += sz[j];
j++;
}
a=(double)sum/n;
int o=0;
while(o<n){
b = (sz[o]-a)*(sz[o]-a);
sum1 += b;
o++;
}
S = sqrt(sum1/n);
printf("%.5f\n",S);
int x=0;
while(x<100){
sz[x]=0;
x++;
}
sum=0;
sum1=0;
i++;
}
return 0;
}
| 38 |
18,612 |
double average(int n,double*a)
{
double*p;
double sum=0;
for(p=a;p<a+n;p++)
{
sum+=*p;
}
return sum/n;
}
double fangcha(int n,double*a)
{
double*p,sum=0;
for(p=a;p<a+n;p++)
{
sum+=pow((*p-average(n,a)),2);
}
return sqrt(sum/n);
}
int main()
{
int num;
scanf("%d",&num);
int i;
for(i=0;i<num;i++)
{
int number;
scanf("%d",&number);
double*p;
double*a=(double*)malloc(sizeof(double)*number);
for(p=a;p<a+number;p++)
{
scanf("%lf",p);
}
printf("%.5lf\n",fangcha(number,a));
free(a);
}
return 0;
} | 38 |
18,613 | void main()
{
double *a[100],b,sum,e;
int i,n,k,m;
scanf("%d",&m);
k=0;
while(k<m)
{
scanf("%d",&n);
if(n==0)
printf("0");
else
{
for(i=0;i<=n-1;i++)
{
a[i] = (double*)malloc(sizeof(double));
scanf ("%lf",a[i]);
}
sum=0;
for(i=0;i<=n-1;i++)
{
sum=sum+*a[i];
}
b=sum/n;
sum=0;
for(i=0;i<=n-1;i++)
{
sum=sum+pow(*a[i]-b,2.0);
}
e=sqrt(sum/n);
printf("%.5f\n", e);
k++;
}
}
} | 38 |
18,614 | int main(){
double shuzu[K][N];
int k,n,i,j;
double sum_a=0,a,sum_s=0,s;
scanf("%d",&k);
for(j=0;j<k;j++){
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%lf",&shuzu[j][i]);
sum_a+=shuzu[j][i];
}
a=sum_a/n;
for(i=0;i<n;i++){
sum_s+=(shuzu[j][i]-a)*(shuzu[j][i]-a);
}
s=sqrt(sum_s/n);
printf("%.5lf\n",s);
sum_a=0;
sum_s=0;
}
return 0;
} | 38 |
18,615 | int main()
{
int k,n[100],i,p;
double x[100],sum[100],average[100],mm[100],s[100];
scanf("%d",&k);
for(i=0;i<k;i++)
{
sum[i]=0;
scanf("%d",&n[i]);
for(p=0;p<n[i];p++)
{
scanf("%lf",&x[p]);
sum[i]+=x[p];
}
average[i]=sum[i]/n[i];
mm[i]=0;
for(p=0;p<n[i];p++)
{
mm[i]+=pow(average[i]-x[p],2);
s[i]=pow(mm[i]/n[i],0.5);
}
}
for(i=0;i<k;i++)
{
printf("%.5f\n",s[i]);
}
return 0;
}
| 38 |
18,616 | int main()
{
int k,n,i,a[100];
double b[100],s=0,c,S=0,x,j;
scanf("%d",&k);
for(n=0;n<k;n++)
{
scanf("%d",&a[n]);
for(i=0;i<a[n];i++)
{
scanf("%lf",&b[i]);
s+=b[i];
}
c=s/a[n];
s=0;
for(i=0;i<a[n];i++)
{
S+=(b[i]-c)*(b[i]-c);
}
x=S/a[n];
S=0;
j=sqrt(x);
printf("%.5f\n",j);
}
return 0;
}
| 38 |
18,617 | int main()
{
int N,M;
double A[2013],S;
cin >> N;
for (int I = 1; I <= N; I ++)
{
cin >> M;
for (int J = 1; J <= M; J ++) cin >> A[J];
double *P = A;
S = 0;
for (int J = 1; J <= M; J ++) S += *(P + J);
S /= M;
double Ans = 0;
for (int J = 1; J <= M; J ++) Ans = Ans + (*(P + J) - S) * (*(P + J) - S);
printf("%.5lf\n",sqrt(Ans/M));
}
} | 38 |
18,618 | float a[100][1000];
int main()
{
int k,i,j,n[100];
double p[100]={0},s[100]={0};
double sum[100]={0};
cin >> k;
for (i=0;i<k;i++)
{
cin >> n[i];
for (j=0;j<n[i];j++)
cin >> a[i][j];
}
for (i=0;i<k;i++)
for (j=0;j<n[i];j++)
p[i] += a[i][j];
for (i=0;i<k;i++)
p[i]=p[i]/n[i];
for (i=0;i<k;i++)
for (j=0;j<n[i];j++)
sum[i] += pow(a[i][j]-p[i],2);
for (i=0;i<k;i++)
{
s[i]=sqrt(sum[i]/n[i]);
printf("%.5f\n", s[i]);
}
return 0;
}
| 38 |
18,619 | int main(int argc, char* argv[])
{
int n,m,i,j;
double a[1000],sum1=0,sum2=0,ave1=0,sum3=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
for(j=0;j<m;j++)
{
scanf("%lf",&a[j]);
sum1+=a[j];
}
ave1=sum1/m;
for(j=0;j<m;j++)
{
sum2+=(a[j]-ave1)*(a[j]-ave1);
}
sum3=pow(sum2/m,0.5);
printf("%.5lf\n",sum3);
sum1=0;
sum2=0;
sum3=0;
ave1=0;
}
return 0;
}
| 38 |
18,620 | void main()
{
int n,i,num,k;
double S,sz[1000]={0},ave,s,sum,*ptr,*p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num);
for(k=0;k<num;k++)
{
scanf("%lf",&sz[k]);
}
ptr=&sz[0];
sum=*ptr;
ptr++;
for(k=1;k<num;k++)
{
sum=sum+*ptr;
ptr++;
}
ave=sum/num;
p=&sz[0];
s=pow(*p-ave,2);
p++;
for(k=1;k<num;k++)
{
s=s+pow(*p-ave,2);
p++;
}
S=sqrt(s/num);
printf("%.5lf\n",S);
}
}
| 38 |
18,621 | int main(){
int n1,i,j,hhh[k];
double h[k][k],hh[k]={0},s[k],r[k]={0};
scanf("%d",&n1);
for(i=0;i<n1;i++){
scanf("%d",&hhh[i]);
for(j=0;j<hhh[i];j++){
scanf("%lf",&h[i][j]);
hh[i]+=h[i][j];
}
}
for(i=0;i<n1;i++){
for(j=0;j<hhh[i];j++){
r[i]+=pow(h[i][j]-hh[i]/hhh[i],2);
}
s[i]=sqrt(r[i]/hhh[i]);
printf("%.5lf\n",s[i]);
}
return 0;
} | 38 |
18,622 |
int main(int argc, char* argv[])
{
int k,i=0,j=0,n[100];
double x[100][100],aver[100],sum[100],S[100],s[100];
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&n[i]);
j=0;
for(j=0;j<n[i];j++)
{
scanf("%lf",&x[i][j]);
sum[i]=sum[i]+x[i][j];
}
}
i=0;
for(i=0;i<k;i++)
{
aver[i]=sum[i]/n[i];
}
i=0;
for(i=0;i<k;i++)
{
j=0;
for(j=0;j<n[i];j++)
{
S[i]=S[i]+pow((x[i][j]-aver[i]),2);
}
}
i=0;
for(i=0;i<k;i++)
{
s[i]=pow(S[i]/n[i],1.0/2);
printf("%.5lf\n",s[i]);
}
return 0;
}
| 38 |
18,623 | int main()
{
int k;
cin>>k;
int i,j,n;
double x[1001],*p;
double sum,sum2,eve,s;
for(i=0;i<k;i++)
{
sum=0,sum2=0;
cin>>n;
p=x;
for(j=0;j<n;j++)
{
cin>>*p;
sum=sum+*p;
sum2=sum2+(*p)*(*p);
}
eve=sum/n;
s=sqrt((sum2+n*eve*eve-2*sum*eve)/n);
cout<<fixed<<setprecision(5)<<s<<endl;
}
return 0;
} | 38 |
18,624 | void main()
{
double *a;
double s,t;
int n,i,j,k,l,m;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&n);
s=0.0;
a=(double *)malloc(sizeof(double)*(n+1));
for (j=0;j<n;j++)
{
scanf("%lf",(a+j));
s=s+*(a+j);
}
s=s/n;
t=0.0;
for (j=0;j<n;j++)
{
t=t+(*(a+j)-s)*(*(a+j)-s);
}
t=sqrt(t/n);
printf("%.5f\n",t);
free(a);
}
} | 38 |
18,625 | int main (){
int i,n,k,z;
double x[100],m1[100],a=0,e=0;
scanf("%d",&k);
for (z=0;z<k;z++){
e=0;
a=0;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%lf",&x[i]);
a+=x[i];
}
a=a/n;
for(i=0;i<n;i++){
e+=(x[i]-a)*(x[i]-a);
}
e=e/n;
m1[z]=pow(e,0.5);
}
for(z=0;z<k;z++){
printf("%.5lf\n",m1[z]);
}
return 0;
} | 38 |
18,626 | int main() {
int i,j,k,n;
double a[1000],sum,aver;
scanf("%d",&k);
for (i=0;i<k;i++) {
scanf("%d",&n);
sum = 0.0;
for (j=0;j<n;j++) {
scanf("%lf",&a[j]);
sum+=a[j];
}
aver = sum/(double)n;
sum = 0;
for (j=0;j<n;j++) {
sum+=(a[j]-aver)*(a[j]-aver);
}
aver = sqrt((sum)/(double)n);
printf("%.5lf\n",aver);
}
return 0;
} | 38 |
18,627 | main()
{
int k,n;
double *p;
double s,a,x;
int i,j;
scanf("%d",&k);
for(i=0;i<k;i++)
{
s=0;
a=0;
x=0;
scanf("%d",&n);
p=(double*)malloc(sizeof(double)*n);
for(j=0;j<n;j++)
{
scanf("%lf",&p[j]);
x=x+p[j]/n;
}
for(j=0;j<n;j++)
{
a=a+(p[j]-x)*(p[j]-x);
}
s=sqrt(a/n);
printf("%.5lf\n",s);
}
}
| 38 |
18,628 | int main()
{
int k,n;
int i,j;
double a[1001],evg,sum= 0;
double *p=a;
cin >> k;
while(k--){
sum = 0;
cin >>n;
for(i = 0;i < n;i++){
cin >> *(p+i);
sum+=*(p+i);
}
evg= sum/n;
sum = 0;
for(i = 0;i < n;i++)
sum +=(*(p+i) - evg)*(*(p+i) - evg);
sum/=n;
sum = sqrt(sum);
cout <<fixed<<setprecision(5)<<sum<<endl;
}
return 0;
}
| 38 |
18,629 | int main()
{
int k,i,j,n;
double A[100],sum1,sum2,S[100],a;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%lf",&A[j]);
}
for(j=0,sum1=0;j<n;j++)
{
sum1+=A[j];
}
a = sum1/n;
for(j=0,sum2=0;j<n;j++)
{
sum2+=(A[j]-a)*(A[j]-a);
}
S[i]=sqrt(sum2/n);
}
for(i=0;i<k;i++)
{
printf("%.5f\n",S[i]);
}
return 0;
}
| 38 |
18,630 | int main()
{
int k, n, i, j;
double a[100] = {0};
double *p;
double jun = 0, s = 0;
cin >> k;
for(j = 1; j <= k; j++)
{
cin >> n;
p = a;
for(i = 0; i < n; i++)
{
cin >> *(p + i);
}
for(i = 0; i < n; i++)
{
jun = jun + *(p + i);
}
jun = jun / n;
for(i = 0; i < n; i++)
{
s = s + (*(p + i) - jun) * (*(p + i) - jun);
}
s = sqrt(s / n);
cout << fixed << setprecision(5) << s << endl;
memset(a,0,sizeof(a));
jun = 0;
s = 0;
}
return 0;
} | 38 |
18,631 | int main()
{
int k,i,j,a[100];
double b[100][1000],c[100],d[100],jun[100],s[100];
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&a[i]);
for(j=0;j<a[i];j++)
{
scanf("%lf",&b[i][j]);
}
}
for(i=0;i<k;i++)
{
c[i]=0;
for(j=0;j<a[i];j++)
{
c[i]+=b[i][j];
}
}
for(i=0;i<k;i++)
{
jun[i]=c[i]/a[i];
}
for(i=0;i<k;i++)
{
d[i]=0;
for(j=0;j<a[i];j++)
{
d[i]+=pow(b[i][j]-jun[i],2);
}
}
for(i=0;i<k;i++)
{
s[i]=sqrt(d[i]/a[i]);
printf("%.5lf\n",s[i]);
}
return 0;
} | 38 |
18,632 |
int main()
{
int k, n, i;
double data[101], average, s, *p = NULL;
cin >> k;
for (i = 1; i <= k; i++)
{
cin >> n;
average = 0;
s = 0;
p = data;
for (p = data; p < data + n; p++)
{
cin >> *p;
average += *p;
}
average = average / n;
p = data;
for (p = data; p < data + n; p++)
s += (*p - average) * (*p - average);
s = sqrt(s / n);
cout << fixed << setprecision(5) << s << endl;
}
return 0;
} | 38 |
18,633 |
double fangcha(int n,double *p)
{
double a=0;
double s=0;
int i;
for (i=0;i<n;i++)
a=a+p[i];
a=a/n;
for (i=0;i<n;i++)
s=s+(p[i]-a)*(p[i]-a);
s=sqrt(s/n);
return (s);
}
main()
{
int k,n,i,j;
double num[100],result;
double *p;
p=num;
scanf("%d",&k);
for (j=1;j<=k;j++)
{
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%lf",&num[i]);
}
result=fangcha(n,p);
printf("%.5lf\n",result);
}
}
| 38 |
18,634 | int main()
{
int n,k,i,j;
scanf("%d",&k);
for(i=1;i<=k;i++)
{
double a=0.0,x[200],*px,s1=0.0,s=0.0;
scanf("%d",&n);
for(j=0;j<n;j++)
x[j]=0.0;
px=x;
for(j=0;j<n;j++)
{
scanf("%lf",px);
a+=*px/n;
px++;
}
px=x;
for(j=0;j<n;j++)
{
s1+=(*px-a)*(*px-a)/n;
px++;
}
s=sqrt(s1);
printf("%.5lf\n",s);
}
return 0;
}
| 38 |
18,635 | int main(){
int n,k,i,j;
double sz[100],sum=0,p,q,w;
scanf("%d",&k);
for(i=0;i<k;i++){
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%lf",&sz[j]);
}
for(j=0;j<n;j++){
sum+=sz[j];
}
p=sum/n;
sum=0;
for(j=0;j<n;j++){
sum+=(sz[j]-p)*(sz[j]-p);
q=sum/n;
}
w=sqrt(q);
printf("%.5lf\n",w);
sum=0;
}
} | 38 |
18,636 | int main()
{
double num[10000],sum,s;
int n,m;
int i,j,flag=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&m);
for(j=1,sum=0;j<=m;j++)
{
scanf("%lf",num+j);
sum+=*(num+j);
}
sum/=m;
for(j=1,s=0;j<=m;j++)
{
s+=d(*(num+j)-sum);
}
s/=m;
s=sqrt(s);
if(flag==1)
printf("\n");
flag=1;
printf("\n%.5lf",s);
}
// getch();
return 0;
}
| 38 |
18,637 |
int main()
{
int k;
cin >> k;
for(; k >= 1; k--)
{
int n;
double sum = 0;
double data[1000 + 10];
double *p = data;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> data[i];
sum += data[i];
}
double aver = sum / n;
double dsum = 0;
for(p = data; p < data + n; p++)
{
dsum += (*p - aver) * (*p - aver);
}
dsum /= n;
double s = sqrt(dsum);
cout << fixed << setprecision(5);
cout << s << endl;
}
} | 38 |
18,638 | double S(int m)
{
double a[m],aver=0,sum=0;
int i;
for(i=0;i<m;i++)
{
scanf("%lf",&a[i]);
aver+=a[i];
}
aver/=m;
for(i=0;i<m;i++)
sum+=(a[i]-aver)*(a[i]-aver);
return (sqrt(sum/m));
}
int main()
{
int n,m;
for(scanf("%d",&n);n>0;n--)
{
scanf("%d",&m);
printf("%.5f\n",S(m));
}
return 0;
}
| 38 |
18,639 | int main()
{
int k,n,i,j;
scanf("%d",&k);
double x[100][100],s[100]={0},sum=0,a[100];
for (i = 0; i < k; i++)
{
scanf("%d",&n);
sum=0;
for (j = 0; j < n; j++)
{
scanf("%lf",&x[i][j]);
sum+=x[i][j];
}
a[i]=sum/(double)(n);
for (j = 0; j < n; j++)
s[i]+=(x[i][j]-a[i])*(x[i][j]-a[i]);
s[i]=s[i]/(double)(n);
s[i]=sqrt(s[i]);
}
for (i = 0; i < k; i++)
printf("%.5lf\n",s[i]);
return 0;
} | 38 |
18,640 |
int main()
{
int m, n, i, j;
double *p;
double a[1010], sum, average, result;
cin >> m;
for (i = 1; i <= m; i++)
{
memset (a, 0, sizeof (a));
sum = 0;
average = 0;
result = 0;
cin >> n;
p = a;
for (j = 0; j < n; j++)
{
cin >> *(p + j);
sum += *(p + j);
}
average = sum / n;
sum = 0.0;
for (j = 0; j < n; j++)
{
*(p + j) = pow ((*(p + j) - average), 2);
sum += *(p + j);
}
average = sum / n;
result = sqrt (average);
cout << fixed << setprecision(5) << result << endl;
}
return 0;
} | 38 |
18,641 | double fangcha(double array[],int k)
{
double sum=0;
for(int i=0;i<k;i++){
sum+=array[i];}
double arrange=sum/k;
double array2[101];
for(int i=0;i<k;i++){
array2[i]=(array[i]-arrange)*(array[i]-arrange);}
double sum2=0;
for(int i=0;i<k;i++){
sum2+=array2[i];}
double result=sqrt(sum2/k);
return result;
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
int k;
double num[101];
cin>>k;
for(int j=0;j<k;j++){
cin>>num[j];}
printf("%.5lf\n",fangcha(num,k));}
return 0;
} | 38 |
18,642 |
int main()
{
int t, k;
cin >> k;
for (t = 0; t < k; t++)
{
int i,n;
cin >> n;
double x[101],*p,sum=0,ave,ts=0;
p = x;
for (i = 0; i < n; i++)
{
cin >> *p;
sum += *p;
p++;
}
ave = sum / n;
p = x;
for (i = 0; i < n; i++)
{
ts += (*p - ave)*(*p - ave);
p++;
}
double e;
e = sqrt(ts / n);
cout << fixed;
cout << setprecision(5) << e << endl;
}
return 0;
} | 38 |
18,643 | int main()
{
int n,m;
double sz[2000];
int i,j;
double average,sum=0,count=0,fangcha;
scanf("%d",&n);
for(i=0;i<n;i++)
{
sum=0;
average=0;
fangcha=0;
count=0;
for(j=0;j<m;j++)
{
sz[i]=0;
}
scanf("%d",&m);
for(j=0;j<m;j++)
{
scanf("%lf",&sz[j]);
sum=sum+sz[j];
}
average=sum/m;
for(j=0;j<m;j++)
{
count=count+(sz[j]-average)*(sz[j]-average);
}
fangcha=count/m;
fangcha=sqrt(fangcha);
printf("%.5lf\n",fangcha);
}
return 0;
} | 38 |
18,644 | int main()
{
int n;
int x,y,z;
double sum=0,sum1=0;
double a[1000],b,c,d;
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)
{ sum=0;sum1=0;
int m;
scanf("%d",&m);
for(j=0;j<m;j++)
{
scanf("%lf",&a[j]);
sum+=a[j];
}
b=sum/m;
for(j=0;j<m;j++)
{
c=pow(a[j]-b,2);
sum1+=c;
}
d=pow(sum1/m,0.5);
printf("%.5lf\n",d);
}
return 0;
} | 38 |
18,645 |
int main(int argc, char* argv[])
{
int k,j,n,i;
double x[1000],a=0,b=0,s[100]={0};
scanf ("%d",&k);
for (j=0;j<k;j++)
{
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%lf",&x[i]);
a=a+x[i];
}
a=a/n;
for (i=0;i<n;i++)
{
b=b+(x[i]-a)*(x[i]-a);
}
b=b/n;
s[j]=sqrt(b);
a=0;b=0;
}
for (j=0;j<k;j++)
{
printf ("%.5lf\n",s[j]);
}
return 0;
}
| 38 |
18,646 | int main(int argc, char* argv[])
{
int n=0,k=0,i=0,j=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&k);
double a=0,s=0;
double sz[1000];
for(j=0;j<k;j++)
{
scanf("%lf",&sz[j]);
a+=sz[j];
}
a=a/k;
for(j=0;j<k;j++)
{
s+=(sz[j]-a)*(sz[j]-a);
}
s=s/k;
s=sqrt(s);
printf("%.5f\n",s);
}
return 0;
}
| 38 |
18,647 | int main()
{
int n;
scanf("%d",&n);
double x[1000],a[100],h;
double p[100]={0};
int m[100];
for(int i=0;i<n;i++)
{
scanf("%d",&m[i]);
double h=0;
for(int j=0;j<m[i];j++)
{
scanf("%lf",&x[j]);
h += x[j];
}
a[i] = h/m[i];
p[i]=0;
for(int c=0;c<m[i];c++)
{
p[i] += (x[c]-a[i])*(x[c]-a[i]);
}
}
double S[100];
for(int v=0;v<n;v++)
{
S[v] = sqrt(p[v]/m[v]);
printf("%.5f\n", S[v]);
}
return 0;
} | 38 |
18,648 |
int main()
{
int n,k;
float x[100];
double a,s,y;
int i,j;
scanf("%d",&k);
for (i=1;i<=k;i++)
{
scanf("%d",&n);
for (j=1;j<=n;j++)
scanf("%f",&x[j]);
a=0;
y=0;
for (j=1;j<=n;j++)
a=a+x[j];
a=a/n;
for (j=1;j<=n;j++)
y=y+(x[j]-a)*(x[j]-a);
s=sqrt(y/n);
printf("%.5lf\n",s);
}
return 0;
}
| 38 |
18,649 | int main()
{
int n,c,i;
double so=0.0,sum=0.0,s,*p;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&c);
double *cj=(double*)malloc(sizeof(double)*c);
for(p=cj;p<cj+c;p++){
scanf("%lf",p);
so+=*p;
}
so=so/c;
for(p=cj;p<cj+c;p++){
sum+=(*p-so)*(*p-so);
}
sum=sum/c;
s=pow(sum,0.5);
printf("%.5f\n",s);
so=0;
sum=0;
free(cj);
}
return 0;
}
| 38 |
18,650 | int main()
{
int k, n, i, j;
double x[100], s, a, q=0, A=0;
scanf("%d", &k);
for(i=0; i<k; i++){
A = 0;
scanf("%d", &n);
for(j=0; j<n; j++){
scanf("%lf", &x[j]);
}
for(j=0; j<n; j++){
A = A + x[j];
}
a = (double)A / n;
q = 0;
for(j=0; j<n; j++){
q = q + (x[j]-a)*(x[j]-a);
}
s = sqrt(q/n);
printf("%.5lf\n", s);
}
return 0;
} | 38 |
18,651 | int main()
{
int n,i,j,k;
double A[100],s[100],a;
scanf("%d",&k);
for (i=0;i<k;i++)
{
a=0;s[i]=0;
scanf("%d",&n);
for (j=0;j<n;j++)
{
scanf("%lf",&A[j]);
a=a+A[j];
}
a=a/n;
for (j=0;j<n;j++)
{
s[i]=(A[j]-a)*(A[j]-a)+s[i];
}
s[i]=sqrt(s[i]/n);
}
for(i=0;i<k;i++)
printf("%.5f\n",s[i]);
return 0;
}
| 38 |
18,652 |
void main()
{
int k;
int n;
int i=0;
double *a[100]={NULL}, temp=0,average=0;
scanf("%d",&k);
for(k;k>0;k--)
{
scanf("%d",&n);
average=0;
for(i=0;i<n;i++)
{
*(a+i)=(double *)malloc(sizeof(double));
scanf("%lf",&temp);
**(a+i)=temp;
average=average+temp;
}
average=average/n;
temp=0;
for(i=0;i<n;i++)
{
**(a+i)=(**(a+i)-average)*(**(a+i)-average);
temp=temp+**(a+i);
}
temp=sqrt(temp/n);
printf("%.5f\n", temp);
}
} | 38 |
18,653 |
int main()
{
int n,a,i,j;
double x[100][1000],sum[100],S[100],ave[100],sum2[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
sum[i]=0;
S[i]=0;
ave[i]=0;
sum2[i]=0;
}
for(i=0;i<n;i++)
{
a=0;
scanf("%d",&a);
for(j=0;j<a;j++)
{
scanf("%lf",&x[i][j]);
sum[i]+=x[i][j];
}
ave[i]=sum[i]/(a*1.0);
for(j=0;j<a;j++)
{
sum2[i]+=(x[i][j]-ave[i])*(x[i][j]-ave[i]);
}
S[i]=sqrt(sum2[i]/(a*1.0));
}
for(i=0;i<n;i++)
printf("%.5lf\n",S[i]);
return 0;
} | 38 |
18,654 | int main()
{
int k,cycle;
cin>>k;
for(cycle=0;cycle<k;cycle++)
{
int n,i;
double a=0,s=0,x[1000]={0};
cin>>n;
for(i=0;i<n;i++)
{ scanf("%lf",&x[i]); a+=x[i];}
a=a/n;
for(i=0;i<n;i++) s+=abs(x[i]-a)*abs(x[i]-a);
s=sqrt(s/n);
printf("%.5f\n", s);
}
cin.get();
cin.get();
cin.get();
return 0;
}
| 38 |
18,655 | int main()
{
int i,j,row,n;
double s[1001],sum,c,ave,*f;
scanf("%d",&row);
for(i=1;i<=row;i++)
{
sum=0;
f=s;
scanf("%d",&n);
for(j=0;j<n;f++,j++)
{
scanf("%lf",f);
sum+=*f;
}
ave=sum/n;
f=s;
sum=0;
for(j=0;j<n;f++,j++)
{
sum+=(*f-ave)*(*f-ave);
}
c=sqrt(sum/n);
printf("%.5f\n", c);
}
}
| 38 |
18,656 | int main()
{
int k;
scanf("%d",&k);
while(k--)
{
int n;
scanf("%d",&n);
double a[200];
int i;
for(i=0;i<n;i++)
scanf("%lf",&a[i]);
double sum=0;
double *p;
for(p=a;p<a+n;p++)
sum+=*p;
double ave;
ave=sum/n;
double result=0;
for(p=a;p<a+n;p++)
result+=(*p-ave)*(*p-ave);
result=sqrt(result/n);
printf("%.5lf\n",result);
}
return 0;
} | 38 |
18,657 | int main()
{
int i,j,m,n;
double sqplus,plus,x,avr,outcome;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&m);
sqplus=0;
plus=0;
avr=0;
for (j=1;j<=m;j++)
{
scanf("%lf",&x);
sqplus=sqplus+x*x;
plus=plus+x;
}
avr=plus/m;
outcome=sqplus-2*plus*avr+m*avr*avr;
printf("%.5lf\n",sqrt(outcome/m));
}
return 0;
} | 38 |
18,658 | int main(int argc, char* argv[])
{
int k,i,j;
double sz[100][1000],pj[100],b,s[100];
scanf("%d",&k);
for(i=0;i<k;i++){
double sum=0.0,d=0.0;
int n;
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%lf",&sz[i][j]);
sum+=sz[i][j];
}
pj[i]=sum/n;
for(j=0;j<n;j++){
b=pow((sz[i][j]-pj[i]),2);
d+=b;
}
s[i]=sqrt(d/n);
}
for(i=0;i<k;i++){
printf("%.5f\n",s[i]);
}
return 0;
}
| 38 |
18,659 |
int main(){
int n;
scanf("%d",&n);
int i;
double sz[n];
for(i=0;i<n;i++){
int n1;
scanf("%d",&n1);
int j;
double sz1[n1];
double num=0;
for(j=0;j<n1;j++){
scanf("%lf",&(sz1[j]));
num+=sz1[j]/n1;
}
double s=0;
for(j=0;j<n1;j++){
s+=(sz1[j]-num)*(sz1[j]-num)/n1;
}
double s1=sqrt(s);
sz[i]=s1;
}
for(i=0;i<n;i++){
printf("%.5lf\n",sz[i]);
}
return 0;
} | 38 |
18,660 | int main()
{
int k,i,n,j,p;
double x[1000],a,b,s,S;
scanf("%d",&k);
for(i=0;i<k;i++)
{ a=0;
s=0;
S=0;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%lf",&x[j]);
a=a+x[j];
}
b=a/n;
j=0;
for(j=0;j<n;j++)
{
s=s+(x[j]-b)*(x[j]-b);
}
S=sqrt(s/n);
printf("%.5lf\n",S);
}
//scanf("%d",&p);
return 0;
}
| 38 |
18,661 |
int main(int argc, char* argv[])
{
int k,n[111],i,j;
double x[111][111];
double a[111],s[111],m[111],S[111];
scanf ("%d",&k);
for (i=0;i<k;i++)
{
scanf ("%d",&n[i]);
for (j=0;j<n[i];j++)
{
scanf ("%lf",&x[i][j]);
}
}
for (i=0;i<k;i++)
{
s[i]=0;
for (j=0;j<n[i];j++)
{
s[i]+=x[i][j];
}
a[i]=s[i]/n[i];
}
for (i=0;i<k;i++)
{
m[i]=0;
for (j=0;j<n[i];j++)
{
m[i]+=(x[i][j]-a[i])*(x[i][j]-a[i]);
}
S[i]=sqrt(m[i]/n[i]);
printf("%.5lf\n",S[i]);
}
return 0;
} | 38 |
18,662 | int main()
{
int k,n,i,j;
double f[101]={0},sum1=0,average,s,*p=f,sum2=0;
scanf("%d",&k);
for(i=1;i<=k;i++)
{
scanf("%d",&n);
for(j=0;j<=n-1;j++)
{
scanf("%lf",&f[j]);
sum1+=f[j];
}
average=sum1/n;
sum1=0;j=0;
while(j<=n-1)
{
sum2+=(p[j]-average)*(p[j]-average);
j++;
}
s=sqrt(sum2/n);
p=f;sum2=0;
printf("%.5lf\n",s);
}
} | 38 |
18,663 | int main()
{
double a[100];
double *p;
p=a;
int n,k;
cin>>n;
double sum1=0;
double s;
double sum2=0;
for (int i=1;i<=n;i++)
{
sum1=0;
sum2=0;
s=0;
cin>>k;
for (int j=0;j<k;j++)
{
cin>>p[j];
sum1+=p[j];
}
sum1=sum1/k;
for (int l=0;l<k;l++)
{
sum2+=(p[l]-sum1)*(p[l]-sum1);
}
sum2=sum2/k;
s=sqrt(sum2);
cout<<fixed<<setprecision(5)<<s<<endl;
}
return 0;
}
| 38 |
18,664 | int main()
{
int k;
scanf("%d", &k);
int i;
int n[1000],j,m;
double x[1000];
double sum=0;
double aver,total=0;
double out;
for(i=1;i<=k;i++)
{
scanf("%d", &*(n+i));
for(j=1;j<=*(n+i);j++)
{
scanf("%lf", &*(x+j));
sum=sum+*(x+j);
}
aver=(double)sum/ *(n+i);
for(m=1;m<=*(n+i);m++)
{
total=total+(aver-*(x+m))*(aver-*(x+m));
}
out=sqrt(total/ *(n+i));
printf("%.5lf\n", out);
sum=0;
total=0;
}
return 0;
}
| 38 |
18,665 | int main()
{
int k;//??????
cin>>k;
for(int i=0;i<k;i++)
{
double x[101],*p=x;//???????
double n,sum=0;;
cin>>n;
for(int j=0;j<n;j++){
cin>>*(p+j);
sum+=*(p+j);//????
}
double ave,s;
ave=sum/n;//?????
sum=0;
for(int j=0;j<n;j++) sum+=pow(*(p+j)-ave,2);//????
s=sqrt(sum/n);
cout<<fixed<<setprecision(5)<<s<<endl;//??
}
return 0;
} | 38 |
18,666 |
int main(int argc, char* argv[])
{
int n,k,i,j;
double x1[100],x2[100],a1,a2,sum1=0.0,sum2=0.0,s;
scanf("%d",&n);
for(i=0;i<n;i++)
{
sum1=sum2=0;
scanf("%d",&k);
for(j=0;j<k;j++)
{
scanf("%lf",&x1[j]);
sum1=sum1+x1[j];
}
a1=(double)sum1/k;
for(j=0;j<k;j++)
{
x2[j]=(x1[j]-a1)*(x1[j]-a1);
sum2=sum2+x2[j];
}
a2=(double)sum2/k;
s=sqrt(a2);
printf("%.5lf\n",s);
}
return 0;
} | 38 |
18,667 | int main()
{
int m,n,i,j;
double ave,num[100][1000],sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
ave=0;sum=0;
for(j=0;j<m;j++)
{
scanf("%lf",&num[i][j]);
sum=sum+num[i][j];
}
ave=(double)sum/m;
sum=0;
for(j=0;j<m;j++)
{
num[i][j]=num[i][j]-ave;
num[i][j]=num[i][j]*num[i][j];
sum=sum+num[i][j];
}
ave=(double)sum/m;
ave=(double)sqrt(ave);
printf("%.5lf\n",ave);
}
}
| 38 |
18,668 | int main()
{
int n, i,k,j;
double b[10000],c,d[10000],m;
double sum[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{m=0.0;
c=0.0;
scanf("%d",&k);
for(j=0;j<k;j++)
{
scanf("%lf",&b[j]);
}
for(j=0;j<k;j++)
{
c=c+b[j];
}
for(j=0;j<k;j++)
{
d[j]=b[j]-c/k;
m =m+d[j]*d[j];
}
sum[i]=sqrt(m/k);
}
for(i=0;i<n;i++)
{
printf("%.5lf\n",sum[i]);
}
return 0;
}
| 38 |
18,669 |
int re(int w,int r,int time);
int main(int argc, char* argv[])
{
int n,n1,i,j;
double sz[100],x=0,s=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&n1);
for(j=0;j<n1;j++){
scanf("%lf",&sz[j]);
}
for(j=0;j<n1;j++){
x+=sz[j];
}
x/=n1;
for(j=0;j<n1;j++){
s+=(sz[j]-x)*(sz[j]-x);
}
s/=n1;
s=pow(s,0.5);
printf("%.5f\n",s);
x=0;
s=0;
}
return 0;
}
| 38 |
18,670 |
int main()
{
int n,a;
float x[1000],c,d=0;
double f,e=0,q;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a);
for(int k=0;k<a;k++)
{
scanf("%f",&x[k]);
d=d+x[k];
}
c=d/a;
for(int p=0;p<a;p++)
{
q=(x[p]-c)*(x[p]-c)/a;
e=e+q;
f=sqrt(e);
}
printf("%.5lf\n",f);
d=0;
e=0;
}
return 0;
} | 38 |
18,671 | int main()
{
int k,i,j,n;
double t[1000];
double h,s,p,m;
scanf("%d\n",&k);
for(i=0;i<k;i++){
scanf("%d\n",&n);
h=s=0;
for(j=0;j<n;j++){
scanf("%lf ",&t[j]);
s=s+t[j];
}
p=(double)s/n;
for(j=0;j<n;j++){
h=h+(t[j]-p)*(t[j]-p);
}
m=(double)sqrt(h/n);
printf("%.5lf\n", m);
}
return 0;
}
| 38 |
18,672 | int main()
{
int m,n,j;
cin>>m;
for(int i=0;i<m;i++)
{
cin>>n;
double a[100];
double (*p)=a;
for( j=0;j<n;j++) cin>>*(p+j);
double averge,sum=0,s;
for( j=0;j<n;j++) sum=sum+*(p+j);
averge=sum/n;
sum=0;
for( j=0;j<n;j++) sum=sum+(*(p+j)-averge)*(*(p+j)-averge);
s=sqrt(sum/n);
printf("%.5f\n", s);
}
return 0;
}
| 38 |
18,673 | int main(){
int n,year[200],month1[200],month2[200],i=0,e=0,j=0,k=0;
double a[50],b=0,s=0,sum=0,average=0;
scanf("%d",&k);
while(i<k){
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%lf",&a[j]);
sum+=a[j];
}
average=sum/n;
for(j=0;j<n;j++){
b+=(a[j]-average)*(a[j]-average);
}
s=sqrt(b/n);
printf("%.5lf\n",s);
sum=0;
average=0;
s=0;
b=0;
i++;
}
return 0;
}
| 38 |
18,674 | int main(){
int n,i,k;
double e=0,q=0;
int sz[100];
double a[100][1000];
double c[100],d[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
for(k=0;k<sz[i];k++){
scanf("%lf",&a[i][k]);
e+=a[i][k];
}c[i]=e/sz[i];
e=0;
}for(i=0;i<n;i++){
for(k=0;k<sz[i];k++){
q+=(a[i][k]-c[i])*(a[i][k]-c[i]);
}d[i]=sqrt(q/sz[i]);
q=0;
}for(i=0;i<n;i++){
printf("%.5lf\n",d[i]);
}
return 0;
} | 38 |
18,675 | void main()
{
double *p[100][1000],*q[100],*a[100];
int n,i,j,*num[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
*(num+i)=( int * )malloc(sizeof(int));
*(a+i)=( double * )malloc(sizeof(double));
*(q+i)=( double * )malloc(sizeof(double));
scanf("%d",*(num+i));
for(j=0;j<**(num+i);j++)
{
*(*(p+i)+j)=( double * )malloc(sizeof(double));
scanf("%lf",*(*(p+i)+j));
}
for(j=0,**(a+i)=0;j<**(num+i);j++)
{
**(a+i)=**(a+i)+**(*(p+i)+j);
}
**(a+i)=**(a+i)/(**(num+i));
for(j=0,**(q+i)=0;j<**(num+i);j++)
{
**(q+i)=**(q+i)+pow((**(*(p+i)+j)-**(a+i)),2);
}
**(q+i)=**(q+i)/(**(num+i));**(q+i)=sqrt(**(q+i));
printf("%.5f\n",**(q+i));
}
}
| 38 |
18,676 | int main()
{
int n,i,j,k;
double a[1000],sum=0.0,average,b[1000],s=0.0,m,u;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&j);
for(k=0;k<j;k++)
scanf("%lf",&a[k]);
for(k=0;k<j;k++)
sum+=a[k];
average=(double)sum/j;
for(k=0;k<j;k++)
{b[k]=a[k]-average;
s+=b[k]*b[k];}
m=(double)s/j;
u=sqrt(m);
printf("%.5f\n",u);
sum=0; s=0;
}
return 0;
}
| 38 |
18,677 |
int main(){
int n,i,m;
double sz[100],*p;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&m);
for(p=sz;p<sz+m;p++){
scanf("%lf",p);
}
double aver,sum=0;
for(p=sz;p<sz+m;p++){
sum=sum+*p;
}
aver=sum/m;
sum=0;
for(p=sz;p<sz+m;p++){
sum=sum+pow((*p-aver),2);
}
double jfc;
jfc=sqrt(sum/m);
printf("%.5lf\n",jfc);
}
return 0;
}
| 38 |
18,678 | int main(){
int n,m;
double aa[1000],x,a,y,bb[1000];
cin>>n;
int i,j;
for(i=1;i<=n;i++){
cin>>m;
a=0;
for(j=1;j<=m;j++){
cin>>aa[j];
a=a+aa[j];
}
a=a/m;
y=0;
for(j=1;j<=m;j++){
y=y+(aa[j]-a)*(aa[j]-a);
}
y=y/m;
y=sqrt(y);
bb[i]=y;
}
for(i=1;i<=n;i++)
printf("%.5lf\n", bb[i]);
return 0;
} | 38 |
18,679 | int main()
{
int n,i,j,s;
double x[100],w,sum,a;
cin>>n;
for(j=1;j<=n;j++)
{
cin>>s;
sum=0.0;
for(i=0;i<s;i++)
{
cin>>x[i];
sum=sum+x[i];
}
a=sum/s;
sum=0.0;
for(i=0;i<s;i++)
{
sum=sum+(x[i]-a)*(x[i]-a);
}
cout<<fixed<<setprecision(5)<<sqrt(sum/s)<<endl;
}
return 0;
} | 38 |
18,680 | int main()
{
int k,n,i;
cin>>k;
double S,mean,sum=0;
while(k--)
{
double num[101];
double *p=num;
cin>>n;
for(i=0;i<n;i++)
{
cin>>num[i];
sum+=num[i];
}
mean=sum/n;
sum=0;
while(i>0)
sum+=pow(*(p+(--i))-mean,2);
mean=sum/n;
S=sqrt(mean);
sum=0;
cout<<fixed<<setprecision(5)<<S<<endl;
}
return 0;
}
| 38 |
18,681 | int main(int argc, char* argv[])
{
int k,n,i,j;
double a[1000],total=0,pf=0,jz,s;
scanf("%d",&k);
for(i=0;i<k;i++){
scanf("%d",&n);
total=0;
pf=0;
jz=0;
s=0;
for(j=0;j<n;j++){
scanf("%lf",&a[j]);
}
for(j=0;j<n;j++){
total+=a[j];
}
jz=total/n;
for(j=0;j<n;j++){
pf+=(a[j]-jz)*(a[j]-jz);
}
s=sqrt(pf/n);
printf("%.5f\n",s);
}
return 0;
} | 38 |
18,682 | int main()
{
int n,ge[100];
double shu[100][1000],pingjun[100]={0},s[100]={0};
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&ge[i]);
for(j=0;j<ge[i];j++)
{
scanf("%lf",&shu[i][j]);
pingjun[i]+=shu[i][j]/ge[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<ge[i];j++)
{
s[i]+=pow((shu[i][j]-pingjun[i]),2)/ge[i];
}
printf("%.5lf\n",sqrt(s[i]));
}
return 0;
}
| 38 |
18,683 | int main(){
int i,j,k,n;
double a[100][100];
double c=0,b=0;
scanf("%d",&k);
for(i=0;i<k;i++){
scanf("%d",&n);
c=0;b=0;
for(j=0;j<n;j++){
scanf("%lf ",&a[i][j]);
c+=a[i][j];}
for(j=0;j<n;j++)
b+=(a[i][j]-c/n)*(a[i][j]-c/n);
printf("%.5lf\n",sqrt(b/n));
}}
| 38 |
18,684 |
int main()
{
int n,m[101],i,j;
double x[1001],s[101],a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
double b=0,sum=0;
scanf("%d",&m[i]);
for(j=0;j<m[i];j++)
{
scanf("%lf",&x[j]);
sum=sum+x[j];
}
a=sum/m[i];
for(j=0;j<m[i];j++)
{
b=b+(x[j]-a)*(x[j]-a);
}
s[i]=sqrt(b/m[i]);
}
for(i=0;i<n;i++)
{
printf("%.5lf\n",s[i]);
}
return 0;
}
| 38 |
18,685 | int main()
{
int k;
int n[100];
double z[100][100],x[100]={0},y[100]={0};
scanf("%d",&k);
for(int i=0;i<k;i++)
{
scanf("%d",&n[i]);
for(int j=0;j<n[i];j++)
{
scanf("%lf",&z[i][j]);
x[i]=x[i]+z[i][j];
}
x[i]=x[i]/(double)n[i];
for(int t=0;t<n[i];t++)
{
y[i]=y[i]+(z[i][t]-x[i])*(z[i][t]-x[i]);
}
y[i]=sqrt(y[i]/(double)n[i]);
printf("%.5lf\n",y[i]);
}
return 0;
}
| 38 |
18,686 | int main()
{
int n,i,j,s;
double x[1000],b[100]={0.00},sum=0.0000000000,ave,p=0.0000000000000,r;
scanf("%d",&n);
for(i=0;i<n;i++){
s=(int)(s);
s=0;
sum=0.0000000;
ave=0.00000;
r=0.00000;
p=0.000000;
scanf("%d",&s);
for(j=0;j<s;j++){
scanf("%lf",&x[j]);
sum+=x[j];
}
ave=sum/(double)(s);
for(j=0;j<s;j++){
p=p+(double)(pow(fabs((x[j]-ave)),2.00));
}
r=p/(double)(s);
b[i]=(double)(sqrt(r));
for(j=0;j<s;j++){
x[j]=0.0000;
}
}
for (i=0;i<n;i++){
printf("%.5lf\n",b[i]);
}
return 0;
}
| 38 |
18,687 | int main()
{
int n,i,j;
double x[100][101]={0},xa[100][2]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lf",&x[i][0]);
x[i][0]=(int)x[i][0];
for(j=1;j<=x[i][0];j++)
{
scanf("%lf",&x[i][j]);
xa[i][0]+=x[i][j];
}
xa[i][0]=xa[i][0]/x[i][0];
}
for(i=0;i<n;i++)
{
for(j=1;j<=x[i][0];j++)
{
xa[i][1]+=(x[i][j]-xa[i][0])*(x[i][j]-xa[i][0]);
}
xa[i][1]=sqrt(xa[i][1]/x[i][0]);
}
for(i=0;i<n;i++)
{
printf("%.5lf\n",xa[i][1]);
}
return 0;
} | 38 |
18,688 | int main()
{
int n,k,i,j;
double x[100],sum,a,s;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&n);
sum=0;
for(j=0;j<n;j++)
{
scanf("%lf",&x[j]);
sum=sum+x[j];
}
a=sum/n;
s=0;
for(j=0;j<n;j++)
{
s=s+(x[j]-a)*(x[j]-a);
}
s=sqrt(s/n);
printf("%.5f\n",s);
}
return 0;
}
| 38 |
18,689 |
int main()
{
int n,m,i,j,t[100];
double x[100][100];
double s,S,a;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%d",&m);
for(j=0;j<m;j++){
scanf("%lf",&x[i][j]);
t[i]=m;
}
}
for (i=0;i<n;i++){
a=s=0;
for(j=0;j<t[i];j++){
a+= x[i][j]/t[i];
}
for(j=0;j<t[i];j++){
s+= (x[i][j]-a)*(x[i][j]-a)/t[i];
}
S =sqrt(s);
printf("%.5lf\n",S);
}
return 0;
}
| 38 |
18,690 |
int main()
{
int a[100]={0},k,i,j;
double b[100]={0},cnt,average,s;
cin>>k;
for(i=0;i<k;i++)
{
average=0;
cnt=0;
s=0;
cin>>a[i];
for(j=0;j<a[i];j++)
{
cin>>b[j];
average+=b[j];
}
average=average/a[i];
for(j=0;j<a[i];j++)
cnt+=(b[j]-average)*(b[j]-average);
cnt=cnt/a[i];
s=sqrt(cnt);
cout<<fixed<<setprecision(5)<<s<<endl;
}
return 0;
} | 38 |
18,691 |
int main()
{
int k,n,i,j;
double s;
double x[1000];
double pingjun,he,sum;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&n);
sum=0.00;
for(j=0;j<n;j++)
{
scanf("%lf",&x[j]);
sum+=(double)x[j];
}
pingjun=(double)sum/n;
he=0.00;
for(j=0;j<n;j++)
{
he+=(double)(x[j]-pingjun)*(x[j]-pingjun);
}
s=(double)sqrt(he/n);
printf("%.5lf\n",s);
}
return 0;
} | 38 |
18,692 | int main()
{
double as[100][1000]={0};
int n,i,j,x[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&x[i]);
for(j=0;j<x[i];j++)
{
scanf("%lf",&as[i][j]);
}
}
for(i=0;i<n;i++)
{
double sum=0;
for(j=0;j<x[i];j++)
{
sum+=as[i][j];
}
double abs;
abs=sum/(double)x[i];
double pfh=0;
for(j=0;j<x[i];j++)
{
pfh+=((as[i][j]-abs)*(as[i][j]-abs));
}
printf("%.5lf\n",sqrt(pfh/(double)x[i]));
}
}
| 38 |
18,693 | int main()
{
int k,n;
double x[100];
cin>>k;
for(int i=0;i<k;i++)
{
double sum1=0,aver,sum2=0,result;
double *p;
cin>>n;
for(p=x;p<x+n;p++)
{
cin>>*p;
sum1+=*p;
}
aver=sum1/n;
for(p=x;p<x+n;p++)
{
sum2+=(*p-aver)*(*p-aver);
}
result=sqrt(sum2/n);
cout<<fixed<<setprecision(5)<<result<<endl;
}
return 0;
} | 38 |
18,694 | void main()
{
int i,j,n,m;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&n);
double *a=(double *)malloc(n*sizeof(double)),E=0,D=0;
for(j=0;j<n;E+=*(a+j-1))
scanf("%lf",a+j++);
E/=n;
for(j=0;j<n;j++)
D+=(*(a+j)-E)*(*(a+j)-E);
D/=n;
printf("%.5lf\n",sqrt(D));
}
} | 38 |
18,695 | double aver(double *p,int n)
{
int i;
double a;
double sum=0;
for(i=0;i<n;i++)
sum=*(p+i)+sum;
a=sum/n;
return a;
}
double s(double *p,int n)
{
int i;
double sum=0;
double av=aver(p,n);
for(i=0;i<n;i++)
sum=(*(p+i)-av)*(*(p+i)-av)+sum;
double a;
a=sum/n;
return(sqrt(a));
}
void main()
{
double *p[100];
int m,n,i,j;
scanf("%d",&m);
for(i=0;i<m;i++)
*(p+i)=(double *)malloc(100*sizeof(double));
for(i=0;i<m;i++)
{
scanf("%d",&n);
for(j=0;j<n;j++)
scanf("%lf",*(p+i)+j);
printf("%.5lf\n",s(p[i],n));
}
} | 38 |
18,696 | int main()
{
int i;
int k,n;
double array[101],ave,ans;
cin>>k;
for(;k>0;--k)
{
ave=0;
ans=0;
cin>>n;
for(i=0;i<n;++i)
{
cin>>array[i];
ave+=array[i];
}
ave/=n;
for(i=0;i<n;++i)
{
ans+=pow(array[i]-ave,2.0);
}
ans/=n;
ans=sqrt(ans);
printf("%.5f\n",ans);
}
return 0;
}
| 38 |
18,697 | int main()
{
int k,n,i,j,t;
double x[100],S,sum2,sum1,aver1,aver2;
scanf("%d",&k);
for(i=0;i<k;i++){
sum1=0.0,aver1=0.0;
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%lf",&x[j]);
sum1+=x[j];}
aver1=(double)sum1/n;
sum2=0.0,aver2=0.0;
for(t=0;t<n;t++){
sum2+=(x[t]-aver1)*(x[t]-aver1);
}
aver2=(double)sum2/n;
S=(double)sqrt(aver2);
printf("%.5f\n",S);
}
return 0;
}
| 38 |
18,698 | int main(){
int n,i=0,j;
double s[100];
int num;
double A=0,a;
double b[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&num);
A=0;
for(j=0;j<num;j++){
scanf("%lf",&b[j]);
A+=b[j];
}
a=A/num;
s[i]=0;
for(j=0;j<num;j++){
s[i]+=(b[j]-a)*(b[j]-a);
}
s[i]=(s[i]/num);
s[i]=sqrt(s[i]);
}
for(i=0;i<n;i++){
printf("%.5lf\n",s[i]);
}
return 0;
} | 38 |
18,699 | int main()
{
int k,i,j;
struct
{
int n;
double x[100];
double S;
}
sz[100];
scanf("%d",&k);
for(i=0;i<k;i++){
scanf("%d",&sz[i].n);
for(j=0;j<sz[i].n;j++){
scanf("%lf",&sz[i].x[j]);
}
}
for(i=0;i<k;i++){
double a=0;
for(j=0;j<sz[i].n;j++){
a+=sz[i].x[j]*1.0;
}
a/=sz[i].n;
sz[i].S=0;
for(j=0;j<sz[i].n;j++){
sz[i].S=(sz[i].x[j]-a)*(sz[i].x[j]-a)+sz[i].S;
}
sz[i].S=sz[i].S/sz[i].n;
sz[i].S=sqrt(sz[i].S);
printf("%.5lf\n",sz[i].S);
}
return 0;
} | 38 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.