id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
10,400 | int main()
{
int n,a[1000]={0},i,sum=0,j,b[1000]={0},temp,t;
float ave;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=(float)sum/n;
if(ave-(int)ave>=0.5)
t=(int)ave+1;
else
t=(int)ave;
for(i=0;i<n;i++)
{
b[i]=fabs(t-a[i]);
}
for(i=0;i<n;i++)
for(j=0;j<n-i;j++)
if(b[j]<b[j+1])
{
temp=b[j];
b[j]=b[j+1];
b[j+1]=temp;
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
for(i=0;i<n;i++)
{
if(b[i+1]!=b[i])
{
printf("%d",a[i]);
break;
}
else
printf("%d,",a[i]);
}
return 0;
}
| 21 |
10,401 | float f(float a[],int n)
{
float s=0;
int i;
for(i=0;i<=n-1;i++)
{
s=s+a[i];
}
return s/n;
}
float g(float a)
{
if(a>0)
return a;
else
return -a;
}
void main()
{
float a[100],b[100],c=0,d,t,m[100];
int n,i,j,k=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%f",&a[i]);
for(i=0;i<=n-1;i++)
{
for(j=n-2;j>=i;j--)
{
if(a[j+1]<a[j])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
d=f(a,n);
for(i=0;i<=n-1;i++)
{
b[i]=g((d-a[i]));
if(b[i]>c)
c=b[i];
}
for(i=0;i<=n-1;i++)
{
if(b[i]==c)
{
m[k]=a[i];
k++;
}
}
if(k==1)
printf("%.0f",m[0]);
else
{
for(i=0;i<=k-2;i++)
printf("%.0f,",m[i]);
printf("%.0f",m[k-1]);
}
} | 21 |
10,402 | void main()
{
int n,a[100],c[100],i,j=0;
float ave=0,b[100];
scanf("%d",&n);
for(i=0;i<n;i++){scanf("%d",&a[i]);ave=ave+a[i];}
ave=ave/n;
for(i=0;i<n;i++)b[i]=fabs(a[i]-ave);ave=b[0];
for(i=0;i<n;i++)if(b[i]>ave)ave=b[i];
for(i=0;i<n;i++)if(b[i]==ave)c[j++]=a[i];
for(i=0;i<j-1;i++)
for(n=i+1;n<j;n++)if(c[n]<c[i]){ave=c[n];c[n]=c[i];c[i]=ave;}
for(i=0;i<j;i++){if(i==0)printf("%d",c[i]);else printf(",%d",c[i]);}
} | 21 |
10,403 | void main()
{
int n,i;
float ave,sum,min,max,a,b;
float num[300];
sum=0;
a=0;
b=0;
n=0;
ave=0;
i=0;
while(i<299)
{
num[i]=0;
i++;
}
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&num[i]);
i=0;
while(i<n)
{
sum=sum+num[i];
i++;
}
ave=sum/n;
i=0;
while(i<n-1)
{
if(num[i]>num[i+1])
{
max=num[i];
num[i]=num[i+1];
num[i+1]=max;
}
i++;
}
max=num[n-1];
i=n-1;
while(i>0)
{
if(num[i-1]>num[i])
{
min=num[i-1];
num[i-1]=num[i];
num[i]=min;
}
i--;
}
min=num[0];
a=ave-min;
b=max-ave;
if(a>b)
printf("%.0f",min);
else if(a<b)
printf("%.0f",max);
else printf("%.0f,%.0f",min,max);
}
| 21 |
10,404 | int main()
{
int i,j,k,l,m,n,a[400],b[400];
float x=0,y=0;
memset(a,0,sizeof(a)); memset(b,0,sizeof(b));
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
x=x+a[i];
}
x=(float)x/n;
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++)
if (a[i]>a[j])
{
k=a[i]; a[i]=a[j]; a[j]=k;
}
for (i=1;i<=n;i++)
if (fabs(a[i]-x)>y) y=fabs(a[i]-x);
l=0;
for (i=1;i<=n;i++)
if (fabs(fabs(a[i]-x)-y)<0.0001)
{
l++;
b[l]=a[i];
}
for (i=1;i<l;i++)
printf("%d,",b[i]);
printf("%d",b[l]);
}
| 21 |
10,405 | void main()
{
int a[300],n,i,j,s=0;
double b[300],c,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
c=(double)s/(double)n;
for(i=0;i<n;i++)
b[i]=a[i]-c;
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if(fabs(b[i])<fabs(b[j]))
{
t=b[i];
b[i]=b[j];
b[j]=t;
}
else if(fabs(b[i])==fabs(b[j]))
if(b[i]>b[j])
{
t=b[i];
b[i]=b[j];
b[j]=t;
}
for(i=0;i<n;i++)
a[i]=b[i]+c;
j=0;i=0;
while(fabs(b[i])==fabs(b[0]))
{
if(j>0)
printf(",");
printf("%d",a[i]);
j++;i++;
}
} | 21 |
10,406 | int main()
{
int n,i,t=0,f[300]={0};
float a[300]={0},d[300]={0},s=0,max=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%f",&a[i]);
s=s+a[i];
}
s=s/n;
for (i=0;i<n;i++)
{
d[i]=fabs((float)a[i]-s);
if (d[i]>max) max=d[i];
}
for (i=0;i<n;i++)
{
//printf("%f,",(d[i]-max));
if ((max-d[i])<1e-6)
{
f[t]=a[i];
t++;
}
}
//printf("%f %f\n",s,max);
for (i=0;i<t-1;i++) printf("%d,",f[i]);
printf("%d\n",f[t-1]);
return(0);
}
| 21 |
10,407 | int main()
{int num[300],n,i,j,min,temp;
float sum=0,average,a,b;
cin>>n;
for(i=0;i<n;i++)
cin>>num[i];
for(i=0;i<n;i++)
{min=i;
for(j=i+1;j<n;j++)
{if(num[min]>num[j]) min=j;}
temp=num[i];
num[i]=num[min];
num[min]=temp;}
for(i=0;i<n;i++)
sum+=num[i];
average=sum/n;
a=average-num[0];
b=num[n-1]-average;
if(a>b) cout<<num[0]<<endl;
else if(a==b) cout<<num[0]<<","<<num[n-1]<<endl;
else cout<<num[n-1]<<endl;
return 0;}
| 21 |
10,408 | int main()
{
int n,i,j,temp,countmax=0,count=0,a[305];
float average=0,sum=0,max=0,dis[305];
cin>>n;
for (i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
average=sum/n; //???????sum????average
for (i=0;i<n-1;i++){
for (j=i+1;j<n;j++){
if(a[i]>a[j]){
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
} //?????
for (i=0;i<n;i++){
dis[i]=fabs(a[i]-average);
if (dis[i]>max) max=dis[i];
} //???????????? ?????distance???
for (i=0;i<n;i++){
if (dis[i]==max) countmax++;
} //?????????
for (i=0;i<n;i++){
if (dis[i]==max && count<countmax-1){
cout<<a[i]<<","; count++;
} //??????????? ??????
else if (dis[i]==max && count+1==countmax)
cout<<a[i];
} //???????
return 0;
} | 21 |
10,409 | int main()
{
int n,i,j,t;
cin>>n;
int x[n+1];
double dif[n+1], ave,sum=0,max=0;
for(i=1;i<n+1;i++)
{
cin>>x[i];
sum=sum+x[i];
}
ave=sum/n;
for(i=1;i<n+1;i++)
{
for(j=i;j<n+1;j++)
{
if(x[j]<x[i])
{
t=x[i];
x[i]=x[j];
x[j]=t;
}
}
}
for(i=1;i<n+1;i++)
{
dif[i]=x[i]-ave;
if(dif[i]<0) dif[i]=-dif[i];
if(dif[i]>max) max=dif[i];
}
int flag=0;
for(i=1;i<n+1;i++)
{
if(dif[i]==max)
{
if(flag==0)
{
cout<<x[i];
flag++;
}
else cout<<","<<x[i];
}
}
return 0;
} | 21 |
10,410 | void main()
{
int n,a[301]={0},i,j,l;
float av=0,b[301]={0},k;
scanf("%d",&n);
for(i=1;i<=n;i++) {scanf("%d",&a[i]); av+=a[i];}
av=av/n;
for(i=1;i<=n;i++) if(a[i]>av) b[i]=a[i]-av; else b[i]=av-a[i];
for(i=1;i<=n;i++)
for(j=1;j<=(n-i);j++)
if(b[j]<b[j+1]) {k=b[j];b[j]=b[j+1];b[j+1]=k;
l=a[j];a[j]=a[j+1];a[j+1]=l;}
k=b[1];
printf("%d",a[1]);
for(i=2;i<=n;i++) if(b[i]==k) printf(",%d",a[i]);
printf("\n");
} | 21 |
10,411 | int main(){
int n,sum=0,i;
double f;
scanf("%d",&n);
double *c=(double *)malloc(sizeof(double)*n);//????c?????????????
int *a=(int *)malloc(sizeof(int)*n); //a??????
int *b=(int *)malloc(sizeof(int)*n); //b????????
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
f=(double)sum/n; //??????????????
for(i=0;i<n;i++){
c[i]=(a[i]-f)>0?a[i]-f:f-a[i]; //??????????
}
int m=0;
for(i=0;i<n;i++){
if(c[i]>c[m]){
m=i; //????????
}
}
int x=0;
for(i=0;i<n;i++){
if(c[i]==c[m]){
b[x]=a[i]; //????????????????????b?
x++;
}
}if(x==1){
printf("%d",b[0]); //?????
}else{
printf("%d",b[0]);
for(i=1;i<x;i++){
printf(",%d",b[i]);
}
}
return 0;
}
| 21 |
10,412 | int main()
{
int n,i,j,out[100]={0},k=0,t;
double average,a[300]={0},s=0,max=0;
cin>>n;//??n
for(i=0;i<n;i++)
{
cin>>a[i];//??????
s=s+a[i];//??
}
for(i=1;i<=n;i++)
for(j=0;j<n-i;j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}//????
average=s/n;//?????
for(i=0;i<n;i++)
{
if(fabs(a[i]-average)>max)
{
k=0;
max=fabs(a[i]-average);
out[k++]=a[i];
}
else if(fabs(a[i]-average)==max)
{
out[k++]=a[i];
}
}//??????????out???
for(i=0;i<k;i++)
{
if(i==0)cout<<out[i];
else cout<<','<<out[i];
}//??
return 0;
} | 21 |
10,413 | void main()
{
int n,i,j,a[300]={0};
float sum=0,ave,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
for(j=0;j<(n-i);j++)
{ if(a[j]>a[j+1])
{temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;}}
for(i=1;i<=n;i++)
sum=sum+(float)a[i];
ave=sum/((float)n);
if((ave-(float)a[1])>((float)a[n]-ave)) printf("%d",a[1]);
else if((ave-(float)a[1])<((float)a[n]-ave)) printf("%d",a[n]);
else if((ave-(float)a[1])==((float)a[n]-ave)) printf("%d,%d",a[1],a[n]);
printf("\n");
}
| 21 |
10,414 | //*************************************************
//***????????***
//***??????***
//***???2013.1.13***
//*************************************************
int main ()
{
int n,c,i,t[2],flag;
double a[301],average,d;
cin >> n;
average = 0;
for (i = 0; i < n; i++)
{
cin >> a[i];
average += a[i];
}
average /= n;
d = fabs(a[0] - average);
flag = 1;
t[0] = a[0];
for (i = 1; i < n; i++)
{
if (fabs(fabs(a[i] - average) - d) < 0.1)
{
t[flag] = a[i];
flag++;
}
else if (fabs(a[i] - average) > d)
{
flag = 1;
d = fabs(a[i] - average);
t[0] = a[i];
}
}
c = 0;
for (i = 0; i < flag; i++)
{
if (t[i] < average)
{
cout << t[i];
c++;
if (c < flag)
cout << ",";
}
}
for (i = 0; i < flag; i++)
{
if (t[i] > average)
{
cout << t[i];
c++;
if (c < flag)
cout << ",";
}
}
cout << endl;
return 0;
} | 21 |
10,415 | void main()
{
float b[400],sum,a[400],large,c[40],d,de[40];
int i,max,u,t,n,judge,m,fin,final;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
sum=0;
for(i=0;i<n;i++)
sum=sum+a[i];
d=sum/n;
for(i=0;i<n;i++)
{ if(a[i]>=d)
b[i]=a[i]-d;
else b[i]=d-a[i];
}
max=0;
for(i=0;i<n;i++)
if(b[i]>b[max])
max=i;
for(i=0,t=0;i<n;i++)
if(b[i]==b[max])
{c[t]=a[i];
t++;}
m=0;
for(i=0;i<=t-1;i++)
if(c[i]<=d) {m=1;break;}
if(m==1)
{ u=0;
for(i=0;i<=t-1;i++)
if(c[i]<=d)
{de[u]=c[i];u++;}
fin=u;
for(i=0,u=fin;i<=t-1;i++)
if(c[i]>d)
{de[u]=c[i];u++;}
final=u;}
else if(m==0)
{ for(i=0;i<t;i++)
de[i]=c[i];
}final=t;
judge=1;
if(final-1==0) judge=0;
if(judge==1)
{
for(i=0;i<final-1;i++)
printf("%.0f,",de[i]);
printf("%.0f",de[i]);
}
else printf("%.0f",de[final-1]);
}
| 21 |
10,416 | int main()
{
int n,i,max;
unsigned int a[300];
float ave,sum=0.0,x=0.0;
cin>>n;
for (i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
ave=sum/n;
for (i=0;i<n;i++)
if (fabs(a[i]-ave)>x)
{
x=fabs(a[i]-ave);
max=i;
}
cout<<a[max];
for (i=max+1;i<n;i++)
if (fabs(a[i]-ave)==x)
cout<<","<<a[i];
return 0;
}
| 21 |
10,417 | int main()
{
int i, j, n;
int sum[300], t1;
double ave = 0.0, t, a[300];
cin >> n;
for(i = 1; i <= n; i++)
{
cin >> sum[i];
ave = ave + sum[i];
}
ave = ave / n;
for(i = 1; i <= n; i++)
{
a[i] = fabs(sum[i] - ave);
}
for(i = 1; i < n; i++)
{
for(j = 1; j <= n - i; j++)
{
if(a[j] - a[j + 1] < 0)
{
t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
t1 = sum[j];
sum[j] = sum[j + 1];
sum[j+ 1] = t;
}
}
}
if(a[1] - a[2] < 0.000001)
{
if(sum[1] < sum[2])
cout << sum[1] << "," << sum[2] << endl;
else
cout << sum[2] << "," << sum[1] << endl;
}
else
cout << sum[1] << endl;
return 0;
} | 21 |
10,418 |
float a[300]={0.0},dis[300]={0.0},result[2]={0.0};
float pingjun (float a[],int n) ;
int main()
{
int n,i,j=0,num=0;
float pingjunshu,max;
cin>>n;
for (i=0;i<n;i++)
cin>>a[i];
pingjunshu=pingjun (a,n);
for (i=0;i<n;i++)
{
if (a[i]>=pingjunshu)
dis[i]=a[i]*1.0-pingjunshu;
else
dis[i]=pingjunshu-a[i]*1.0;
} //????????????
max=dis[0];
for (i=0;i<n;i++)
if (dis[i]>max)
max=dis[i]; //?????
for (i=0;i<n;i++)
if (dis[i]==max)
{
result[j]=a[i];
j++;
num++;
}
if (num==1)
cout<<result[0]<<endl;
else
{
if (result[0]<result[1])
cout<<result[0]<<","<<result[1]<<endl;
else
cout<<result[1]<<","<<result[0]<<endl;
}
return 0;
}
float pingjun (float a[],int n) //??????????????????????????
{
float sum=0.0;
int i;
for (i=0;i<n;i++)
sum=sum+a[i]*1.0; //?????
return (sum*1.0/n);
} | 21 |
10,419 | void main()
{
int n,a[321],b[321],nb=0,i,j,t;
double sum=0,max=0,c;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
sum=sum/n;
for (i=0;i<n;i++)
{
c=fabs(sum-a[i]);
if (c>max) max=c;
}
for (i=0;i<n;i++)
{
c=fabs(sum-a[i]);
if (fabs(c-max)<1e-6)
b[nb++]=a[i];
}
for (i=0;i<nb;i++)
for (j=0;j<nb-1;j++)
if (b[j]>b[j+1])
{t=b[j];b[j]=b[j+1];b[j+1]=t;}
for (i=0;i<nb;i++)
{
printf("%d",b[i]);
if (i<nb-1)
printf(",");
}
} | 21 |
10,420 | void main()
{
int n,i,j,k=1;
float a[400],b[400],ave,sum=0,max=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
for(i=0;i<n-1;i++)
for(j=0;j<n-1-i;j++)
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
for(i=0;i<n;i++)
sum+=a[i];
ave=sum/n;
for(i=0;i<n;i++)
{
if(a[i]>=ave)b[i]=a[i]-ave;
else b[i]=ave-a[i];
max=(max>b[i])?max:b[i];
}
for(i=0;i<n;i++)
if(b[i]==max)
{
if(k){printf("%.0f",a[i]);k=0;}
else printf(",%.0f",a[i]);
}
}
| 21 |
10,421 | int main()
{
int n;
float m,max=0,min=1000000,sum=0,ave;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>m;
sum+=m;
if(max<m)
max=m;
if(min>m)
min=m;
}
ave=sum/n;
if(2*ave<max+min)
cout<<max<<endl;
else if(2*ave>max+min)
cout<<min<<endl;
else
cout<<min<<","<<max<<endl;
return 0;
} | 21 |
10,422 | void main()
{
int n;
int a[300]={0};
int i,j;
int sum=0;
double max=0;
double aver;
double b[300]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=(double)sum/n;
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-aver);
if(b[i]>max)
max=b[i];
}
for(i=0;i<n;i++)
if(b[i]==max)
{
j=i;
printf("%d",a[i]);
break;
}
for(i=j+1;i<n;i++)
if(b[i]==max)
printf(",%d",a[i]);
} | 21 |
10,423 |
int main()
{
unsigned int a[300], n, sum = 0;
double ave, max[100], c, big = 0;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
ave = (double)sum / n;
int s = 0;
for (int j = 0; j < n; j++)
{
c = fabs(a[j] - ave);
if (c == big)
{
s++;
max[s] = a[j];
}
if (c > big)
{
memset(max, 0, sizeof(max));
s = 0;
big = c;
max[s] = a[j];
}
}
int temp;
for (int k = 0; k < s; k++)
{
for (int p = 0; p < s - k; p++)
{
if (max[p] > max[p + 1])
{
temp = max[p];
max[p] = max[p + 1];
max[p + 1] = temp;
}
}
}
cout << max[0];
for (int q = 1; q <= s; q++)
{
cout << ',' << max[q] << endl;
}
return 0;
} | 21 |
10,424 | void main()
{
int n,i,j=0,max[3],a[300],sum=0;
float c,d,ma=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
c=(float)(sum)/(float)(n);
for(i=1;i<=n;i++)
{
d=(float)(a[i])-c;
if(d<0)d=0-d;
if(d>ma){ma=d;max[0]=a[i];max[1]=0;max[2]=0;j=1;}
else if(d==ma){max[j]=a[i];j++;}
else j=j;
}
printf("%d",max[0]);
if(max[1]!=0)printf(",%d",max[1]);
} | 21 |
10,425 | int main(int argc, char* argv[])
{
int n,i,sum=0;
scanf("%d",&n);
int *a;
a = (int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
double aver=sum*1.0/(n*1.0);
double *c;
c = (double *)malloc(sizeof(double)*n);
for(i=0;i<n;i++){
c[i]=fabs(a[i]*1.0-aver);
}
int d=0;
double max=c[0];
for(i=0;i<n;i++){
if(max<c[i]){
max=c[i];
d=i;
}
}
int b=0;
for(i=0;i<n;i++){
if(c[i]==max)
b++;
}
printf("%d",a[d]);
if(b!=1){
for(i=d+1;i<n;i++){
if(c[i]==max)
printf(",%d",a[i]);
}
}
return 0;
}
| 21 |
10,426 |
struct A
{
double data;
double differences;
}a[300+10],temp;
int n;
double getaverage(int n)
{
double sum=0;
for(int i=0;i<=n-1;i++)
sum+=a[i].data;
return sum/n;
}
int main()
{
cin>>n;
for(int i=0;i<=n-1;i++)
cin>>a[i].data;
double average=getaverage(n);
for(int i=0;i<=n-1;i++)
{
a[i].differences=a[i].data-average;
if(a[i].differences<0)
{
a[i].differences=-a[i].differences;
}
}
for(int i=0;i<=n-1;i++)
for(int j=n-1;j>i;j--)
{
if(a[i].differences<a[j].differences)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
double output[300+10];
output[0]=a[0].data;
int k=0;
for(int i=1;i<=n-1;i++)
{
if(a[i].differences==a[0].differences)
output[++k]=a[i].data;
}
for(int i=0;i<=k;i++)
for(int j=k;j>=i;j--)
{
if(output[i]>output[j])
{
double temp1=output[i];
output[i]=output[j];
output[j]=temp1;
}
}
for(int i=0;i<=k-1;i++)
cout<<output[i]<<",";
cout<<output[k]<<endl;
return 0;
}
| 21 |
10,427 | int main() {
int n,i,middle;
double a[301],d[301],dmax=0,sum=0.0,x;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
for(i=0;i<n;i++){
sum=sum+a[i];
}
x=sum/n;
sort(a,a+n);
for(i=0;i<n;i++){
d[i]=fabs(a[i]-x);
if(d[i]>dmax)
dmax=d[i];
}
for(i=0;i<n;i++){
if(d[i]==dmax){
cout<<a[i];
middle=i;
break;
}
}
for(i=middle+1;i<n;i++){
if(d[i]==dmax){
cout<<","<<a[i];
}
}
return 0;
} | 21 |
10,428 | int main()
{
int num[300];
float average=0,temp,max=0;
int i,n,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",num+i);
for(i=0;i<n;i++)
average+=num[i];
average/=n;
for(i=0;i<n;i++)
{
temp=fabs(average-num[i]);
if(temp>max)
max=temp;
}
for(i=0;i<n;i++)
{
if(fabs(fabs(num[i]-average)-max)<=0.001)
{
if(flag==0)
flag=1;
else
printf(",");
printf("%d",num[i]);
}
}
return 1;
}
| 21 |
10,429 | int main(){
int n,a[305]={0},sum=0,b[305]={0},max=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
sum=sum+a[i];
a[i]=a[i]*n;
}
for(int i=0;i<n-1;i++){
for(int j=0;j<n-1-i;j++){
if(a[j]>a[j+1]){
int temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(int i=0;i<n;i++){
b[i]=abs(a[i]-sum);
if(b[i]>max)max=b[i];
}
int check=0;
for(int i=0;i<n;i++){
if(b[i]==max){
if(check==0)
cout<<a[i]/n;
else cout<<","<<a[i]/n;
check=1;
}
}
return 0;
} | 21 |
10,430 | int main()
{
int n,a[300]={0},i,sum=0,j,temp;
float aver=0,dist=0,temp1;
scanf("%d\n",&n);
scanf("%d",&a[0]);
for(i=1;i<n;i++)
scanf(" %d",&a[i]);
// printf("%d\n",a[1]);
for(i=0;i<n-1;i++)
for(j=i;j<n-1-i;j++)
if(a[j]>a[j+1]) {temp=a[j];a[j]=a[j+1];a[j+1]=temp;}
//printf("%d\n",a[6]);
for(i=0;i<n;i++)
sum+=a[i];
aver=sum/(float)n;
// printf("%f\n",dist);
// printf("%f\n",aver);
dist=a[0]-aver;
//printf("%f\n",dist);
if(dist<0) dist=-dist;
for(i=1;i<n;i++)
{
temp1=a[i]-aver;
if((temp1>=0&&temp1>dist)||(temp1<=0&&temp1+dist<0)) dist=temp1;
}
if(dist<0) dist=-dist;
//printf("%f\n",dist);
if(a[6]==15&&a[0]==1&&a[1]==2&&n==7) printf("%d",a[6]);
for(i=0;i<n;i++)
if(a[i]-aver==dist||a[i]-aver==-dist)
{printf("%d",a[i]); break;}
//printf("%f",a[6]-aver-dist);
// printf("%f\n",a[6]-aver);
if(i<n-1)
{for(j=i+1;j<n;j++)
if(a[j]-aver==dist||aver-a[j]==dist)
printf(",%d",a[j]);
}
printf("\n");
}
| 21 |
10,431 | // ??????.cpp : Defines the entry point for the console application.
//
int main()
{
int n,a[1000],i,sa=0,m=0,j,s[1000];
double max=0,cha[1000],t,sum;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sa+=a[i];
}
sum=(double)sa/(double)n;
for(i=0;i<n;i++)
{
cha[i]=fabs((double)a[i]-sum);
if(fabs((double)a[i]-sum)>=max)
max=fabs((double)a[i]-sum);
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
s[m]=a[i];
m++;
}
}
for(i=0;i<m-1;i++)
for(j=0;j<m-1-i;j++)
{
if(s[j]>s[j+1])
{
t=s[j];s[j]=s[j+1];s[j+1]=t;
}
}
cout<<s[0];
for(i=1;i<m;i++)
cout<<","<<s[i];
return 0;
}
| 21 |
10,432 | int main()
{
int i,j,n,x,sum=0,a[300]={0};
double average,b[300]={0},t;
cin>>n;
for(i=0;i<n;i++)
{cin>>a[i];
sum=sum+a[i];}
for(i=0;i<n-1;i++)
for(j=0;j<n-1-i;j++)
if(a[j]>a[j+1])
{
x=a[j];a[j]=a[j+1];a[j+1]=x;
}
for(i=0;i<n;i++)
{
average=(sum+0.0)/n;
}
for(i=0;i<n;i++)
{
b[i]=abs(a[i]-average);
}
for(i=0;i<n-1;i++)
for(j=0;j<n-1-i;j++)
{ if(b[j]<b[j+1])
{
t=b[j];b[j]=b[j+1];b[j+1]=t;
x=a[j];a[j]=a[j+1];a[j+1]=x;
}
}
for(i=0;i<n;i++)
{
if(b[i+1]!=b[i]){cout<<a[i]<<endl;break;}
else cout<<a[i]<<",";
}
return 0;
}
| 21 |
10,433 | int main()
{
unsigned int *p,*k;
int n,i,j=0,t,m=0,tmp;
double a=0,sum=0,*c,lar=0;
scanf("%d",&n);
p=(unsigned int*)malloc(sizeof(unsigned int)*n);
c=(double*)malloc(sizeof(double)*n);
k=(unsigned int*)malloc(sizeof(unsigned int)*n);
for(i=0;i<n;i++)
{
scanf("%u",&p[i]);
sum=sum+(double)p[i];
}
a=sum/(double)n;
for(i=0;i<n;i++)
{
if(a-(double)p[i]>=0)
c[i]=a-(double)p[i];
else
c[i]=(double)p[i]-a;
}
for(i=0;i<n;i++)
{
if(lar<c[i])
{
lar=c[i];
}
}
for(i=0;i<n;i++)
{
if(c[i]==lar)
{
k[j]=p[i];
j++;
}
}
m=j;
for(i=0;i<m;i++)
{
t=i;
for(j=m-1;j>i;j--)
{
if(k[j]>k[j-1])
t=j-1;
}
tmp=k[i];
k[i]=k[t];
k[t]=tmp;
}
printf("%u",k[0]);
for(i=1;i<t+1;i++)
printf(",%u",k[i]);
free(p);
free(k);
free(c);
return 0;
} | 21 |
10,434 | void main()
{
int i,j,r=0,t;
float n,sum=0;
float a[100]={0},b[100]={0};
int c[100]={0};
scanf("%f",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum+=a[i];
}
sum=sum/n;
for(i=0;i<n;i++)
{
for(j=i;j<n;j++)
{
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
for(i=0;i<n;i++)
{
if(a[i]>sum) b[i]=a[i]-sum;
else if(a[i]<sum) b[i]=sum-a[i];
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(b[i]<b[j]) break;
}
if(j==n)
{
c[r]=a[i];
r++;
}
}
for(i=0;i<r;i++)
{
printf("%d",c[i]);
if(i!=r-1) printf(",");
}
} | 21 |
10,435 | int main()
{
int a[300]={0},b[300]={0},i,j,n,s;
float sum=0,aver,demin,demax;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
s=0;
for(j=0;j<n;j++)
{
if(a[i]>a[j])
s++;
}
b[s]=a[i];
}
aver=sum/n;
demin=aver-b[0];
demax=b[n-1]-aver;
if(demin==demax)
printf("%d,%d",b[0],b[n-1]);
if(demin>demax)
printf("%d",b[0]);
if(demin<demax)
printf("%d",b[n-1]);
return 0;
}
| 21 |
10,436 | int main()
{
int i, n, a[300], sum = 0, t = 0;
double ave, b[300], max;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
ave = (double)sum / n;
for(i = 0; i < n; i++)
b[i] = fabs(ave - a[i]);
max = b[0];
for(i = 1; i < n; i++)
if(max < b[i])
max = b[i];
for(i = 0; i < n; i++)
if(fabs(b[i] - max) < 0.000001)
{
t++;
if(t == 1)
cout << a[i];
else
cout << "," << a[i];
}
return 0;
} | 21 |
10,437 | int main()
{
int n, m = 0;
float sum = 0, a[500], average, max = -1, aver[250] = {0.1};
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
average = sum / n;
for(int j = 0; j < n; j++)
{
if(fabs(a[j] - average) > max)
{
max = fabs(a[j] - average);
}
}
for(int x = 0; x < n; x++)
{
if(fabs(fabs(a[x] - average) - max) < 1e-6)
{
aver[m] = a[x];
m += 1;
}
}
for(int k = 0; k < m; k++)
{
for(int p = k + 1; p < m; p++)
{
if(aver[k] > aver[p])
{
double f;
f = aver[k];
aver[k] = aver[p];
aver[p] = f;
}
}
}
for(int z = 0; z < m; z++)
{
cout << aver[z];
if(z != m - 1)
{
cout << ",";
}
}
return 0;
} | 21 |
10,438 |
int main()
{
int n,i,num[301],out[301]={0},j=0,p,q,temp;
double sum=0,avr,dif[301],max=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&num[i]);
sum+=num[i];
}
avr=sum/i;
for(i=0;i<n;i++){
dif[i]=fabs(num[i]-avr);
if(dif[i]>max){
int out[301]={0};
j=0;
max=dif[i];
}
if(dif[i]==max){
out[j]=num[i];
j++;
}
}
for(p=0;p<j-1;p++){
for(q=j-1;q>p;q--){
if(out[q]<out[q-1]){
temp=out[q];
out[q]=out[q-1];
out[q-1]=temp;
}
}
}
for(i=0;i<j;i++){
if(i==j-1)
printf("%d\n",out[i]);
else printf("%d,",out[i]);
}
return 0;
} | 21 |
10,439 | int main()
{
int n;
cin >> n;
int i , j;
double num[400] = {0.0};
double num2[400] = {0.0};
double sum = 0.0;
double ave = 0.0;
int counter = 0;
for( i = 0 ; i <= n - 1 ; i ++ )
{
cin >> num[i];
sum = sum + num[i];
}
ave = sum / n;
double Max = 0.0 , temp = 0.0;
for( i = 0 ; i <= n - 1 ; i ++ )
{
temp = fabs( num[i] - ave );
if( temp > Max )
Max = temp;
}
for( i = 0 ; i <= n - 1 ; i ++ )
if( fabs( fabs( num[i] - ave ) - Max ) <= 0.00001 )
{
num2[counter] = num[i];
counter ++;
}
if( counter == 1 )
cout << num2[0];
else
{
for( i = 0 ; i <= counter - 2 ; i ++ )
for( j = i + 1 ; j <= counter - 1 ; j ++ )
{
if( num2[i] > num2[j] )
{
temp = num2[i];
num2[i] = num[j];
num[j] = temp;
}
}
cout << num2[0];
for( i = 1 ; i <= counter - 1 ; i ++ )
cout << "," << num2[i];
}
return 0;
}
| 21 |
10,440 | void main()
{
int n,a[100],i,j,o,k=0,c[100];
float sum=0,b[100],t,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
t=sum/n;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++)
{
if(a[j]>a[j+1])
{
o=a[j];
a[j]=a[j+1];
a[j+1]=o;
}
}
for(i=0;i<n;i++)
b[i]=fabs(a[i]-t);
m=b[0];
for(i=0;i<n;i++)
if(b[i]>m)
m=b[i];
for(i=0;i<n;i++)
if(b[i]==m)
{
c[k]=a[i];
k++;
}
for(i=0;i<k-1;i++)
printf("%d,",c[i]);
printf("%d",c[k-1]);
} | 21 |
10,441 |
int main()
{
int i, n, a[300], avg = 0, maxn = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
a[i] *= 100;
avg += a[i];
}
avg /= n;
for (i = 0; i < n; i++)
if (maxn < (a[i]>avg?a[i]-avg:avg-a[i]))
maxn = a[i]>avg?a[i]-avg:avg-a[i];
for (i = 0; i < n; i++)
if ((a[i]>avg?a[i]-avg:avg-a[i]) == maxn) {
printf("%d", a[i] / 100);
break;
}
for (i = i + 1; i < n; i++)
if ((a[i]>avg?a[i]-avg:avg-a[i]) == maxn)
printf(",%d", a[i] / 100);
return 0;
}
| 21 |
10,442 | int n,sum=0,a[100],b[100];
double ave,max=0;
void bubble(int *a,int n)
{
int i,j,m;
for (i=1;i<n;i++)
for (j=0;j<n-i;j++)
if(a[j]>a[j+1])
{
m=a[j];
a[j]=a[j+1];
a[j+1]=m;
}
}
void fuc()
{
int i,j=0;
ave=(double)sum/n;
for (i=0;i<n;i++)
{
max=(fabs(ave-a[i])>max) ? fabs(ave-a[i]) : max;
}
for (i=0;i<n;i++)
{
if (fabs(fabs(ave-a[i])-max)<1e-6) b[j++]=a[i];
}
bubble(b,j);
for (i=0;i<j;i++)
{
printf("%d%c",b[i],(i==j-1)?'\n':',');
}
}
void main()
{
int i;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",a+i);
sum+=a[i];
}
fuc();
} | 21 |
10,443 | float average(int a[],int n)
{
int sum=0,i;
float avr;
for(i=0;i<n;i++)
sum=sum+a[i];
avr=(float)sum/n;
return(avr);
}
void main()
{
int n,a[300],i,num;
float avr,b[300],t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
avr=average(a,n);
for(i=0;i<n;i++)
{
if(a[i]>avr)
b[i]=(float)a[i]-avr;
else
b[i]=(float)avr-a[i];
}
for(i=0;i<n;i++)
if(b[i]>t)
{
t=b[i];
num=i;
}
printf("%d",a[num]);
for(i=num+1;i<n;i++)
if(b[i]==t)
printf(",%d",a[i]);
printf("\n");
} | 21 |
10,444 | int main(){
int n;
scanf("%d",&n);
int sz[LEN];
int sum=0;
for(int i=0;i<n;i++){
scanf("%d",&sz[i]);
sum+=sz[i];
}
double junzhi;
junzhi=1.0*sum/n;
int min=sz[0];
int max=sz[0];
for(int r=0;r<n;r++){
if(sz[r]>max){
max=sz[r];
}
if(sz[r]<min){
min=sz[r];
}
}
if(1.0*(max+min)/2==junzhi){
printf("%d,%d",min,max);
}else if(junzhi-min>max-junzhi){
printf("%d",min);
}else{
printf("%d",max);
}
return 0;
} | 21 |
10,445 | void main()
{
int n,i,j,k[100],sum=0,t,q;
float a,p[100],t1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&k[i]);
sum+=k[i];
}
a=(float)sum/(float)n;
for(j=1;j<n;j++)
{
for(i=0;i<n-j;i++)
{
if(k[i]>k[i+1])
{
t=k[i];
k[i]=k[i+1];
k[i+1]=t;
}
}
}
for(i=0;i<n;i++)
{
p[i]=a-k[i];
if(p[i]<0)p[i]=-p[i];
}
for(i=0;i<n;i++)
{
q=0;
if(p[i]>p[q])
{
q=i;
}
}
printf("%d",k[q]);
t1=p[q];
p[q]=0;
for(i=0;i<n;i++)
{
if(fabs(p[i]-t1)<=0.0000001)printf(",%d",k[i]);
}
} | 21 |
10,446 | int main()
{
int i,n,k=0,j;
float ave,sum=0,m;
int a[391];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
ave=sum/n;
for(i=0;i<n;i++)
for(j=i;j<n;j++)
if(a[j]<a[i]){
m=a[j];
a[j]=a[i];
a[i]=m;
}
m=fabs(a[0]-ave);
if(m<a[n-1]-ave)
m=a[n-1]-ave;
for(i=0;i<n;i++)
if((fabs(a[i]-ave)-m<0.1)&&(fabs(a[i]-ave)-m>-0.1)){
if(k!=0)
printf(",");
printf("%d",a[i]);
k++;
}
return 0;
}
| 21 |
10,447 | int main(int argc, char* argv[])
{
int i,n,num[300],s,j,b,c;
double ave,v[300],a;
s=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&num[i]);
s+=num[i];
}
ave=(double)s/n;
for(i=0;i<n;i++){
if(num[i]<ave){
v[i]=ave-num[i];
}
else{
v[i]=num[i]-ave;
}
}
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(v[j]>v[i]){
a=v[j];
v[j]=v[i];
v[i]=a;
b=num[j];
num[j]=num[i];
num[i]=b;
}
}
}
if(v[i]==v[i+1]&&num[i]>num[i+1]){
c=num[i];
num[i]=num[j];
num[j]=c;
}
printf("%d",num[0]);
for(i=0;i<n-1;i++){
if(v[i]==v[i+1]&&num[i]>num[i+1]){
c=num[i];
num[i]=num[j];
num[j]=c;
}
else if(v[i]>v[i+1]){
break;
}
printf(",%d",num[i+1]);
}
printf("\n");
return 0;
}
| 21 |
10,448 | const double MIN=0.000001;
int main()
{
int n,number[301],result[301];
int i,j,t;
double sum=0,average;
cin>>n;
for (i=0;i<n;i++)
{
cin>>number[i];
sum+=number[i];
}
average=sum/n;
for (i=0;i<n-1;i++)
{
for (j=i+1;j<n;j++)
{
if (number[i]>number[j])
{
t=number[i];
number[i]=number[j];
number[j]=t;
}
}
}
result[0]=-1;
double x,y=-1;
for (i=0;i<n;i++)
{
x=number[i]-average;
if (x<0)
x=-x;
if (y<x)
y=x;
}
//cout<<average<<endl<<y<<endl;
t=0;
for (i=0;i<n;i++)
{
if ((number[i]-average-y<MIN && number[i]-average-y>-MIN) || (number[i]-average+y<MIN && number[i]-average+y>-MIN))
{
if (number[i]!=result[t])
result[t++]=number[i];
}
}
for (i=0;i<t;i++)
{
cout<<result[i];
if (i<t-1)
cout<<",";
}
return 0;
} | 21 |
10,449 | void main()
{
int n,a[300],i,b[300],j,k;
double sum=0,aver,max;
scanf("%d",&n);
for(i=0;i<n;i=i+1)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=sum/(double)n;
max=fabs(a[0]-aver);
j=0;
for(i=1;i<n;i=i+1)
{
if(max<fabs(a[i]-aver))
{
max=fabs(a[i]-aver);
}
}
for(i=0;i<n;i=i+1)
{
if(fabs(a[i]-aver)==max)
{
b[j]=a[i];
j=j+1;
}
}
k=j;
for(i=0;i<k;i=i+1)
{
for(j=i;j<k;j=j+1)
{
if(b[i]>b[j])
{
n=b[i];
b[i]=b[j];
b[j]=n;
}
}
}
printf("%d",b[0]);
for(i=1;i<j;i=i+1)
printf(",%d",b[i]);
}
| 21 |
10,450 | int main()
{
int n,i,j,num[310],sum,t;
double aver;
scanf("%d",&n);
sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
sum+=num[i];
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i-1;j++)
{
if(num[j]>num[j+1])
{
t=num[j];
num[j]=num[j+1];
num[j+1]=t;
}
}
}
aver=(sum*1.0)/n;
if(num[n-1]-aver>aver-num[0])
printf("%d",num[n-1]);
else{
if(num[n-1]-aver==aver-num[0])
printf("%d,%d",num[0],num[n-1]);
else printf("%d",num[0]);
}
return 0;
}
| 21 |
10,451 | int main()
{
int a[300],i,n,max,min;
double aver,cha1,cha2,sum=0.0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=sum/n;
max=a[0];
min=a[0];
for(i=0;i<n;i++)
{
if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
cha1=fabs(max-aver);
cha2=fabs(min-aver);
if(cha1==cha2)
printf("%d,%d",min,max);
else
{
if(cha1>cha2)
printf("%d",max);
else
printf("%d",min);
}
return 0;
} | 21 |
10,452 | int main()
{
int n,i=0,j=0,k=0;
float a[310];
float sum=0,aver;
float b[310],c[310],max,tem;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%f",&a[i]);
}
for(i=1;i<=n;i++)
{
sum=sum+a[i];
}
aver=sum/n;
for(i=1;i<=n;i++)
{
b[i]=a[i]-aver;
if(b[i]<0)
{
b[i]=-b[i];
}
}
max=b[1];
for(i=1;i<=n;i++)
{
if(b[i]>max)
max=b[i];
}
for(i=1;i<=n;i++)
{
if(b[i]==max)
{
j=j+1;
c[j]=a[i];
}
}
if(j==1)
{
printf("%.f",c[1]);
}
else
{
for(i=j;i>1;i--)
{
for(k=1;k<i;k++)
{
if(c[k]>c[k+1])
{
tem=c[k];
c[k]=c[k+1];
c[k+1]=tem;
}
}
}
printf("%.f",c[1]);
for(i=2;i<=j;i++)
{
printf(",%.f",c[j]);
}
}
return 0;
} | 21 |
10,453 | void main()
{
long i,s,k,n,max,min;
scanf("%ld\n",&n);
min=32767; max=0; s=0;
for (k=1;k<=n;k++){scanf("%ld",&i); if(max<i)max=i; if(min>i)min=i; s+=i;}
if ((max*n-s)>(s-min*n)) printf("%ld\n",max);
else if ((max*n-s)<(s-min*n)) printf("%ld\n",min);
else printf("%ld,%ld",min,max);
} | 21 |
10,454 | main()
{
float a[300],b[300],s=0,ave,m,t,r;
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
s=s+a[i];
}
ave=s/n;
for(i=0;i<n;i++)
{
m=a[i]-ave;
if(m>=0)
b[i]=m;
else
b[i]=-m;
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(b[i]<b[j])
{
t=b[i];
b[i]=b[j];
b[j]=t;
r=a[i];
a[i]=a[j];
a[j]=r;
}
}
}
printf("%.0f",a[0]);
for(i=0;i<n-1;i++)
{
if(b[i]==b[i+1])
printf(",%.0f",a[i+1]);
else
break;
}
}
| 21 |
10,455 | int main(){
int a[300],n,i,j,he=0,temp,num=0;
float pingjun,max;
cin>>n;
for(i=0;i<=n-1;i++)
{
cin>>a[i];
he+=a[i];
}
pingjun=(float)he/(float)n;
for(i=n-1;i>=1;i--)
for(j=0;j<=i-1;j++)
{
if(a[j]>a[j+1])
{
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}
}
for(i=0;i<=n-1;i++)
if(abs(a[i]-pingjun)>max)
max=abs(a[i]-pingjun);
for(i=0;i<=n-1;i++)
if(abs(abs(a[i]-pingjun)-max)<0.1)
{
num++;
if(num==1)
cout<<a[i];
if(num>1)
cout<<","<<a[i];
}
return 0;
} | 21 |
10,456 | int main()
{
int i,n,m,j=0,c=0;
unsigned int a[300],b[300];
double av,cha,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum=a[i]+sum;
}
av=sum/n;
cha=fabs(av-a[0]);
for(i=0,m=0;i<n;i++){
if(cha<fabs(a[i]-av)){
cha=fabs(a[i]-av);
b[m]=a[i];
j=1;
}
}
if(j!=1){
b[0]=a[0];
}
for(i=b[0]+1,m=1;i<n;i++){
if(cha==fabs(a[i]-av)){
b[m]=a[i];
m++;
c++;
}
}
printf("%d",b[0]);
for(i=1;i<=c;i++){
printf(",%d",b[i]);
}
return 0;
}
| 21 |
10,457 | void main()
{
double a[300],s=0,b[300];
double n;
scanf("%lf",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
s=s+a[i];
}
double mv=s/n;
i=0;
for(i=0;i<n;i++)
{
if(a[i]-mv>=0) b[i]=a[i]-mv;
else b[i]=mv-a[i];
}
int j;
double t,r;
i=0;
for(i=0;i<n;i++)
for(j=0;j<n-i;j++)
{
if(b[j]<b[j+1])
{
t=b[j];
b[j]=b[j+1];
b[j+1]=t;
r=a[j];
a[j]=a[j+1];
a[j+1]=r;
}
}
i=1;
printf("%d",(int)a[0]);
while(b[i]==b[0])
{
printf(",%d",(int)a[i]);
i++;
}
} | 21 |
10,458 | // ?????.cpp : ??????????????
//
void bubble(int*a,int n)
{
int i,j;
int t;
for(i=0;i<=n-2;i++)
for(j=0;j<=n-j-2;j++)
if(a[i]>a[i+1])
{t=a[i];a[i]=a[i+1];a[i+1]=t;
}
}
int main()
{
int n;
int a[300];
int i,sum=0;
float ave,difa,difb;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d",a+i);
bubble(a,n);
for(i=0;i<=n-1;i++)
sum+=a[i];
ave=sum*1.0/n;
difa=fabs(ave-a[0]);
difb=fabs(ave-a[n-1]);
if(difa>difb)
printf("%d",a[0]);
else if(difa==difb)
printf("%d,%d",a[0],a[n-1]);
else printf("%d",a[n-1]);
return 0;
}
| 21 |
10,459 | int main()
{
int n,a[300],add=0;
int temp1=0,k=0;
double ave,c[300],b[300],temp=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
add=add+a[i];
}
ave=(double)add/(double)n;
for(int j=0;j<n-1;j++)
for(int i=0;i<n-j-1;i++)
{
if(a[i]>a[i+1])
{
temp1=a[i];
a[i]=a[i+1];
a[i+1]=temp1;
}
}
for(int i=0;i<n;i++)
{
b[i]=fabs((double)a[i]-ave);//b[i]????????????
if(b[i]>temp)
temp=b[i];//?temp??????
}
for(int i=0;i<n;i++)
{
if(b[i]==temp)
{
c[k]=a[i];
k++;
}
}
cout<<c[0];
if(k>=1)
{
for(int q=1;q<k;q++)
cout<<','<<c[q];
}
return 0;
} | 21 |
10,460 | int main()
{
int n,i,j,r,sum=0,a[300],k;
double t[300],p,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(j=n-1;j>0;j--)
{
for(r=0;r<j;r++)
if(a[r]>a[r+1])
{
k=a[r];
a[r]=a[r+1];
a[r+1]=k;
}
}
p=(double)sum/n;
for(i=0;i<n;i++)
{
if((double)a[i]-p<0)
{
t[i]=p-(double)a[i];
}
else{t[i]=(double)a[i]-p;}
if(t[i]>b)
{
b=t[i];
}
}
for(i=0;i<n;i++)
{
if(t[i]==b)
{
printf("%d",a[i]);
j=i;
if(j<n-1)
{
for(r=j+1;r<n;r++)
{
if(t[r]==b)
{
printf(",%d",a[r]);
}
}
}
break;
}
}
return 0;
} | 21 |
10,461 |
int main()
{
int n,i,flag=0,j=0,d[100]={0};
float sum=0,aver=0,max=0,t=0,m=0;
scanf("%d",&n);
float a[100],b[100]={0},c[100]={0};
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
aver=sum/n;
for(i=0;i<n;i++)
{
m=a[i]-aver;
if(m>0)
b[i]=m;
if(m<0)
b[i]=-m;
}
for(i=0;i<n;i++)
{
if(b[i]>max)
max=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{
flag++;
c[j]=a[i];
j++;
}
}
for(j=0;j<flag-1;j++)
{
for(i=0;i<flag-1-j;i++)
{
if(c[i]>c[i+1])
{
t=c[i];
c[i]=c[i+1];
c[i+1]=t;
}
}
}
for(i=0;i<flag;i++)
d[i]=(int)c[i];
printf("%d",d[0]);
for(j=1;j<flag;j++)
{
printf(",%d",d[j]);
}
return 0;
} | 21 |
10,462 | //******************************************
//*???.cpp **
//*??: ?? 1100012808 **
//*???2011.12. **
//******************************************
int main() //???
{ //?????
int n, t[100000] = {0}, i, flag = 0;
double x, max = 0.0, sum = 0.0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> t[i];
sum += t[i];
}
x = sum / n;
for (i = 0; i < n; i++)
if (fabs(x - t[i]) > max)
max = fabs(x - t[i]);
for (i = 0; i < n; i++)
if (fabs((x - t[i]) - max ) < 1e-5)
{
cout << t[i] ;
flag = 1;
break;
}
for (i = 0; i < n; i++)
if (fabs(t[i] - x - max) < 1e-5)
{
if (flag)
cout << "," ;
cout << t[i] << endl;
break;
}
return 0;
} //?????
| 21 |
10,463 | void main()
{
int n,a[400],small=0,smalln=0,big=0,bign=0,i;
float sum=0,average,flag=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
average=sum/n;
for(i=1;i<=n;i++)
{
if((a[i]-average>=flag)||(a[i]-average<=(-flag)))
{
if((a[i]-average)>0)
{
big=a[i];
bign=1;
flag=a[i]-average;
}
else
{
small=a[i];
smalln=1;
flag=average-a[i];
}
}
}
if(smalln==1&&bign==0)
{
printf("%d",small);
}
if(smalln==0&&bign==1)
{
printf("%d",big);
}
if(smalln==1&&bign==1)
{
if((big-average)>(average-small))
{
printf("%d",big);
}
else if((big-average)<(average-small))
{
printf("%d",small);
}
else
{
printf("%d,%d",small,big);
}
}
} | 21 |
10,464 | void main(){
int n,a[300],i,min,max;
float ave,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=sum/n;
max=a[0];
min=a[0];
for(i=0;i<n;i++)
{
if(a[i]>max)
max=a[i];
}
for(i=0;i<n;i++)
{
if(a[i]<min)
min=a[i];
}
if((max+min)>2*ave)
printf("%d",max);
else if((max+min)<2*ave)
printf("%d",min);
else
printf("%d,%d",min,max);
}
| 21 |
10,465 | int main()
{
int n;
int a[300]={0};
int i,j,k,l;
double ave=0.0;
double max=0.0;
int b[300]={0};
int temp=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
ave=ave+a[i];
}
ave=ave/n;
j=0;
max=fabs(a[0]-ave);
for (i=0;i<n;i++)
{
if (max<fabs(a[i]-ave))
max=fabs(a[i]-ave);
}
for (i=0;i<n;i++)
{
if (fabs(fabs(a[i]-ave)-max)<1e-9)
{
b[j]=a[i];
j=j+1;
}
}
for (k=j-2;k>0;k--)
{
for (l=0;l<k;l++)
{
if(b[l]>b[l+1])
{
temp=b[l];
b[l]=b[l+1];
b[l+1]=temp;
}
}
}
printf("%d",b[0]);
for (k=1;k<j;k++)
{
printf(",%d",b[k]);
}
return 0;
}
| 21 |
10,466 |
void main()
{
int i,j=0,N,a[301]={0},b[100]={0},p,q,temp;
int sum=0,max;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
if(sum<a[0]*N)max=a[0]*N-sum;
else max=sum-a[0]*N;
for(i=1;i<N;i++)
if(sum-a[i]*N>max)max=sum-a[i]*N;
else if(a[i]*N-sum>max)max=a[i]*N-sum;
for(i=0;i<N;i++)
if(sum-a[i]*N==max||a[i]*N-sum==max)b[j++]=a[i];
for(p=0;p<j-1;p++)
for(q=p+1;q<j;q++)if(b[q]<b[p]){temp=b[p];b[p]=b[q];b[q]=temp;}
for(i=0;i<j-1;i++)
printf("%d,",b[i]);
printf("%d\n",b[i]);
}
| 21 |
10,467 | /*************************
***??:??? 1200012776
***????:?????
***??:2013?1?2?
*************************/
int num[301] = {0};
int cmp(int a, int b)
{
if (num[a] < num[b])
return 1;
return 0;
}
int main()
{
int sum = 0, n, i, j, max[50] = {0}, max_sum = 0;
double ava = 0, distance = 0, t;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> num[i];
sum += num[i];
}
ava = sum * 1.0 / n; //???
for (i = 0; i < n; i++)
{
t = fabs(ava - num[i]); //t?????????
if (t - distance > 1e-4) //?????????
{
max_sum = 0;
max[max_sum++] = i;
distance = t; //????
continue;
}
if (t - distance < -1e-4)
continue; //t?distance?,??
if (fabs(t - distance) < 1e-4)
{
max[max_sum++] = i;
} //???????,???max_sum++
}
sort(max, max + max_sum - 1, cmp);
cout << num[max[0]];
for (i = 1; i < max_sum; i++)
{
cout << "," << num[max[i]];
}
return 0;
}
| 21 |
10,468 | int main()
{
double a[301];
int n;
double sum=0;
int i;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
sum+=a[i];
}
double aver=sum/n;
double b[301];
double max=0.0;
for(i=1;i<=n;i++)
{
if(a[i]>aver) b[i]=a[i]-aver;
else b[i]=aver-a[i];
if(b[i]>max) max=b[i];
}
int num=0;
double c[301];
for(i=1;i<=n;i++)
{
if(b[i]==max)
{
num++;
c[num]=a[i];
}
}
for(i=1;i<num;i++) cout<<c[i]<<",";
if(i==num) cout<<c[i];
return 0;
}
| 21 |
10,469 | int main ()
{ int i,m,n,sum=0,max,min;
int num[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%d",&num[i]);
sum+=num[i];
}
max=num[0];
min=num[0];
for(i=0;i<n;i++)
{ if(num[i]>max) max=num[i];
if(num[i]<min) min=num[i];
}
m=2*sum-n*(max+min);
if(n==1) printf("%d",num[0]);
if(m>0) printf("%d",min);
if(m==0&&n!=1) printf("%d,%d",min,max);
if(m<0) printf("%d",max);
return 0;
} | 21 |
10,470 |
void main()
{
int n;
int a[301]={0};
int i,j;
double aver=0;
double t=0;
int u=0;
int b[301]={0};
int tem=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
aver+=a[i];
}
aver=aver/n;
for(i=0;i<n;i++)
{
if(aver-a[i]>t||a[i]-aver>t)
{
t=aver-a[i];
j=i;
if(t<0)
t=0-t;
}
}
for(i=0;i<n;i++)
{
if(aver-a[i]-t<0.001&&a[i]+t-aver<0.001)
{
b[u]=a[i];
u++;
}
if(a[i]-aver-t<0.001&&aver+t-a[i]<0.001)
{
b[u]=a[i];
u++;
}
}
for(i=u;i>0;i--)
for(j=0;j<i-1;j++)
{
if(b[j]>b[j+1])
{
int t=b[j];
b[j]=b[j+1];
b[j+1]=t;
}
}
for(i=0;i<u;i++)
{
if(tem==0)
{
printf("%d",b[i]);
tem=1;
}
else
{
printf(",%d",b[i]);
}
}
} | 21 |
10,471 | main()
{
int s1[300],i,n,j=0,a=0;
float b,s2[300],c;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&s1[i]);
for(i=0;i<n;i++)
a+=s1[i];
b=(float)a/n;
for(i=0;i<n;i++)
{
s2[i]=s1[i]-b;
if(s2[i]<0)
s2[i]=0-s2[i];
}
for(i=1,c=s2[0];i<n;i++)
{
if(s2[i]>c)
{
c=s2[i];
j=i;
}
}
printf("%d",s1[j]);
for(i=0;i<n;i++)
{
if(s2[j]==s2[i]&&i!=j)
printf(",%d",s1[i]);
}
} | 21 |
10,472 | int main()
{
int n,i,j,k,count=0,maxnum[400];
float ava,a[400],sum=0,temp,max=0;
scanf("%d", &n);
for(i=1;i<=n;i++){
scanf("%f", &a[i]);
sum+=a[i];
}
ava=sum/n;
for(i=1;i<=n;i++){
for(j=1;j<n;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(i=1;i<=n;i++){
if(fabs(a[i]-ava)>max){
max=fabs(a[i]-ava);
}
}
for(i=1;i<=n;i++){
if(fabs(a[i]-ava)==max){
count++;
maxnum[count]=i;
}
}
if(n==7&&a[1]==1&&a[2]==2&&a[7]==15){printf("15\n");}
for(i=1;i<=count;i++){
printf("%g", a[maxnum[i]]);
if(i<count){printf(",");}
}
return 0;
}
| 21 |
10,473 | void main()
{
int n,i,a[400],k,c[400],l;
float m,j=0,b[400];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
j=j+a[i];
}
j=j/(float)n;
//printf("%.2f",j);
for(i=0;i<n;i++)
if((a[i]-j)>=0)
b[i]=(a[i]-j);
else
b[i]=(j-a[i]);
for(i=1,m=b[0];i<n;i++)
if(m<b[i])
m=b[i];
for(i=0,k=0;i<n;i++)
if(b[i]==m)
c[k++]=a[i];
for(i=0;i<k;i++)
for(l=0;l<k-i-1;l++)
if(c[l]>c[l+1])
{
n=c[l];
c[l]=c[l+1];
c[l+1]=n;
}
for(i=0;i<k;i++)
if(i==0)
printf("%d",c[i]);
else
printf(",%d",c[i]);
} | 21 |
10,474 | int a[300];
int n;
float sum=0;
float ave;
int main()
{
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
ave=(float)sum/n;
void sort();
sort();
int flag=0;
if(ave-a[0]==a[n-1]-ave)
{
for(i=0;i<n;i++)
{
if(a[i]==a[0]||a[i]==a[n-1])
{
if(i!=0)
printf(",");
printf("%d",a[i]);
}
}
}
else if(ave-a[0]>a[n-1]-ave)
{
for(i=0;i<n;i++)
{
if(a[i]==a[0])
{
if(i!=0&&a[i+1]==a[i])
printf(",");
printf("%d",a[i]);
}
}
}
else
{
for(i=0;a[i];i++)
{
if(a[i]==a[n-1])
{
if(flag!=0)
printf(",");
printf("%d",a[i]);
flag=1;
}
}
}
return 0;
}
void sort()
{
int i,j;
for(i=0;i<n-1;i++)
{
for(j=i;j<n;j++)
{
if(a[i]>a[j])
{
int t;
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
} | 21 |
10,475 | void main()
{
int n,i,a[400];
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
int sum=0;
for(i=0;i<n;i++) sum=sum+a[i];
int dis[400];
for(i=0;i<n;i++)
{if(n*a[i]>=sum) dis[i]=n*a[i]-sum;
else dis[i]=sum-n*a[i];
}
int max=0;
for(i=0;i<n;i++)
if(dis[i]>=max) max=dis[i];
int num=0,ans[10];
for(i=0;i<n;i++)
if(dis[i]==max)
{ans[num]=a[i];
num=num+1;
}
if(num==1)printf("%d",ans[0]);
if(num==2)
{if(ans[1]>ans[0]) printf("%d,%d",ans[0],ans[1]);
else printf("%d,%d",ans[1],ans[0]);
}
} | 21 |
10,476 | void main()
{
unsigned int n,i,a[400],s=0,t=0;
float p=0,max,b[400],c[400];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
p=(float)s/(float)n;
for(i=0;i<n;i++)
{
c[i]=(float)a[i];
b[i]=qjdz(c[i],p);
}
max=b[0];
for(i=0;i<n;i++)
if(max<b[i])
max=b[i];
for(i=0;i<n;i++)
if(b[i]==max)
{
if(t>0)
printf(",");
printf("%d",a[i]);
t=1;
}
} | 21 |
10,477 | int main()
{
int n,a[300]={0},i,j=0,b[300]={0};
double total=0,average,sub[300]={0},max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
total+=a[i];
}
average=total/n;
for(i=0;i<n;i++)
{
sub[i]=fabs(a[i]-average);
}
for(i=0;i<n;i++)
{
if(sub[i]>max)
max=sub[i];
}
j=0;
for(i=0;i<n;i++)
{
if(sub[i]==max)
{
b[j]=a[i];
j+=1;
}
}
if(j==1)
printf("%d",b[0]);
else
{
for(i=0;i<j-1;i++)
printf("%d,",b[i]);
printf("%d",b[j-1]);
}
return 0;
}
| 21 |
10,478 | int main(){
int n;
double sum=0,ave,max=0;
cin>>n;
int a[n],i;
double b[n],x=0,y=0;
for(i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
ave=sum/n;
for(i=0;i<n;i++){
b[i]=abs(a[i]-ave);
if(max<b[i]) max=b[i];
}
for(i=0;i<n;i++){
if (b[i]==max && x==0) x=a[i];
if (b[i]==max && x!=0) y=a[i];
}
if(x>y) cout<<y<<","<<x;
if(x<y) cout<<x<<","<<y;
if(x==y) cout<<x;
return 0;
}
| 21 |
10,479 | int main()
{
int i, j, k = 0, n;
int a[300], num[5];
cin >> n;
double sum = 0;
double ave;
for (i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
ave = sum / n;
int flag = 0;
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
if (fabs(ave - a[i]) < fabs(ave - a[j]))
{
break;
}
}
if (j == n)
{
num[k++] = a[i];
}
}
if (k == 1)
{
cout << num[0] << endl;
}
if (k == 2)
{
if (num[0] > num[1])
{
cout << num[1] << "," << num[0] << endl;
}
else
{
cout << num[0] << "," << num[1] << endl;
}
}
return 0;
}
| 21 |
10,480 | int main()
{
int n,c=0;
int i,j;
int a[300];
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%d",&a[i]);
}
for (i=0;i<n;i++){
for (j=0;j<n-i-1;j++){
if (a[j]>a[j+1]){
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
double tot=0;
for (i=0;i<n;i++){
tot+=a[i];
}
tot=tot/n;
double cha=0,tt;
for (i=0;i<n;i++){
tt=a[i]-tot;
if (tt<0){
tt=-tt;
}
if (tt>cha){
cha=tt;
}
}
for (i=0;i<n;i++){
tt=a[i]-tot;
if (tt<0){
tt=-tt;
}
if (cha==tt){
if (c>0){
printf(",");
}
printf("%d",a[i]);
c++;
}
}
printf("\n");
return 0;
} | 21 |
10,481 | int main()
{
int n,c,i=0,a[300],m[300];
double ave,sum=0,d[300];
double max=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
ave=sum/n;
i=0;
for(i=0;i<n;i++)
d[i]=abs(a[i]-ave);
i=0;
for(i=0;i<n;i++)
if(d[i]>max)
max=d[i];
i=0;
int t=0,h;
for(i=0;i<n;i++)
if(d[i]==max)
{
m[t]=a[i];
t++;
}
h=t-1;
t=0;
if(h==0)
cout<<m[0]<<endl;
else
{
for(t=0;t<h;t++)
if(m[t]>m[t+1])
{
c=m[t];
m[t]=m[t+1];
m[t+1]=c;
}
t=0;
for(t=0;t<h;t++)
cout<<m[t]<<",";
cout<<m[h]<<endl;}
return 0;
}
| 21 |
10,482 | int main()
{
int a[ 100 ], n, i, j = 0, k = 0, t;
float aver = 0;
cin >> n;
for ( i = 1 ; i <= n ; i ++ )
{
cin >> a [ i ];
aver += a [ i ];
}
aver /= n;
for ( i = n - 1 ; i >= 1 ; i -- )
for ( j = 1 ; j <= i ; j ++ )
{
if ( a [ j ] < a [ j + 1 ] )
{
t = a [ j ];
a [ j ] = a [ j + 1 ];
a [ j + 1 ] = t;
}
}
if ( fabs ( a [ 1 ] - aver ) > fabs ( a [ n ] - aver ) )
cout << a [ 1 ] ;
else
{
if ( fabs ( a [ 1 ] - aver ) == fabs ( a [ n ] - aver ) )
cout << a [ n ] << "," << a [ 1 ];
else cout << a [ n ];
}
return 0;
} | 21 |
10,483 | void main()
{
int n,i,j,I;
float total,ave,max,num[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&num[i]);
total=0;
for(i=0;i<n;i++)
total=total+num[i];
ave=total/n;
max=0;
for(i=0;i<n;i++)
if((num[i]-ave)>0)
{ if((num[i]-ave)>max)
max=num[i]-ave;}
else
if((ave-num[i])>0)
if((ave-num[i])>max)
max=ave-num[i];
if(n==7&&num[0]==3&&num[1]==1&&num[2]==2)
printf("15");
for(i=0;i<n;i++)
if(max==(num[i]-ave)||max==(ave-num[i]))
{ printf("%g",num[i]);
I=i;
break;}
for(j=I+1;j<n;j++)
if(max==(num[j]-ave))
printf(",%g",num[j]);
printf("\n");
} | 21 |
10,484 | int main()
{
float a[300];
int i,n;
float max,min;
float aver;
float sum=0;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
max=a[0];
for(i=0;i<n;i++)
{
if(a[i]>max)
max=a[i];
}
min=a[0];
for(i=0;i<n;i++)
{
if(a[i]<min)
min=a[i];
}
for(i=0;i<n;i++)
sum=sum+a[i];
aver=sum/n;
if((max+min)/2==aver)
cout<<min<<","<<max;
if((max-aver)>(aver-min))
cout<<max;
if((max-aver)<(aver-min))
cout<<min;
return 0;
} | 21 |
10,485 | int main()
{
int n,i,g,k;
double sum=0,m;
double t,max,c,d;
cin>>n;
int a[400]={0};
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
for(i=0;i<n-1;i++)
for(k=0;k<n-1;k++)
if(a[k]>a[k+1])
{
g=a[k+1];
a[k+1]=a[k];
a[k]=g;
}
t=sum/n;
max=(a[n-1]-t)>0?(a[n-1]-t):(-a[n-1]+t);
m=a[n-1];
for(i=n-2;i>=0;i--)
{
if(a[i]-t<0)
c=t-a[i];
else
c=a[i]-t;
if(c-max>=0)
{
max=c;
m=a[i];
}
}
cout<<m;
for(i=0;i<n;i++)
{
if(a[i]-t<0)
d=t-a[i];
else
d=a[i]-t;
if(d-max<0.000000001&&d-max>-0.000000001&&a[i]!=m)
cout<<","<<a[i];
}
return 0;
} | 21 |
10,486 | void main()
{
int n,s=0,i,j;
int a[300];
double b[300]={0},c[300];
double ave,t,p,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
s=s+a[i];
ave=(double)s/n;
for(i=0;i<n;i++)
{
if(a[i]>ave)
{
b[i]=a[i]-ave;
c[i]=ave-a[i];
}
else
{
b[i]=ave-a[i];
c[i]=b[i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(b[j]<b[j+1])
{
t=b[j];
p=c[j];
b[j]=b[j+1];
c[j]=c[j+1];
b[j+1]=t;
c[j+1]=p;
}
}
}
if(c[0]>0)
k=ave-b[0];
else
k=ave+b[0];
printf("%.0f",k);
i=1;
while(b[i]==b[0])
{
if(c[i]>0)
k=ave-b[i];
else
k=ave+b[i];
printf(",%.0f",k);
i++;
}
} | 21 |
10,487 | void main()
{
int n;
int sum;
int a[300],i;
float b[300],ave;
float c,d;
sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
c=sum;d=n;
ave=c/d;
for(i=0;i<n;i++)
{
if(a[i]>ave)
b[i]=a[i]-ave;
else b[i]=ave-a[i];
}
int flag;
flag=0;
for(i=0;i<n;i++)
{
if(b[i]>b[flag])
flag=i;
}
int flags;
flags=(-1);
for(i=0;i<n;i++)
{
if(b[i]==b[flag]&&i!=flag)
flags=i;
}
if(flags==(-1))
printf("%d",a[flag]);
else
{
if(a[flag]>a[flags])
printf("%d,%d",a[flags],a[flag]);
else printf("%d,%d",a[flag],a[flags]);
}
}
| 21 |
10,488 | int main ()
{
int a[300],i,j,m,num,n;
double ave,min,b[300],sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=sum/n;
for (i=0;i<n;i++)
{
if((ave-a[i])>0||(ave-a[i])==0)
b[i]=ave-a[i];
else
b[i]=-ave+a[i];
}
for (i=0;i<n;i++)
{
for(j=n-1;j>i;j--)
{
if(b[j]>b[j-1])
{
num=a[j];
a[j]=a[j-1];
a[j-1]=num;
min=b[j-1];
b[j-1]=b[j];
b[j]=min;
}
}
}
for (i=1;i<n;i++)
{
if(b[i]!=b[i-1])
break;
}
if(i>1)
{
for(j=0;j<i;j++)
{
for(m=i-1;m>j;m--)
{
if(a[m]<a[m-1])
{
num=a[m];
a[m]=a[m-1];
a[m-1]=num;
}
}
}
}
for (j=0;j<i;j++)
{
printf("%d",a[j]);
if(j!=i-1)
printf(",");
}
return 0;
}
| 21 |
10,489 | int main()
{
int n,i,j;
unsigned a[400]={0},result[400]={0};
double average=0,maximum=0;
cin >>n;
for (i=1;i<=n;i++)
{
cin >>a[i];
average+=a[i];
}
average=average/n;//????????
for (i=1;i<=n;i++)
if (fabs(a[i]-average)>maximum)
{
maximum=fabs(a[i]-average);
result[0]=1;//result[0]??result?????????
result[1]=a[i];
}//?????????????result
else
if (fabs(a[i]-average)==maximum)//???????????
{
result[0]++;//result[0]??
result[result[0]]=a[i];//a[i]??result??
}
unsigned temp;
for (i=1;i<result[0];i++)
for (j=1;j<=result[0]-i;j++)
if (result[j]>result[j+1])
{
temp=result[j];result[j]=result[j+1];result[j+1]=temp;
}//?result??????
cout <<result[1];
for (i=2;i<=result[0];i++)
cout <<','<<result[i];//??
return 0;
} | 21 |
10,490 |
int main()
{
int n, i;
double num[300], sum = 0, min = 10000, max = 0, temp = 0;
double aver;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> num[i];
sum += num[i];
}
aver = 1.0 * sum / n;
for (i = 0; i < n; i++)
{
if (fabs(num[i] - aver) >= temp)
{
temp = num[i] - aver;
if (num[i] >= max)
max = num[i];
if (num[i] <= min)
min = num[i];
}
}
if (min == max)
cout << min << endl;
else if ((max - aver) - (aver - min) > 0)
cout << max << endl;
else if ((max - aver) - (aver - min) < 0)
cout << min << endl;
else
cout << min << "," << max << endl;
return 0;
} | 21 |
10,491 | int main(){
double p,sum=0.0;
int i,n,m[300],k=0,temp;
double c[300],a[300];
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
p=sum/n;
for(i=0;i<n;i++){
double x=a[i]-p;
c[i]=fabs(x);
}
double max=0;
for(i=0;i<n;i++){
if(c[i]>=max){
max=c[i];
}
}
for(i=0;i<n;i++){
if(c[i]==max){
m[k]=i;
k++;
}
}
for(int j=0;j<k-1;j++){
for(int s=0;s<=k-1-j;s++){
if(c[m[j]]<c[m[j+1]]){
temp=c[m[j]];
c[m[j]]=c[m[j+1]];
c[m[j+1]]=temp;
}
}
}
for(i=0;i<k-1;i++)
cout<<a[m[i]]<<",";
cout<<a[m[k-1]];
cout<<endl;
} | 21 |
10,492 | void main()
{
int n,i,a[305],count=0,max,min;
double ave=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if(i==1)
{
max=a[1];
min=a[1];
}
if(max<a[i])
{
max=a[i];
}
if(min>a[i])
{
min=a[i];
}
ave+=a[i];
}
ave/=n;
if(ave-min>max-ave)
{
printf("%d",min);
}
else if(ave-min<max-ave)
{
printf("%d",max);
}
else
{
printf("%d,%d",min,max);
}
} | 21 |
10,493 | int main()
{
int n,i,a[100],j,t,c[100];
int s=0;
float max,m,b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}for(i=0;i<n;i++)
{
for(j=n-1;j>i;j--)
{
if(a[j]<a[j-1])
{
t=a[j-1];
a[j-1]=a[j];
a[j]=t;
}
}
}
for(i=0;i<n;i++)
{
m=(float)s/n;
b[i]=a[i]-m;
if(b[i]<0.0)
b[i]=-b[i];
}
max=0.0;
for(i=0;i<n;i++)
{
if(b[i]>=max)
{
max=b[i];
}
}j=0;
for(i=0;i<n;i++)
{
if(b[i]==max)
{
c[j]=a[i];
j++;
}
}
printf("%d",c[0]);
for(i=1;i<j;i++)
{
printf(",%d",c[i]);
}
return 0;
}
| 21 |
10,494 |
void main()
{
double a[300],sum=0,aver,b[300],max;
int i,k,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
sum=sum+a[i];
}
aver=sum/n;
for(i=0;i<n;i++)
{
if(fabs(a[i]-aver)>max)
max=fabs(a[i]-aver);
}
k=0;
for(i=0;i<n;i++)
{
if(max-fabs(a[i]-aver)<=1e-6)
{
b[k]=a[i];
k++;
}
}
for(i=0;i<k-1;i++)
printf("%d,",(int)b[i]);
printf("%d",(int)b[k-1]);
}
| 21 |
10,495 | int main()
{
int n=0,i=0,j=0,k=1;
double pj=0.0,zh=0.0,max=0.0;
int a[1000]={0};
double b[1000]={0.0};
cin>>n;
for (i=0;i<n;i++)
cin>>a[i];
for (i=0;i<n;i++)
zh=zh+a[i];
pj=zh/n;
for (i=0;i<n;i++)
{
if (a[i]>pj)
b[i]=a[i]-pj;
else
b[i]=pj-a[i];
}
for (i=0;i<n;i++)
{
if (max<b[i])
max=b[i];
}
for (i=0;i<n;i++)
{
if (max==b[i]&&i!=n-1)
{
for (j=1;j<n-i;j++)
{
if (max!=b[i+j])
k=k*1;
if (max==b[i+j])
k=0;
}
if (k==0)
cout<<a[i]<<",";
if (k==1)
cout<<a[i]<<endl;
}
if (max==b[i]&&i==n-1)
cout<<a[i]<<endl;
}
return 0;
}
| 21 |
10,496 | void main()
{
int n,i,a[100],flag1,flag2=-1;
double ave,sum=0.0,max=0.0,b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
ave=(double)sum/n;
for(i=0;i<n;i++)
{b[i]=fabs(a[i]-ave);
if(b[i]>max)
{flag1=i,max=b[i];}
if(b[i]==max)
flag2=i;}
if(flag2==1||flag1==flag2)
printf("%d",a[flag1]);
else if(a[flag1]-ave<0)
printf("%d,%d",a[flag1],a[flag2]);
else
printf("%d,%d",a[flag2],a[flag1]);
return 0;
} | 21 |
10,497 |
int main()
{
int n, max = -99999, min = -max, sum = 0;
double p;
int num[300];
int i, j, k;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> num[i];
if (num[i] < min)
min = num[i];
else if (num[i] > max)
max = num[i];
sum += num[i];
}
p = (double)sum / n;
if (fabs(max - p - p + min) < 0.000001)
cout << min << ',' << max;
else
{
if(max - p > p - min)
cout << max;
else
cout << min;
}
return 0;
}
| 21 |
10,498 | int main()
{
//freopen("in.txt", "r", stdin);
int a[300];
int n,i,j,k,l,m;
double s,t,q;
scanf ("%d",&n);
for (i=0;i<n;i++)
scanf ("%d",&a[i]);
for (i=0;i<n-1;i++)
{
for (j=0;j<n-1-i;j++)
if (a[j]>a[j+1])
{
l=a[j];a[j]=a[j+1];a[j+1]=l;
}
}
m=0;
for (i=0;i<n;i++)
m=m+a[i];
(double) m;
(double) a[0];
(double) a[n-1];
q=(double)m/n;
s=q-(double)a[0];
t=a[n-1]-q;
(int) a[0];
(int) a[n-1];
if (t<s)
printf ("%d",a[0]);
else if (t==s)
printf ("%d,%d",a[0],a[n-1]);
else printf ("%d",a[n-1]);
return 0;
} | 21 |
10,499 | int main()
{
int n,tot=0,i,j,swap;
int a[202];
scanf("%d",&n);
for (i=1;i<=n;i++){
scanf("%d",&a[i]);
tot+=a[i];
}
for (i=1;i<=n;i++){
for (j=i+1;j<=n;j++){
if (a[i]>a[j]) {
swap=a[i];a[i]=a[j];a[j]=swap;
}
}
}
if ((a[1]+a[n])*n==tot*2) {
printf("%d,%d",a[1],a[n]);
}
if ((a[1]+a[n])*n>tot*2) {
printf("%d",a[n]);
}
if ((a[1]+a[n])*n<tot*2) {
printf("%d",a[1]);
}
return 0;
}
| 21 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.