semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
main()
{
	
	int k;
    scanf("%d",&k);
	int i=1;
	int n;
	for(i;i<=k;i++)
	{
		
		scanf("%d",&n);
		int j=0;
	    double sum=0;
		double a[100];
		double s=0;
		for(j=0;j<n;j++)
		{scanf("%lf",&a[j]);
		sum=sum+a[j];}
		sum=sum/n;
		for(j=0;j<n;j++)
		s=s+pow(sum-a[j],2);
		s=s/n;
		s=sqrt(s);
		printf("%.5lf\n",s);
	}
}
void display(double n)
{
	double *index,ave,ele[1000],sum=0,answer;
	int i=0;
	index=ele;
	for(i;i<n;i++)
	{
		scanf("%lf",&ele[i]);
		sum+=ele[i];
	}
	ave=sum/n;
	sum=0;
	for(i=0;i<n;i++)
	{
		sum+=pow(ele[i]-ave,2);
	}
	sum=(double)sum/n;
	answer=pow(sum,0.5);
	printf("%.5f",answer);
}


double main()
{
	double k,n,i;
	scanf("%lf",&k);
	for(i=0;i<k;i++){
		scanf("%lf",&n);
		if(i!=0) printf("\n");
		display(n);
	}
	return 0;
}
double myaverage(double *);
double quaresum(double *);
double junfangcha(double *);

int n;
double sz[100];

int main(int argc, char* argv[])
{
	int k,i,j;
	scanf("%d",&k);
	for(i=0 ; i<k ; i++){
		scanf("%d",&n);
		for(j=0 ; j<n ; j++){
			scanf("%lf",&sz[j]);
		}
		printf("%.5f\n",junfangcha(sz));
	}
	return 0;
}

double myaverage( double *sz )
{
	double x=0.0;
	int i;
	for(i=0 ; i<n ; i++)
		x += *(sz+i);
	x /=n;
	return x;
}

double quaresum( double *sz )
{
	double x=0.0,a;
	int i;
	a = myaverage( sz );
	for(i=0 ; i<n ; i++)
		x += ( *(sz+i) - a ) * ( *(sz+i) - a );
	return x;
}

double junfangcha( double *sz )
{
	return sqrt( quaresum( sz ) /n );
}
int main()
{
	int k,n[100],i,j;
	double x[100][100],sum[100]={0},sum1[100]={0},re[100];
	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]);
			sum[i]+=x[i][j];
		}
	}
	for(i=0;i<k;i++)
	{
		for(j=0;j<n[i];j++)
		{
			sum1[i]+=((x[i][j]-sum[i]/n[i])*(x[i][j]-sum[i]/n[i]));
		}
		re[i]=sqrt(sum1[i]/n[i]);
		printf("%.5lf\n",re[i]);
	}
	return 0;
}
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;
}
int main()
{
	int i,j;
	double k,n[100],x[100],a[100],b[100],c[100],d[100];
	scanf("%lf",&k);
	for(i=0;i<k;i++)
	{
		a[i]=0;
		c[i]=0;
		scanf("%lf",&n[i]);
		for(j=0;j<n[i];j++)
			scanf("%lf",&x[j]);
        for(j=0;j<n[i];j++)
			a[i]=a[i]+x[j];
		b[i]=a[i]/n[i];
		for(j=0;j<n[i];j++)
			c[i]=c[i]+(x[j]-b[i])*(x[j]-b[i]);
		d[i]=sqrt(c[i]/n[i]);
	}
	for(i=0;i<k;i++)
		printf("%.5lf\n",d[i]);
	return 0;
}
void display(double n)
{
	double *index,ave,ele[1000],sum=0,answer;
	int i=0;
	index=ele;
	for(i=0;i<n;i++,index+=LEN)
	{
		scanf("%lf",index);
		sum+=*index;
	}
	ave=sum/n;
	sum=0;
	for(i=0,index=ele;i<n;index+=LEN,i++)
	{
		sum+=pow(*index-ave,2);
	}
	sum=(double)sum/n;
	answer=pow(sum,0.5);
	printf("%.5f",answer);
}


double main()
{
	double k,n,i;
	scanf("%lf",&k);
	for(i=0;i<k;i++){
		scanf("%lf",&n);
		if(i!=0) printf("\n");
		display(n);
	}
	return 0;
}
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;
	
}
int main()
{
	int n;
	scanf("%d",&n);
	int x=0;
	double sum=0,s=0;
	double z[100];
	for(int i=0;i<n;i++)
	{
		scanf("%d",&x);
		for(int j=0;j<x;j++)
		{
			scanf("%lf",&(z[j]));
			sum=sum+z[j];
		}
		for(int f=0;f<x;f++)
		{
			s=s+(z[f]-sum/x)*(z[f]-sum/x);
		}
		s=s/x;
		s=pow(s,0.5);
		printf("%0.5lf\n",s);
		sum=0;
		s=0;
	}
	return 0;
}
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;
}
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;
}
int main()
{
    int n,m;
    cin >> m;
    double a[102];
    double s=0,av=0;
    for(int k=0;k<m;k++)
    {
         cin >> n;
         s=0;
        for(int i=0;i<n;i++)
        {
            cin >> a[i];
            s+=a[i];
        }
        av=s/n;
        s=0;
        for(int i=0;i<n;i++)
        {
            s+=(a[i]-av)*(a[i]-av);
        }
        cout << setprecision(5)<< fixed << sqrt(s/n)<<endl;

    }
   }
int main()
{
	double x[1000], a, z, s, S[100];
	int n, i, e, f;
	scanf("%d", &n);
    for(e=0;e<n;e++){
		scanf("%d", &i);
		z=0;
		s=0;
		for(f=0;f<i;f++){
			scanf("%lf", &x[f]);
            z+=x[f];
		}
		a=z/i;
		for(f=0;f<i;f++){
            s+=pow(x[f]-a,2);
		}
        S[e]=pow(s/i,0.5);
	}
	for(e=0;e<n;e++)
		printf("%.5lf\n", S[e]);
	return 0;
}
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;
}
int main()
{
	int k;
	double A[100],ave,s=0;
	cin>>k;
	for(int j=0;j<k;j++)
	{s=0;
		double *p=&A[0];
		ave=0;
		int n;
		cin>>n;
		for(int i=0;i<n;i++)
		{
			cin>>A[i];
		    ave+=A[i];
		}
		ave=ave/n;
		for(int i=0;i<n;i++)
		{
			s+=(A[i]-ave)*(A[i]-ave);
			
		}
		s=sqrt(s/n);
		cout<<fixed<<setprecision(5)<<s;;
		cout<<endl;
	}
	return 0;
}
int main(){
int n,i,j,m[100];
double a[200],sum=0,pingfanghe=0,l,s[200],ave;
scanf("%d",&n);
for(i=0;i<n;i++){
	scanf("%d",&m[i]);
	for(j=0;j<m[i];j++){
		scanf("%lf",&a[j]);
		sum+=a[j];
	}
	
	ave=sum/m[i];
	for(j=0;j<m[i];j++){
		l=(a[j]-ave)*(a[j]-ave);
		pingfanghe+=l;
		
	}
	
	s[i]=sqrt(pingfanghe/m[i]);
	sum=0;
	pingfanghe=0;
	ave=0;
}
for(i=0;i<n;i++){
printf("%.5lf\n",s[i]);
}
return 0;
}
void main()
{
	int k,i,j,n;
	double *S,*a,b;
	scanf("%d",&k);
	S=(double *)malloc(sizeof(double)*k);
	for(i=0;i<k;i++) *(S+i)=0;
	for (i=0;i<k;i++)
	{
		scanf("%d",&n);
		a=(double *)malloc(sizeof(double)*n);
		b=0;
		for (j=0;j<n;j++) 
		{
			scanf("%lf",a+j);
			b+=*(a+j);
		}
		b=b/n;
		for (j=0;j<n;j++) *(S+i)+=(*(a+j)-b)*(*(a+j)-b);
		*(S+i)/=n;
		*(S+i)=sqrt(*(S+i));
		free(a);
	}
	for (i=0;i<k;i++) printf("%.5f\n",*(S+i));
}
int main ()
{
  int i,j;
  int n;
  scanf("%d",&n);
  for(j=0;j<n;j++)
  {
  float a,b;
  a=0;
  int m;
  scanf("%d",&m);
  float szj[m];
  for(i=0;i<m;i++)
  { 
    scanf("%f",&szj[i]);
    a+=szj[i];
  }
  b=(float)a/m;
  double c,d,e;
  c=0;
  for(i=0;i<m;i++)
  { 
    c+=(double)(szj[i]-b)*(szj[i]-b);
  }
    d=(double)c/m;
    e=sqrt(d);
    printf("%.5lf\n",e);
 }
return 0;
}
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));
	}
}
int main()
{
	int n,i,j,k;
	double a[100],sum,ave,s2;
	double *p;
	
	scanf("%d",&k);
	for(i=1;i<=k;i++)
	{
		p=a;
		scanf("%d",&n);
		sum=0;
		for(j=1;j<=n;j++)
		{
			scanf("%lf",p+j-1);
			sum+=*(p+j-1);
		}
		ave=sum/n;
		s2=0;
		for(j=1;j<=n;j++)
		{
			s2+=(*(p+j-1)-ave)*(*(p+j-1)-ave);
		}
		printf("%.5lf\n",sqrt(s2/n));
	}

}
void main()
{
	int cases;
	scanf("%d",&cases);
	while(cases--)
	{
		int n;
		scanf("%d",&n);
		double *p;
		p=(float*)calloc(n,sizeof(float));
		int i;double j;
		for(i=0;i<n;i++) scanf("%lf",p++);
		p=p-n;
		double*f;
	     f=p;
	    double sum=0;
	    for(i=0;i<n;i++,f++) sum=sum+(*f);
		 double x=sum/n;
		 double x1=0;
		 f=p;
		 for(i=0;i<n;i++,f++) x1=x1+(*f-x)*(*f-x);
		 double x2;
		 x2=sqrt(x1/n);
		 printf("%.5f\n",x2);
		 
	
	
	}


}
int main()
{
	int m,i,j;
	double a[100]={0},c=0,s=0,n;
	scanf("%d",&m);
	for(j=0;j<m;j++){
		double sum=0,ave=0, total=0,pf=0;
        scanf("%lf",&n);
		for(i=0;i<n;i++){
            
			scanf("%lf",&a[i]);
			sum+=a[i];
			ave=sum/n;
		}
		for(i=0;i<n;i++){
			
			pf=(a[i]-ave)*(a[i]-ave);
			total+=pf;
		}
		c=total/n;
		s=sqrt(c);
		printf("%.5lf\n",s);
		
	}
	return 0;
}
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;
}
int main()
{
	int k,i,j,n[N];
	scanf("%d",&k);
	double a[N],S[N];
	for(i=0;i<k;i++)
	{
		scanf("%d",&n[i]);
		S[i]=0.0;
		double sum=0.0,x[M];
		for(j=0;j<n[i];j++)
		{
			scanf("%lf",&x[j]);
			sum+=x[j];
		}
		a[i]=sum/n[i];
		for(j=0;j<n[i];j++)
		{
			S[i]+=(x[j]-a[i])*(x[j]-a[i]);
		}
		S[i]=sqrt(S[i]/n[i]);
	}
	for(i=0;i<k;i++)
	{
		printf("%.5f\n",S[i]);
	}
	return 0;
}
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;
}
}
int main(int argc, char* argv[])
{
	int i,j,k,n;
	double x[100],s,a=0,b=0,c[100],d=0;
	scanf("%d",&k);
	for(i=0;i<k;i++)
	{
		a=0;
		b=0;
		d=0;
		scanf("%d",&n);
		for(j=0;j<n;j++)
		{
			scanf("%lf",&x[j]);
            b=(double)x[j]/n;
			a+=b;
		}
		for(j=0;j<n;j++)
		{
		    c[j]=x[j]-a;
			d=d+pow(c[j],2);
			s=(double)sqrt(d/n);
		}
		printf("%.5lf\n",s);
	}
	return 0;
}
int main()
{
	int k,i,n,j=0;
	scanf("%d",&k);
	double x[100];
	while(j<k)
	{
		double a=0,s=0;
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%lf",&(x[i]));
		}
		for(i=0;i<n;i++)
		{
			a+=x[i];
		}
		a=a/(n*1.0);
		for(i=0;i<n;i++)
		{
			s+=(x[i]-a)*(x[i]-a);
		}
		s=s/(n*1.0);
		s=sqrt(s);
		printf("%.5lf\n",s);
		j++;
	
	}
	return 0;
}
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;
}
int main(int argc, char* argv[])
{
	int n,k,i,j;
	double a[1000],b,d,S,c;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&k);
		for(j=1;j<=k;j++)
		{
			scanf("%lf",&a[j]);
		}
		b=0;
		d=0;
       
	    for(j=1;j<=k;j++){
            b=b+a[j];
		}
		c=b/k;
		for(j=1;j<=k;j++){
			d=d+(a[j]-c)*(a[j]-c);
	    	S=sqrt(d/k);
		}
	    printf("%.5lf\n",S);
	}
	return 0;
}
int main(){
	int k,n;
	double sum=0,a[101];
	cin>>k;
	for(int i=1;i<=k;i++){
		cin>>n; sum = 0;
		for(int j=1;j<=n;j++){
			cin>>a[j];
			sum += a[j];
		}
		double b=sum/n;
		double sum2=0;
		for(int j=1;j<=n;j++){
			sum2+=(a[j]-b)*(a[j]-b);
		}
		double S=sqrt(sum2/n);
		printf("%.5f\n",S);
	}
	return 0;
}
int main()
{
	int k;
	cin>>k;
	for(int i=0;i<=k-1;i++)
	{
	double n;
	cin>>n;
	double a[100],sum=0,pingjun,sum1=0;
	for(int s=0;s<=n-1;s++)
	{
		cin>>a[s];
	}
	
	
	for(int s=0;s<=n-1;s++)
		
	{
		sum=sum+a[s];
	
	}
	pingjun=sum/n;
	for(int s=0;s<=n-1;s++	)
	{
		sum1=sum1+(a[s]-pingjun)*(a[s]-pingjun);
	}
	cout<<fixed<<setprecision(5)<<sqrt((1/n)*sum1)<<endl;
	}
return 0;
}
int main()
{
	int k,i;
	double s[100];
	scanf("%d",&k);
	for(i=0;i<k;i++){
	int m,j;
	scanf("%d",&m);
	double a[100],b=0,c,d[100],e=0,f;
	for(j=0;j<m;j++){
		scanf("%lf",&a[j]);
		b=b+a[j];}
	c=(double)b/m;
	for(j=0;j<m;j++){
		d[j]=(double)(a[j]-c)*(a[j]-c);
		e=e+d[j];
	}
	f=(double)e/m;
	s[i]=sqrt(f);}
	for(i=0;i<k;i++)
		printf("%.5lf\n",s[i]);
	return 0;
}
int main()
{
	int k,n,i,j;
	double a[1000],s1[100]={0},s2[100]={0},s[100],aver[100];
	scanf("%d",&n);
	for(j=0;j<n;j++){
		scanf("%d",&k);
		for(i=0;i<k;i++){
			scanf("%lf",&a[i]);
			s1[j]+=a[i];
		}
		aver[j]=s1[j]/k;
		for(i=0;i<k;i++){
			s2[j]+=(a[i]-aver[j])*(a[i]-aver[j]);
		}
		s[j]=sqrt(s2[j]/k);
	}
	for(j=0;j<n;j++){
		printf("%.5lf\n",s[j]);
	}
	return 0;
}
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;
}
main()
{
	int k,i,n;
	double a[1000],ave,sum,c2[1000];
	scanf("%d",&n);
	while(n--)
	{
		
		ave=0;
		scanf("%d",&k);
		for(i=0;i<k;i++)
		{
			scanf("%lf",&a[i]);
			ave+=a[i]/k;
		}
		sum=0;
		for(i=0;i<k;i++)
		{
			c2[i]=(a[i]-ave)*(a[i]-ave);
			sum+=c2[i]/k;
		}
		printf("%.5lf\n",sqrt(sum));
		
	}
}
int main()
{
	int k,n[100],i,j;
	double x[1000],ave=0.00,sum=0.00,s[100];
	scanf("%d",&k);
	for(i=0;i<k;i++)
	{
		scanf("%d",&n[i]);
		for(j=0;j<n[i];j++)
		{
			scanf("%lf",&x[j]);
			ave=ave+x[j];
		}
		ave=ave/n[i];
		for(j=0;j<n[i];j++)
		{
			sum=sum+(x[j]-ave)*(x[j]-ave);
		}
		s[i]=sqrt(sum/n[i]);
		ave=0.00;
		sum=0.00;
	}
	printf("%.5f",s[0]);
	for(i=1;i<k;i++)
	{
		printf("\n%.5f",s[i]);
	}
	return 0;
}
int main(){
   int k,n,i,j;
   double sum1,sum2,r[100],a[100];
   scanf("%d",&k);
   for(i=0;i<k;i++){
       scanf("%d",&n);
	   sum1=0;
	   for(j=0;j<n;j++){
	       scanf("%lf",&a[j]);
		   sum1+=a[j];
	   }
       sum1=sum1/n;
	   sum2=0;
	   for(j=0;j<n;j++){
	       sum2+=(a[j]-sum1)*(a[j]-sum1);
	   }
	   r[i]=sqrt(sum2/n);
   }
   for(i=0;i<k;i++){
      printf("%.5f\n",r[i]);
   }
return 0;
}
void main()
{
	int k,n,i,j;
	double *p,*q,f,sum1,sum2,s,m,a[1000];//m?????
	scanf("%d",&k);
	for(i=1;i<=k;i++)
	{
		p=a;
		sum1=0;sum2=0;
		scanf("%d",&n);
		for(j=1;j<=n;j++,p++)
		{
			scanf("%lf",p);
			sum1+=*p;
		}
		m=sum1/n;
		p=a;
		for(q=p;q!=p+n;q++)
		{
			sum2+=(*q-m)*(*q-m);
		}
		s=sqrt(sum2/n);
		printf("%.5f\n",s);
	}
}
int main(int argc, char* argv[])
{
	int k,n,i,j;
	scanf("%d",&k);
	double x[100],s,a,y1,y2,y;
	for(i=0;i<k;i++)
	{
		scanf("%d",&n);
		s=0;
		for(j=0;j<n;j++)
		{
			scanf("%lf",&x[j]);
			s=s+x[j];
		}
		a=s/n;
		y1=0;
		for(j=0;j<n;j++)
		{
			y1=y1+(x[j]-a)*(x[j]-a);
		}
		y2=y1/n;
		y=sqrt(y2);
		printf("%.5f\n",y);
	}
	return 0;
}
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;
}
/*?5?????????????????????????????,?4?5?????????????*/

int main()
{
	int m,i,a[100],j;
	double *p[100],S;
	double fang(double *p[],int);
	scanf("%d\n",&m);
	for(i=0;i<m;i++)
	{
		scanf("%d\n",&a[i]);
		for(j=0;j<a[i];j++)
		{
			*(p+j)=(double *)malloc(len);
			scanf("%lf",*(p+j));
		}
		S=fang(p,a[i]);
		printf("%.5f\n",S);
	}
}


double fang(double *p[],int n)
{
	double c,a,T,S;
	int i;
	for(i=0,c=0;i<n;i++)
	c=c+*(*(p+i));
	a=c/n;
	for(i=0,T=0;i<n;i++)
		T=T+(*(*(p+i))-a)*(*(*(p+i))-a);
	S=sqrt(T/n);
	return S;
}
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);
    }
  
}
int main()
{
	int n,m[100],i,j;
	double x[1000],y[100],z[100]={0},p[100],g[100];
	scanf("%d",&n);
	for(j=0;j<n;j++)
	{
		scanf("%d",&m[j]);
		for(i=0;i<m[j];i++)
		{
			scanf("%lf",&x[i]);
			z[j]+=x[i];
		}
		p[j]=z[j]/m[j];
		for(i=0;i<m[j];i++)
			y[j]+=pow(x[i]-p[j],2);
		g[j]=sqrt(y[j]/m[j]);
	}
	for(j=0;j<n;j++)
		printf("%0.5lf\n",g[j]);
	return 0;
}
int main()
{
	double shuru[100],*shu=shuru,fangjungen(double *shu,int k);
	int n,k,i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&k);
		for(j=0;j<k;j++)
			scanf("%lf",&*(shu+j));
		printf("%.5lf\n",fangjungen(shu,k));
	}
		return 0;
}
double fangjungen(double *shu,int k)
{
	int i;
	double zong=0.0,pingjun,result;
	for(i=0;i<k;i++)
		zong=zong+*(shu+i);
	pingjun=zong/k;
	zong=0.0;
	for(i=0;i<k;i++)
		zong=zong+(*(shu+i)-pingjun)*(*(shu+i)-pingjun);
	result=sqrt((zong/k));
	return result;
}
int main()
{
	int k;
	int i,j;
	
	scanf("%d",&k);
	
	double *num,*avr;
	num=(double *)malloc(sizeof(double)*k);
	avr=(double *)malloc(sizeof(double)*k);

	for(i=0;i<k;i++){
		num[i]=0;
		avr[i]=0;
	}

    int n;

	for(i=0;i<k;i++){
		
		scanf("%d",&n);

		double *a;
		a=(double *)malloc(sizeof(double)*n);

		for(j=0;j<n;j++){
			scanf("%lf",&a[j]);
			avr[i]+=a[j]/n;
		}
		
		for(j=0;j<n;j++){
			num[i]+=(pow((a[j]-avr[i]),2)/n);
		}
		num[i]=pow(num[i],0.5);
		free(a);
	}

	for(i=0;i<k;i++){
		printf("%.5lf\n",num[i]);
	}

	return 0;
}
int main() {
    int k;
    scanf("%d", &k);
    while (k--) {
        int n;
        scanf("%d", &n);
        double *x = (double *) malloc(n * sizeof(double));
        int i;

        double avg = 0;
        for (i = 0; i < n; i++) {
            scanf("%lf", x + i);
            avg += x[i];
        }
        avg /= n;

        double s = 0;
        for (i = 0; i < n; i++)
            s += (x[i] - avg) * (x[i] - avg);
        s /= n;
        s = sqrt(s);

        printf("%.5f\n", s);
        free(x);
    }
    return 0;
}
int main(){
	int i,j,k,n;
	double sum,a,b,S;
	double x[100];
	scanf("%d",&k);
	for(j=0;j<k;j++){
		sum=0.0;
		a=0.0;
		b=0.0;
		S=0.0;
		scanf("%d",&n);
		for(i=0;i<n;i++){
			scanf("%lf",&x[i]);
			sum+=x[i];
		}
		a=sum/n;
        for(i=0;i<n;i++){
			b+=(x[i]-a)*(x[i]-a);
		}
		S=sqrt(b/n);
		printf("%.5f\n",S);

	}
        
	
	return 0;

}
int main()
{
    int n,i,j;
    scanf("%d",&n);
    int k[100];
    double sum[100]={0};
    double a[100];
    double s[100];
    double h[100];
    double b[100];
    for(i=0;i<n;i++)
    {
        scanf("%d",&k[i]);
        for(j=0;j<k[i];j++)
           {
            scanf("%lf",&a[j]);
            sum[i]=sum[i]+a[j]; 
            }
        b[i]=sum[i]/k[i];
        for(j=0;j<k[i];j++)
            {
            h[i]=h[i]+(a[j]-b[i])*(a[j]-b[i]);
            }
        s[i]=sqrt(h[i]/k[i]);
        printf("%.5lf\n",s[i]);
    }
    return 0;
}
int main()
{
	int k, i, len[101];
	double *q = NULL;
	double s[101], a[101], sum[101] = {0}, qsum[101] = {0}, p[1000];
	cin >> k;
	for(i = 0; i < k; i++)
	{
		cin >> len[i];
		q = p;
		for( ; q < p+len[i]; q++)
		{
			cin >> *q;
			sum[i] += *q;
			qsum[i] += (*q) * (*q);
		}
		a[i] = sum[i] / len[i];
		qsum[i] -= len[i] * a[i] * a[i];
		s[i] = sqrt(qsum[i] / len[i]);
		cout << fixed << setprecision(5) << s[i] << endl;
	}
	return 0;
}
int main(){
  int k,n,i,j,b=0;
  double s[1000],a,S,sum,SS,aa[1000];
  scanf("%d",&k);
  for(i=0;i<k;i++){
  scanf("%d",&n);
    sum=0;SS=0;
    for(j=0;j<n;j++){
    scanf("%lf",&s[j]);
    sum+=s[j]; 
 }
  a=sum/n;
  for(j=0;j<n;j++){
  SS+=(s[j]-a)*(s[j]-a);
} 
  S=sqrt(SS/n);
  aa[b]=S;
  b++;
  } 
 for(int h=0;h<b;h++){
 printf("%.5lf\n",aa[h]);}
return 0;
}
int main(){
    double f[100];
    double sum=0.0,a=0.0,s=0.0,S;
    int k;
    scanf("%d",&k);
    for(int i=0;i<k;i++){
        int n;
        scanf("%d",&n);
        for(int j=0;j<n;j++){
        scanf("%lf",&(f[j]));
        sum+=f[j];
        }
        a=sum*1.0/n;
        for(int j=0;j<n;j++){
        s+=pow(f[j]-a,2);
        }
        S=pow(s*1.0/n,1.0/2);
        printf("%.5lf\n",S);
        sum=0.0;
        s=0.0;

        } 
return 0;
}
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));
	}
}
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;
}
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;
}
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);
	}
}
int main()
{
    int n,i;
    scanf("%d\n",&n);
    for(i=1;i<=n;i++){
       int m,k;
       scanf("%d\n",&m);
       double num[m];
       for(k=0;k<m;k++){
          scanf("%lf\n",&num[k]);
       }
       double p=num[0],q;
       for(k=1;k<m;k++){
          p=p+num[k];}
       q=p/m;
       double s=(num[0]-q)*(num[0]-q);
       double w;
       for(k=1;k<m;k++){
          s=s+(num[k]-q)*(num[k]-q);}
       w=sqrt(s/m);
       printf("%.5lf\n",w);}
    return 0;
}
void main()
{
 int n,num[100],i,j;
 double data[100][30],fang[100],aver[100];
 scanf("%d",&n);
 for(i=0;i<n;i++)
 {
  scanf("%d",&num[i]);
  for(j=0;j<num[i];j++)
  scanf("%lf",&data[i][j]);
 }
 for(i=0;i<n;i++)
 {
  aver[i]=0;fang[i]=0;
  for(j=0;j<num[i];j++)
   aver[i]=(double)(aver[i]+(double)(data[i][j]/num[i]));
  for(j=0;j<num[i];j++)
   fang[i]=fang[i]+(double)((data[i][j]-aver[i])*(data[i][j]-aver[i]));
   fang[i]=(double)(fang[i]/num[i]);
   fang[i]=sqrt(fang[i]);
  printf("%.5lf\n",fang[i]);
 }
}