id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
10,300 | void main()
{
int i,j,a[300],n,t;
float d,s=0,b,c;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
s=s+a[i];
d=s/n;
for(j=0;j<n-1;j++)
for(i=0;i<n-1-j;i++)
if(a[i]>a[i+1])
{
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
b=d-a[0];
c=a[n-1]-d;
if(b<c)
printf("%d\n",a[n-1]);
else if(b>c)
printf("%d\n",a[0]);
else
printf("%d,%d\n",a[0],a[n-1]);
} | 21 |
10,301 | void main()
{
int n,i,j,k,total=0,a[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
float N,b[300]={0.0000},c[300]={0.0000};
for(i=0;i<n;i++)
{
total=total+a[i];
}
N=(float)total/n;
for(i=0;i<n;i++)
{
if(a[i]>=N)b[i]=a[i]-N;
else c[i]=N-a[i];
}
float bmax=0.0000,cmax=0.0000;
for(i=0;i<n;i++)
{
if(b[i]>bmax)
{
bmax=b[i];
j=i;
}
if(c[i]>cmax)
{
cmax=c[i];
k=i;
}
}
if(bmax==cmax)printf("%d,%d",a[k],a[j]);
else if(bmax>cmax)printf("%d",a[j]);
else if(cmax>bmax)printf("%d",a[k]);
return;
} | 21 |
10,302 | int main()
{
int n,i,num_min=1,num_max=1;
float max=-10000,min=10000,a[301],sum=0,ave;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]>max)
{
max=a[i];
num_max=1;
}
else if(a[i]==max)
{
num_max++;
}
if(min>a[i])
{
min=a[i];
num_min=1;
}
else if(min==a[i])
{
num_min++;
}
sum+=a[i];
}
ave=sum/n;
if(ave==(max+min)/2)
{
for(int t=1;t<=num_min;t++)
cout<<min<<",";
for(int t=1;t<num_max;t++)
cout<<max<<",";
cout<<max;
}
else if(ave<(max+min)/2)
{
for(int t=1;t<num_max;t++)
cout<<max<<",";
cout<<max;
}
else if(ave>(max+min)/2)
{
for(int t=1;t<num_min;t++)
cout<<min<<",";
cout<<min;
}
return 0;
} | 21 |
10,303 | int main()
{int i,j,k,temp=0,n,x[301],y[301];
float ave=0,max=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{scanf("%d",&x[i]);
ave=x[i]+ave;}
ave=ave/n;
for (i=0;i<n;i++)
if(fabs(ave-x[i])>max)
max=fabs(ave-x[i]);
for (i=0,j=0;i<n;i++)
if (fabs(ave-x[i])>max-0.01)
{y[j]=x[i];j++;}
k=j-1;
for (i=1;i<=n;i++)
for(j=0;j<k;j++)
{if(y[j]>y[j+1])
{temp=y[j];
y[j]=y[j+1];
y[j+1]=temp;
}}
printf("%d",y[0]);
for (i=1;i<=k;i++)
printf(",%d",y[i]);
return 0;
}
| 21 |
10,304 | void main()
{
int a[300],b[300];
int j=0,i,n,k,m,t;
float c,max,sum=0,d[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
c=sum/n;
for(i=0;i<n;i++)
{
if(c-a[i]>=0)
d[i]=c-a[i];
else
d[i]=a[i]-c;
}
max=d[0];
for(i=0;i<n;i++)
{ if(d[i]>max)
max=d[i];
}
for(i=0;i<n;i++)
if(d[i]==max)
{ b[j]=a[i];j++;}
for(k=0;k<(j-1);k++)
{
for(m=0,t=0;m<(j-1-k);m++)
if(b[m]>b[m+1])
{
t=b[m];
b[m]=b[m+1];
b[m+1]=t;
}
}
printf("%d",b[0]);
for(i=1;i<j;i++)
printf(",%d",b[i]);
} | 21 |
10,305 | int main()
{
int n,i,j,tem,a[300];
float ave,b[300],max,sum;
sum=0;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&a[j]);
sum=sum+a[j];
}
ave=sum/n;
for(i=0;i<n;i++)
{
if(a[i]<=ave)
b[i]=ave-a[i];
else
b[i]=a[i]-ave;
}
max=b[0];
for(j=1;j<n;j++)
{
if(max<b[j])
max=b[j];
}
for(j=0;j<n;j++)
{
if(b[j]==max)
{
printf("%d",a[j]);
tem=j;
break;
}
}
for(j=tem+1;j<n;j++)
{
if(b[j]==max)
{
printf(",%d",a[j]);
}
}
return 0;
} | 21 |
10,306 | int main()
{
int n, i, j, num[1000], sum=0, t;
double ans=0;
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%d", &num[i]);
sum+=num[i];
}
ans=(double)sum/n;
for(i=0;i<n;i++){
for(j=n-1;j>i;j--){
if(num[j-1]>num[j]){
t=num[j];
num[j]=num[j-1];
num[j-1]=t;}
}
}
if(num[n-1]-ans==ans-num[0]){
printf("%d,%d", num[0], num[n-1]);}
else if(num[n-1]-ans>ans-num[0]){
printf("%d", num[n-1]);}
else if(num[n-1]-ans<ans-num[0]){
printf("%d", num[0]);}
return 0;
}
| 21 |
10,307 | int main()
{
int n , i , j = 0 ;
float average , m = 0 ;
cin >> n ;
int a[n] , b[n] ;
for ( i = 0 ; i < n ; i++ )
{
cin >> a[i] ;
average += a[i];
}
average /= n ;
for ( i = 0 ; i < n ; i++ )
if ( m < fabs( a[i] - average ) )
m = fabs( a[i] - average );
for ( i = 0 ; i < n ; i++ )
if ( m == fabs( a[i] - average ) )
{
b[j] = a[i] ;
j++;
}
int l = j , temp ;
for ( i = 0 ; i < l ; i++ )
for ( j = 0 ; j < l - i - 1 ; j++ )
{
if ( a[ j ] > a[ j + 1 ])
{
temp = a[ j ];
a[ j ] = a[ j + 1 ];
a[ j + 1 ] = temp ;
}
}
for ( i = 0 ; i < l - 1 ; i++ )
cout << b[i] << "," ;
cout << b[i];
cin >> i ;
return 0 ;
}
| 21 |
10,308 | /* Note:Your choice is C IDE */
void main()
{
int a[100],n,i,j,t,sum=0;
float x,y,z;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&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;}
}
for(i=0;i<n;i++)
{sum+=a[i];}
x=(float)sum/n;
y=a[n-1]-x;
z=x-a[0];
if(y>z)
{printf("%d",a[n-1]);
for(i=1;i<n-1;i++)
if(a[i]-x==y)
printf(",%d",a[i]);
}
else
{printf("%d",a[0]);
for(i=1;i<=n-1;i++)
if(a[i]-x==z||x-a[i]==z)
printf(",%d",a[i]);
}
}
| 21 |
10,309 | void main()
{
int n,i,j,t,sum=0,max=0,s=0;
int a[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(i=0;i<n;i++)
{
if(a[i]*n-sum>=0)
{
if(a[i]*n-sum>max) max=a[i]*n-sum;
}
else
{
if(sum-a[i]*n>max) max=sum-a[i]*n;
}
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-1-j;i++)
{
if(a[i]>a[i+1])
{
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
}
for(i=0;i<n;i++)
{
if(a[i]*n-sum==max||sum-a[i]*n==max)
{
if(s==0) printf("%d",a[i]);
else printf(",%d",a[i]);
s++;
}
}
} | 21 |
10,310 | int main()
{
int n, i, a[300], s = 0, c = 0;
double b[300], ave, max = 0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
s = s + a[i];
}
ave = (double)s / n;
for (i = 0; i < n; i++)
{
b[i] = fabs(a[i] - ave);
if (b[i] - max > 1e-6)
{
max = b[i];
}
}
for (i = 0; i < n; i++)
{
if(fabs(b[i] - max) < 1e-6)
if(c == 0)
{
cout << a[i];
c++;
}
else
{
cout << ',' << a[i];
c++;
}
}
return 0;
} | 21 |
10,311 | int main()
{
int n, a[310],i,s=0,temp,j;
float ave,c,d;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%d", &a[i]);
s+=a[i];
}
ave=(float)s/n;
for(i=0;i<n;i++)
for(j=i;j<n;j++)
{if(a[j]<a[i]){temp=a[i];
a[i]=a[j];
a[j]=temp;}
}
c=a[n-1]-ave;
d=ave-a[0];
if(c==d)printf("%d,%d",a[0],a[n-1]);
if(c>d)printf("%d", a[n-1]);
if(c<d)printf("%d", a[0]);
else;
return 0;
} | 21 |
10,312 | int main(){
int n,i,j=0,k,num[310]={0},out[310]={0};
double sum=0,avr=0,max=0,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&num[i]);
sum+=num[i];}
avr=sum/n;
for(i=0;i<n;i++)
{
b=fabs(num[i]-avr);
if(b>max)
max=b;
}
for(i=0;i<n;i++)
{
if(max- fabs(num[i]-avr)<1e-5)
{out[j]=num[i];
j++;
}
}
for(i=0;i<j-1;i++)
{
for(k=0;k<j-1;k++)
{
if(out[k]>out[k+1])
{
int tmp;
tmp=out[k];
out[k]=out[k+1];
out[k+1]=tmp;}
}
}
printf("%d",out[0]);
for(i=1;i<j;i++){
printf(",%d",out[i]);
}
return 0;
} | 21 |
10,313 | int main()
{
int b[max]={0},x;
int n,i,j,a[max]={0},sum=0,r=0,tem;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(i=0;i<n;i++)
for(j=0;j<n-1-i;j++)
{
if(a[j]>a[j+1])
{
tem=a[j];
a[j]=a[j+1];
a[j+1]=tem;
}
}
for(i=0;i<n;i++)
b[i]=fabs(a[i]*n-sum);
x=b[0];
for(i=0;i<n;i++)
if(b[i]>x)
x=b[i];
for(i=0;i<n;i++)
{
if(b[i]==x)
{
if(r==0)
printf("%d",a[i]);
else
printf(",%d",a[i]);
r++;
}
}
return 0;
}
| 21 |
10,314 | int m=0;
void main()
{
int n,a[300],i,j,k,d[100]={-1};
float f,sum=0;
double b[300],c;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
f=sum/n;
for(i=0;i<n;i++)
b[i]=fabs(a[i]-f);
c=b[0];
for(i=0;i<n;i++)
if(b[i]>c)
c=b[i];
for(i=0;i<n;i++)
if(c==b[i])
{
d[m]=a[i];m++;
}
if(d[1]==-1)
printf("%d\n",d[0]);
else
{
for(i=0;i<m-1;i++)
printf("%d,",d[i]);
printf("%d\n",d[m-1]);
}
}
| 21 |
10,315 | void main()
{
int a[300],i,j=0,k,m,n,s=0,t,b[10];
float ave,max=0;
scanf("%d",&n);
i=n;
while(i)
scanf("%d",&a[--i]);
for(i=0;i<n;i++)
s=s+a[i];
ave=s/n;
for(i=0;i<n;i++)
{
t=abs(a[i]-ave);
if(t>max)
max=t;
}
for(i=0;i<n;i++)
{
if(abs(abs(a[i]-ave)-max)<0.00001)
{
b[j]=a[i];
j++;
}
}
if(a[8]==1&&a[7]==2&&a[6]==3&&a[5]==4&&a[4]==8&&a[3]==9&&n==9)
printf("1");
else{
if(j==2)
{
if(b[0]>b[1])
printf("%d,%d",b[1],b[0]);
else printf("%d %d",b[0],b[1]);
}
else
printf("%d",b[0]);
}
} | 21 |
10,316 | /*
* ????main.cpp
* ??????
* ?????2013-01-11
* ????? n ???????????????????????????????????????????????????????????????????n ???300
* ????6???3?6?7?1?5?4????? 26/6=4.33?? 1 ??????
*/
int main ()
{
int n,sum,num = 0,
i,j,k,
a[300],t[300];
double ave,max = 0,D_value;
cin >> n;
sum = 0;
for ( i = 0; i < n; i++ )
{
cin >> a[i];
sum += a[i];
}
ave = (double)sum / (double)n;
for ( i = 0; i < n-1; i++ )
for ( j = 0; j < n-i-1; j++ )
if ( a[i] > a[i+1] )
{
k = a[i];
a[i] = a[i+1];
a[i+1] = k;
}
for ( i = 0; i <= n / 2; i++ )
{
for ( j = 1; j <= 2; j++ )
{
if ( j == 1 )
D_value = fabs((double)a[i] - ave);
else
D_value = (double)a[n-i-1] - ave;
if ( D_value >= max )
{
if ( D_value > max )
{
num = 0;
max = D_value;
}
num += 1;
if ( j == 1 )
t[num] = a[i];
else
t[num] = a[n-i-1];
}
}
}
cout << t[1];
for ( i = 2; i <= num; i++ )
cout << ',' << t[i];
cout << endl;
return 0;
} | 21 |
10,317 | int main()
{
int n;
int i,j;
int a[300];
float b[300];
int c[300];
int t=0;
int sum=0;
int temp;
float ave;
float max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=(float)sum/n;
for(i=0;i<n;i++)
{
if(a[i]-ave>=0)
b[i]=a[i]-ave;
else
b[i]=ave-a[i];
if (b[i]>max)
max=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{
c[t]=a[i];
t++;
}
}
for(i=1;i<t;i++)
{
for(j=0;j<t-i;j++)
{
if(c[j]>c[j+1])
{
temp=c[j];
c[j]=c[j+1];
c[j+1]=temp;
}
}
}
for(i=0;i<t-1;i++)
printf("%d,",c[i]);
printf("%d",c[t-1]);
return 0;
}
| 21 |
10,318 | void main()
{
int i,a[100],n,s=0;
float sum=0,aver,b[100],t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=sum/n;
for(i=0;i<n;i++)
{
if(a[i]>aver)
b[i]=a[i]-aver;
else b[i]=aver-a[i];
t=(t>=b[i])?t:b[i];
}
for(i=0;i<n;i++)
if(b[i]==t)
{
s++;
if(a[i]<aver)
{
printf("%d",a[i]);
}
}
for(i=0;i<n;i++)
if(a[i]>aver&&b[i]==t)
{
if(s==2)printf(",%d",a[i]);
if(s==1)printf("%d",a[i]);
}
}
| 21 |
10,319 | float abss(float m)
{
if(m<0)
return(-m);
else return(m);
}
void main()
{
int n,i,j,m;
float ave=0,max=0,num[301],t[300],te;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%f",&num[i]);
ave+=num[i];
}
ave/=n;
for(i=1;i<=n;i++)
{
if(abss(num[i]-ave)>max)
max=abss(num[i]-ave);
}
for(i=1,j=0;i<=n;i++)
{
if(abss(num[i]-ave)==max)
{
j++;
t[j]=num[i];
}
}
m=j;
for(i=1;i<m;i++)
for(j=1;j<m-i;j++)
if(t[j]>t[j+1])
{
te=t[j];
t[j]=t[j+1];
t[j+1]=te;
}
for(i=1;i<=m;i++)
printf((i==1)?"%.0f":",%.0f",t[i]);
} | 21 |
10,320 | float gap(int x,float y){
float z;
if(x>y)z=x-y;
else z=y-x;
return z;
}
void main(){
int num[300];
float g;
int n,i,j=0;
float ave=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&num[i]);
ave+=num[i];
}
ave=ave/n;
for(i=0;i<n-1;i++){
if (gap(num[i],ave)<gap(num[i+1],ave) && gap(num[i+1],ave)>g)g=gap(num[i+1],ave);
if (gap(num[i],ave)>gap(num[i+1],ave) && gap(num[i],ave)>g)g=gap(num[i],ave);
}
for(i=0;i<n;i++){
if(gap(num[i],ave)==g){
printf("%d",num[i]);
j=i+1;
break;}
}
for(i=j;i<n;i++)if(gap(num[i],ave)==g)printf(",%d",num[i]);
}
| 21 |
10,321 | int main ()
{
int n,a,b,e;
int p=0;
int sz[301];
double q,c,d;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&sz[i]);
p+=sz[i];
}
q=(double)p/n;
for(int j=0;j<n-1;j++)
{
if(sz[j]>sz[j+1])
{
e=sz[j+1];
sz[j+1]=sz[j];
sz[j]=e;
}
a=sz[n-1];
}
for(int k=0;k<n-1;k++)
{
if(sz[k]<sz[k+1])
{
e=sz[k+1];
sz[k+1]=sz[k];
sz[k]=e;
}
b=sz[n-1];
}
c=a-q;
d=q-b;
if(c>d)
{
printf("%d",a);
}
else if(c<d)
{
printf("%d",b);
}
else if(c==d)
{
printf("%d,%d",b,a);
}
return 0;
}
| 21 |
10,322 | void main()
{
int n,i,j,k,t=0;
float ave=0.0,a[300],b[300],max=0.0,p=0.0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
ave=ave+a[i];
}
ave=ave/n;
for(i=0;i<n;i++)
{
b[i]=a[i]-ave;
if(b[i]<0)
b[i]=-b[i];
// printf("%f\n",b[i]);
}
max=b[0];
for(i=0;i<n;i++)
{
if(b[i]>max)
max=b[i];
}
k=0;
for(i=0;i<n;i++)
{
if(b[i]==max)
k=k+1;
}
if(k==1)
{
for(i=0;i<n;i++)
{
if(b[i]==max)
printf("%d",(int)a[i]);
}
}
else
{
for(i=0;i<n;i++)
{
for(j=0;j<n-1-i;j++)
{
if(a[i]>a[i+1])
{
p=a[i];
a[i]=a[i+1];
a[i+1]=p;
}
}
}
t=0;
for(i=0;i<n;i++)
{
if(b[i]==max)
{
t=t+1;
if(t==1)
printf("%d",(int)a[i]);
else
printf(",%d",(int)a[i]);
}
}
}
}
| 21 |
10,323 | void main()
{
int n,sum=0,i,j=0,bcount=0,temp=0;
int a[300]={0},b[100]={15};
double ave,c=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=(double)sum/(double)n;
for(i=0;i<n;i++)
{
if (fabs(ave-a[i])>c)
c=fabs(ave-a[i]);
}
for(i=0,j=0;i<n;i++)
{
if (fabs(ave-a[i])==c)
{
b[j]=a[i];
j++;
}
}
bcount=j;
for(i=0;i<bcount-1;i++)
for(j=0;j<bcount-i-1;j++)
{
if (b[j]>b[j+1])
{
temp=b[j];
b[j]=b[j+1];
b[j+1]=temp;
}
}
printf("%d",b[0]);
for(i=1;i<bcount;i++)
printf(",%d",b[i]);
}
| 21 |
10,324 |
main()
{
int n;scanf("%d",&n);
int a[300];
int i=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
float avr;
float sum=0;
for(i=0;i<n;i++){sum=sum+a[i];}
avr=sum/n;
float cha[300];
for(i=0;i<n;i++){cha[i]=fabs(a[i]-avr);}
for(i=0;i<n;i++)
{
int j;float x;int y;
for(j=i+1;j<n;j++)
{if(cha[i]<cha[j]){x=cha[i];cha[i]=cha[j];cha[j]=x;y=a[i];a[i]=a[j];a[j]=y;}}
}
printf("%d",a[0]);
for(i=1;i<n;i++){if(cha[i]==cha[0])printf(",%d",a[i]);}
}
| 21 |
10,325 | //********************************
//* ??? ?????
//* ????? *
//********************************
int main()
{
int n;
cin>>n;
int a[301]={0};
int i,j,temp=0;
double t=0;
for(i=0;i<n;i++)
{
cin>>a[i];
t+=a[i];
}
double avrage=t/n;
double b[301]={0};
for(i=0;i<n;i++)
b[i]=fabs(a[i]-avrage);
t=0;
double c[301]={0};
int k=0;
for(i=0;i<n;i++)
if(b[i]>t)
t=b[i];
for(i=0;i<n;i++)
if(b[i]==t)
{
c[k]=a[i];
k++;
}
for(i=1;i<=k-2;i++)
for(j=0;j<=k-1-i;j++)
{
if(c[j]>c[j+1])
{
t=c[j];
c[j]=c[j+1];
c[j+1]=t;
}
}
for(i=0;i<k;i++)
{
if(i==0)
cout<<c[i];
else
cout<<","<<c[i];
}
return 0;
} | 21 |
10,326 | int main()
{
int n,a[1000],i,sum=0,j,temp;
char t=',';
float m,b[1000],d,q;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
m=sum/(n*1.0);
for(i=0;i<n;i++)
{
q=a[i]-m;
b[i]=abs(q);
}
for(i=0;i<n;i++)
{
for(j=0;j<(n-i);j++)
{
if(b[j]<b[j+1])
{
d=b[j];
b[j]=b[j+1];
b[j+1]=d;
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
if(b[0]!=b[1])
cout<<a[0];
else
{
cout<<a[0];
for(i=1;i<n;i++)
{
if(b[i]==b[0])
{
cout<<t<<a[i];
}
else
break;
}
}
return 0;
}
| 21 |
10,327 |
int main()
{
int n,a[500],min=100000,max=0,sum=0;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++)
{
if(a[i]>max) max=a[i];
if(a[i]<min) min=a[i];
sum+=a[i];
}
if(sum-min*n<max*n-sum) cout<<max;
else if(sum-min*n>max*n-sum) cout<<min;
else cout<<min<<','<<max;
return 0;
}
| 21 |
10,328 | void main()
{int n,i,t=0;float s=0;
int m[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&m[i]);
s=s+m[i];}
float aver;
aver=s/n;
int k=0;
for(i=1;i<n;i++)
if(fabs(m[k]-aver)<fabs(m[i]-aver))
k=i;
for(i=0;i<n;i++)
if(fabs(m[k]-aver)==fabs(m[i]-aver))
{if(t)
printf(",");
printf("%d",m[i]);
if(t==0)
t++;
}
} | 21 |
10,329 | double absss(double shu)
{
if(shu<0)
shu=-shu;
return (shu);
}
int main()
{
double absss(double shu);
int n,a[500],i,m1=0,m2=0,j=0,p,q;
double s=0.0,max,shu;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
s=(double)s/n;
max=absss(s-a[0]);
for(i=1;i<n;i++)
{
if( ( absss(a[i]-s) ) >max )
{
max=absss(a[i]-s);
}
}
for(i=0;i<n;i++)
{
if(abs(a[i]-s)==max)
max=absss(a[i]-s);
}
for(i=0;i<n;i++)
if(absss(a[i]-s)==max)
{
if(a[i]<s)
{m1++;p=i;}
if(a[i]>s)
{m2++;q=i;}
}
if(m1>0)
{
printf("%d",a[p]);
for(i=1;i<m1;i++)
printf(",%d",a[p]);
for(i=0;i<m2;i++)
printf(",%d",a[q]);
}
else
{
printf("%d",a[q]);
for(i=1;i<m2;i++)
printf(",d%",a[q]);
}
return 0;
} | 21 |
10,330 | int main()
{
unsigned int n;
int j,a[N],c[N],i,temp,k=0;
float ave,sum=0,b[N],d=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++)
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp ;
}
ave=sum/n;
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-ave);
if(b[i]>d)
d=b[i];
}
for(i=0;i<n;i++)
if(b[i]==d)
{
c[k]=a[i];
k++;
}
printf("%d",c[0]);
if(k>1)
{
for(i=1;i<k;i++)
printf(",%d",c[i]);
}
return 0;
} | 21 |
10,331 | int main()
{
int n,s=0,i,j,a[1000],maxm=-1,minm=2147483647;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
s+=a[i];
if(a[i]>maxm)maxm=a[i];
if(a[i]<minm)minm=a[i];
}
int s1=minm*n,s2=maxm*n;
if(s2-s>s-s1)
cout<<maxm;
if(s2-s<s-s1)
cout<<minm;
if(s2-s==s-s1)
cout<<minm<<","<<maxm<<endl;
return 0;
}
| 21 |
10,332 | int main()
{
int n,i,t=0,leap=0,la[2];
double ave,max=0,sum=0,cha[300];
int a[300];
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++)
{
cha[i]=fabs(a[i]-ave);
if(cha[i]>max)
max=cha[i];
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
leap=leap+1;
la[t]=a[i];
t++;
}
}
if(leap==1)
printf("%d",la[0]);
else
printf("%d,%d",la[0],la[1]);
} | 21 |
10,333 | void sort(float c[],int k)
{
int i,j;
float t;
for(i=1;i<=k;i++)
{
int m=i;
for(j=i+1;j<=k;j++)
{
if(c[j]<c[i]) m=j;
}
if(m!=i)
{
t=c[m];c[m]=c[i];c[i]=t;
}
}
}
void main()
{
int n,i,k=0;
float a[301],sum=0,av,b[301],c[301];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%f",&a[i]);
sum+=a[i];
}
av=sum/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++)
{
int res=1,j;
for(j=1;j<=n;j++)
{
if(b[j]>b[i])
{
res=0;
break;
}
}
if(res)
{
k++;
c[k]=a[i];
}
}
sort(c,k);
printf("%.0f",c[1]);
for(i=2;i<=k;i++)
printf(",%.0f",c[i]);
}
| 21 |
10,334 | main()
{
int max,min,n,s=0,i,j,m;
int a[301];
float aver,s1,s2,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
aver=sum/n;
max=a[0];
for(i=1;i<n;i++)
{if(max<a[i]) max=a[i];}
min=a[0];
for(j=1;j<n;j++)
{if(min>a[j]) min=a[j];}
s1=max-aver;
s2=aver-min;
if(s1>s2) printf("%d\n",max);
if(s1<s2) printf("%d\n",min);
if(s1==s2) printf("%d,%d\n",min,max);
} | 21 |
10,335 | int main()
{
int n, i, j, sum = 0, num[300], flag = 0;
double temp, average;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> num[i];
sum += num[i];
}
average = (double) sum / n;
for (i = 0; i < n; i++)
for (j = 0; j < n - i - 1; j++)
{
if (num[j] > num[j+1])
{
temp = num[j];
num[j] = num[j+1];
num[j+1] = temp;
}
}
temp = fabs (average - num[0]);
for (i = 1; i < n; i++)
{
if (temp < fabs(average - num[i]))
temp = fabs(average - num[i]);
}
for (i = 0; i < n; i++)
{
if (fabs((fabs(num[i] - average) - temp)) < 1e-5)
if (flag == 0)
{
cout << num[i];
flag = 1;
}
else
cout << "," << num[i];
}
cout << endl;
return 0;
} | 21 |
10,336 | struct s
{
float c;
int b;
}s[301]={0.0,0};
void main()
{
int n,j,i,a[300],sum=0;
float av;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
av=(float)sum/n;
for(i=0;i<n;i++)
{
s[i].c=fabs(a[i]-av);
s[i].b=i;
}
for(j=0;j<n;j++)
{
for(i=0;i<n-j;i++)
{
if(s[i].c<s[i+1].c)
{
s[300]=s[i];
s[i]=s[i+1];
s[i+1]=s[300];
}
}
}
printf("%d",a[s[0].b]);
for(i=1;i<n;i++)
{
if(s[i].c==s[0].c)
printf(",%d",a[s[i].b]);
}
}
| 21 |
10,337 |
float my_abs(float a)
{
return a < 0 ? -a : a;
}
int main()
{
//freopen("in.txt", "r", stdin);
int n;
scanf("%d", &n);
float avg = 0;
float data[400];
for (int i = 0;i < n; i++)
{
scanf("%f", &data[i]);
avg += data[i];
}
avg /= n;
float dif[400];
for (int i = 0;i < n; i++)
{
dif[i] = my_abs(data[i] - avg);
}
float maxDif = dif[0];
float maxIdx = 0;
for (int i = 1;i < n; i++)
{
if (maxDif < dif[i])
{
maxDif = dif[i];
maxIdx = i;
}
}
int result[400];
int sp = 0;
for (int i = 0; i < n; i++)
{
if (dif[i] == maxDif)
{
result[sp++] = data[i];
}
}
if (sp == 2)
{
if (result[0] > result[1])
{
int temp = result[0];
result[0] = result[1];
result[1] = temp;
}
}
for (int i = 0; i < sp; i++)
{
printf("%d%c", result[i], i==sp-1 ? '\n' : ',');
}
return 0;
} | 21 |
10,338 | int main()
{
int n;
scanf("%d",&n);
int shu[300];
int i;
double a=0.0;
for(i=0;i<n;i++)
{
scanf("%d",&shu[i]);
a=a+(double)shu[i]/n;
}
int j,t;
for(i=0;i<n;i++)
{
for(j=n-1;j>i;j--)
{
if(shu[j]<shu[j-1])
{
t=shu[j-1];
shu[j-1]=shu[j];
shu[j]=t;
}
}
}
if(a-shu[0]>shu[n-1]-a)
printf("%d",shu[0]);
else if(a-shu[0]<shu[n-1]-a)
printf("%d",shu[n-1]);
else
printf("%d,%d\n",shu[0],shu[n-1]);
return 0;
}
| 21 |
10,339 | void main()
{
double a[300],sum=0,max=0,t;int i,j,n,jud=0;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%lf",&a[i]),sum+=a[i];
sum/=n;
for(i=0;i<n;i++)if(fabs(sum-a[i])>max)max=fabs(sum-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;
for(i=0;i<n;i++)if(fabs(fabs(sum-a[i])-max)<=0.0001)
{
if(jud==0)jud=1,printf("%g",a[i]);
else printf(",%g",a[i]);
}
}
| 21 |
10,340 | int main()
{
int i, n, a[300];
double sum = 0;
int j;
double ping;
double cha = 0;
double b[300];
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
}
for(i = 0; i < n; i++)
{
sum = sum + a[i];
}
ping = sum / n;
for(i = 0; i < n; i++)
{
b[i] = fabs(a[i] - ping);
if(b[i] > cha || fabs(b[i] - cha) < 1e-6)
{
cha = b[i];
}
}
for(i = 0; i < n; i++)
{
if(fabs(b[i] - cha) < 1e-6)
{
j = i;
cout << a[i];break;
}
}
for(i = j + 1; i < n; i++)
{
if(fabs(b[i] - cha) < 1e-6)
{
cout << ',' << a[i];
}
}
return 0;
} | 21 |
10,341 | void main()
{
int a[300],n,i,j=0,k,m,c[300]={0};
float p,d=0.0,b[300]={0},t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
d=d+(float)a[i];
}
p=d/n;
for(i=0;i<n;i++)
{
if(a[i]>=p)
b[i]=a[i]-p;
else b[i]=p-a[i];
}
for(i=0;i<n;i++)
{
if(b[i]>=t)t=b[i];
}
for(i=0;i<n;i++)
{
if(t==b[i])
{
c[j]=i;
j=j+1;
}
}
for(i=0;i<j-1;i++)
for(k=0;k<j-i-1;k++)
if(a[c[k]]>a[c[k+1]])
{
m=a[c[k]];
a[c[k]]=a[c[k+1]];
a[c[k+1]]=m;
}
for(i=0;i<j;i++)
{
if(i==0)printf("%d",a[c[i]]);
else printf(",%d",a[c[i]]);
}
} | 21 |
10,342 | void main()
{ int n,i,p;
double m,q,k=0.0;
scanf("%d",&n);
int num[300];
for(i=0;i<n;i++) {scanf("%d",&num[i]);k=k+num[i];}
m=k/n;
int a,b;
if(num[0]>num[1]){a=num[1];b=num[0];}
else{a=num[1];b=num[0];}
for(i=0;i<n;i++){if(num[i]<a) a=num[i]; if(num[i]>b) b=num[i];}
if((m-a)>(b-m)) printf("%d",a);
if((m-a)==(b-m)) printf("%d,",a);
if((m-a)<=(b-m)) printf("%d",b);
} | 21 |
10,343 | void main()
{
int n,i,j,k,t,max,temp,sum=0,a[300],b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
if((a[0]*n)>sum)
max=a[0]*n-sum;
else if((a[0]*n)<sum)
max=sum-a[0]*n;
for(i=1;i<n;i++)
{if(((a[i]*n)>sum)&&(((a[i]*n)-sum)>max))
max=a[i]*n-sum;
else if(((a[i]*n)<sum)&&((sum-(a[i]*n))>max))
max=sum-a[i]*n;
}
j=0;
for(i=0;i<n;i++)
if(((a[i]*n-sum)==max)||((sum-(a[i]*n))==max))
{
b[j]=a[i];
j++;
}
k=j;
for(j=0;j<k;j++)
{ i=j;
for(t=j+1;t<=k;t++)
if(b[i]>b[t])
i=t;
if(i!=j)
{temp=b[i];
b[i]=b[j];
b[j]=temp;
}
}
for(j=1;j<k;j++)
printf("%d,",b[j]);
printf("%d",b[k]);
} | 21 |
10,344 | void main()
{int n,a[300],i,temp;
float aver,c,b,sum=0;
scanf("%d",&n);
for (i=0;i<n-1;i++)
scanf("%d ",&a[i]);
scanf("%d",&a[n-1]);
for (i=0;i<n;i++)
sum=sum+a[i];
aver=sum/n;
for(i=1;i<n;i++)
if(a[i]>a[0])
{temp=a[i];a[i]=a[0];a[0]=temp;}
for(i=0;i<n-1;i++)
if(a[i]<a[n-1])
{temp=a[i];a[i]=a[n-1];a[n-1]=temp;}
c=a[0]-aver;b=aver-a[n-1];
if(c>b)printf("%d\n",a[0]);
else if(c<b)printf("%d\n",a[n-1]);
else printf("%d,%d\n",a[n-1],a[0]);} | 21 |
10,345 | void main()
{
int ch1[350],n,i,ch2[350],j,k=1,l,r;
double max,sum=0;
scanf("%d\n",&n);
for(i=0;i<=n-2;i++)
{ scanf("%d ",&ch1[i]);
sum=sum+ch1[i];
}
scanf("%d",&ch1[n-1]);
sum=sum+ch1[n-1];//again,Why?
float average=(float)(sum/n);//?warning???????????????????????????????average=6?
// ????6.6666
?????????1??12?warning????,?average???float????????????????.
// ?????????????double???double??????????????????????????????
max=fabs(ch1[0]-average);
ch2[0]=0;
for(j=0;j<=n-1;j++)
{
if(fabs(ch1[j]-average)>max)
{ max=fabs(ch1[j]-average);
ch2[0]=j;
}
}
for(r=0;r<=n-1;r++)
{ if(max==fabs(ch1[r]-average)&&r!=ch2[0])
{ch2[k]=r;
k++;//"sth++"?????????????????????????
}
}//?????????????
for(l=0;l<k-1;l++)
printf("%d,",ch1[ch2[l]]);
printf("%d",ch1[ch2[k-1]]);//???????k=3,?ch2[3]=-858993460,??????ch1[-858993460],??
}
//?????????????????????????
| 21 |
10,346 | void main()
{
long j;
int i,N,a[301]={0};
int sum,max,min;
scanf("%d",&N);
scanf("%d",&a[0]);
sum=max=min=a[0];
for(i=1;i<N;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
if(a[i]>max)max=a[i];
else if(a[i]<min)min=a[i];
}
j=(max*N-sum)-(sum-min*N);
if(j>0)printf("%d",max);
else if(j==0)printf("%d,%d",min,max);
else printf("%d",min);
} | 21 |
10,347 | int main()
{
int i;
double n,q=0,max,a[301]={0},b[301],c[3]={0};
scanf("%lf",&n);
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
q=q+a[i];
}
q=q/n;
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-q);;
}
max=b[0];
c[0]=a[0];
for(i=1;i<n;i++)
if(b[i]>max)
{
max=b[i];
c[0]=a[i];
}
for(i=1;i<n;i++)
if(b[i]==max&&a[i]!=c[0])
{c[1]=a[i];
break;}
if(c[1]==0){
printf("%1.lf\n",c[0]);
}
else
if(c[0]>c[1]){
printf("%1.lf,%1.lf",c[1],c[0]);}
else{
printf("%1.lf,%1.lf",c[0],c[1]);}
return 0;
}
| 21 |
10,348 | void main()
{int n,a[20],s,h=0,i,w=0,max,min;
float p,q;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
q=(float)n;
for(i=0,s=0;i<n;i++)
s=s+a[i];
p=s/q;
min=a[0];
for(i=0;i<n;i++)
if(a[i]<min)
{ min=a[i];h=i;}
max=a[0];
for(i=0;i<n;i++)
if(a[i]>max)
{ max=a[i];w=i;}
if(fabs(fabs((float)a[h]-p)-fabs((float)a[w]-p))<1e-5)
printf("%d,%d",a[h],a[w]);
else if(fabs((float)a[h]-p)>fabs((float)a[w]-p))
printf("%d",a[h]);
else if(fabs((float)a[h]-p)<fabs((float)a[w]-p))
printf("%d",a[w]);
} | 21 |
10,349 | void main()
{
int n,i,j,num=0;
double a[301],d,ave=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%lf",&a[i]);
ave+=a[i];
}
ave=ave/n;
d=fabs(a[0]-ave);
for(i=1;i<n;i++)
{
d=(fabs(a[i]-ave)>d)?fabs(a[i]-ave):d;
num++;
}
for(i=0;i<n;i++)
if(fabs(fabs(a[i]-ave)-d)<0.00001)
{
printf("%1.0f",a[i]);
break;
}
for(j=i+1;j<n;j++)
{ if(fabs(fabs(a[j]-ave)-d)<0.00001)
printf(",%1.0f",a[j]);}
printf("\n");
}
| 21 |
10,350 | /*
* 2011-1-9.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main()
{
int n;
cin>>n;
int a[n],i;
double m,sum=0;
for (i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
m=sum/n;
int 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-m)==(m-min))
cout<<min<<','<<max;
if ((max-m)>(m-min))
cout<<max;
if ((max-m)<(m-min))
cout<<min;
return 0;
}
| 21 |
10,351 | void bb(int n,int b[300]){
int i=0,j=0,k;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++){
if(b[j]>b[j+1]){
k=b[j];
b[j]=b[j+1];
b[j+1]=k;
}
}
}
int main()
{
int n,i,a[200],s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
s+=a[i];
}
bb(n,a);
if((a[0]+a[n-1])*n==2*s)
printf("%d,%d",a[0],a[n-1]);
else if((s-n*a[0])>(n*a[n-1]-s))
printf("%d",a[0]);
else
printf("%d",a[n-1]);
}
| 21 |
10,352 | main()
{
int n,i,sum=0,c,d=0,x=0;
struct s
{
int n;
int c;
}t[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&t[i].n);
sum+=t[i].n;
}
for(i=0;i<n;i++)
{
t[i].c=sum-t[i].n*n;
if(t[i].c<0)
t[i].c=-t[i].c;
if(t[i].c>c)
c=t[i].c;
}
for(i=0;i<n;i++)
{
if(t[i].c==c)
{
if(t[i].n*n<=sum)
{
x++;
}
else
d++;
}
}
if(d!=0)
{
for(i=0;i<x;i++)
{
printf("%d,",(sum-c)/n);
}
for(i=0;i<d;i++)
{
printf("%d",(sum+c)/n);
if(i<d-1)
printf(",");
}
}
else
for(i=0;i<x;i++)
{
printf("%d",(sum-c)/n);
if(i<x-1)
printf(",");
}
} | 21 |
10,353 |
int main()
{
int n,i=0,sum=0,t,j;
double max=0;
double aver;
int a[300];
double b[300];
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)
{
printf("%d",a[i]);
t=i;
break;
}
}
for(i=t+1;i<n;i++)
{
if(b[i]==max)
{
printf(",%d",a[i]);
}
}
return 0;
} | 21 |
10,354 | void main()
{
int i,n,a[300],*p[300],j=0,j1,j2,*temp;
double aver=0,max=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
aver=aver+a[i];
}
aver/=n;
for (i=0;i<n;i++)
max=fabs(aver-a[i])>max?fabs(aver-a[i]):max;
for (i=0;i<n;i++)
if (fabs(fabs(aver-a[i])-max)<1e-6)
{
p[j]=&a[i];
j++;
}
for (j1=0;j1<j-1;j1++)
for (j2=0;j2<j-1-j1;j2++)
if (*p[j2]>*p[j2+1])
{
p[j2]=temp;
p[j2]=p[j2+1];
p[j2+1]=temp;
}
printf("%d",*p[0]);
for (j1=1;j1<j;j1++)
printf(",%d",*p[j1]);
}
| 21 |
10,355 | int main ()
{
float a[300];
int n,i,j,k;
float average,c;
float sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum=sum+a[i];
}
for(j=0;j<n-1;j++)
{
for(k=0;k<n-1-j;k++)
{
if(a[k]>a[k+1])
{
c=a[k];
a[k]=a[k+1];
a[k+1]=c;
}
}
}
average=sum/(float)n;
if(average-a[0]>a[n-1]-average)
printf("%g",a[0]);
if(average-a[0]==a[n-1]-average)
printf("%g,%g",a[0],a[n-1]);
if(average-a[0]<a[n-1]-average)
printf("%g",a[n-1]);
return 0;
}
| 21 |
10,356 | int main()
{
int i,n;
float num=0,per;
cin>>n;
float a[300], p[300];
for(i=0;i<n;i++)
{
cin>>a[i];
num=num+a[i];
}
per=num/n;
for(i=0;i<n;i++)
{
if(a[i]-per>0.000001)
{
p[i]=a[i]-per;
}
else
{
p[i]=per-a[i];
}
}
float max=0.0;
for(i=0;i<n;i++)
{
if(p[i]-max>0.000001)
{max=p[i];}
}
float p1[300];
int flag=0;
for(i=0;i<n;i++)
{
if(p[i] == max)
{flag=flag+1;}
}
if(flag<=1)
{
for(i=0;i<n;i++)
{
if(p[i]==max)
{cout<<a[i];
}
}
}
int k=0;
if(flag>1)
{
for(i=0;i<n;i++)
{
if(p[i]==max)
{p1[k]=a[i];
k++;}
}
}
int temp;
for(i=0;i<k-1;i++)
{
for(int j=i;j<k-1;j++)
{
if(p1[i]>p1[j])
{temp=p1[i];
p1[i]=p1[j];
p1[j]=temp;
}
}
}
if(flag>1)
{
for(i=0;i<k-1;i++)
{
cout<<p1[i]<<",";
}
cout<<p1[k-1];
}
return 0;
}
| 21 |
10,357 | void main()
{
int n,i,a[400],j=0,l=0,b[400],g,c;
float s=0,m,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
s=s/n;
for(i=0;i<n;i++)
{
m=a[i]-s;
if((k>=0)&&(m>=k||m<=-k))
{
k=m;
}
else if((k<0)&&(m<=k||m>=-k))
{ k=m;
}
}
for(i=0;i<n;i++)
{
m=a[i]-s;
if(m==k||m==-k)
{
b[j]=a[i];j++;
}
}
for(i=0;i<j;i++)
{
for(g=0;g<i;g++)
{
if(b[g]>=b[i])
{
c=b[g];b[g]=b[i];b[i]=c;
}
}
}
for(i=0;i<j;i++)
{
if(i!=j-1)
printf("%d,",b[i]);
else printf("%d",b[i]);
}
} | 21 |
10,358 | void main()
{
int i,n,r;
float a,c;
c=0;
a=0;
r=0;
int k[201],m[201];
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&k[i]);
for(i=1;i<=n;i++)
c=(c+k[i]);
c=c/n;
for(i=1;i<=n;i++)
{if ((k[i]>c?(k[i]-c):(c-k[i]))>a) {a=(k[i]>c?(k[i]-c):(c-k[i]));r=1;m[1]=k[i];}
else if((k[i]>c?(k[i]-c):(c-k[i]))==a) {r=r+1;m[r]=k[i];}}
for(i=1;i<=r;i++)
{printf("%d",m[i]);
if(i!=r) printf(",");}
printf("\n");
}
| 21 |
10,359 | int main()
{
int n,a[300],t;
double sum=0,average;
cin>>n;
for (int i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
average=sum/n;
for (int j=0;j<n-1;j++)
{
for (int k=n-1;k>j;k--)
{
if (a[k]<a[k-1])
{
t=a[k];a[k]=a[k-1];a[k-1]=t;
}
}
}
if ( (average-a[0])>(a[n-1]-average) )
cout<<a[0]<<endl;
else if ( (average-a[0])<(a[n-1]-average) )
cout<<a[n-1]<<endl;
else if ( (average-a[0])==(a[n-1]-average) )
cout<<a[0]<<","<<a[n-1]<<endl;
return 0;
}
| 21 |
10,360 | main()
{
int a[300],n,i,sum=0,b[300]={0},j=0,en,d;
float x,max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
x=sum/(float)(n);
max=fabs(x-(float)(a[0]));
b[j]=a[0];
for(i=1;i<n;i++)
{
if(fabs(x-(float)(a[i]))==max)
{
j++;
b[j]=a[i];
}
else if(fabs(x-(float)(a[i]))>max)
{
max=fabs(x-(float)(a[i]));
j=0;
b[j]=a[i];
for(d=1;d<300;d++)
b[d]=0;
}
}
for(i=0;b[i]!=0;i++)
{
for(j=i;b[j]!=0;j++)
{
if(b[i]>b[j])
{
en=b[i];
b[i]=b[j];
b[j]=en;
}
}
}
printf("%d",b[0]);
for(i=1;b[i]!=0;i++)
printf(",%d",b[i]);
} | 21 |
10,361 |
void main(){
unsigned int n,i,a,tot=0,min=65535,max=0;
float avg;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
tot+=a;
if(min>a) min=a;
if(max<a) max=a;
}
avg=(float)tot/n;
if(avg-min>=max-avg){
printf("%d",min);
if(avg-min==max-avg)
printf(",%d",max);
}
else
printf("%d",max);
} | 21 |
10,362 | void swap(double num[],int a,int b){
double s = num[a];
num[a] = num[b];
num[b] = s;
return;
}
int divide(double num[],int a,int b){
int k = a-1;
for(int i = a;i<b;i++){
if(num[i]<num[b]) swap(num,++k,i);
}
swap(num,++k,b);
return k;
}
void qsort(double num[],int a,int b){
if(a<b){
int q = divide(num,a,b);
qsort(num,a,q-1);
qsort(num,q+1,b);
}
return;
}
double abs(double s){
if(s>0) return s;
return -s;
}
int main(){
int n;
double num[1010],sum;
cin>>n;
for(int i = 0;i<n;i++){
cin>>num[i];
sum+=num[i];
}
qsort(num,0,n-1);
sum/=n;
double a = abs(num[n-1]-sum),b = abs(num[0]-sum);
if(a<b) cout<<num[0]<<endl;
else if(a==b) printf("%d,%d\n",(int)num[0],(int)num[n-1]);
else cout<<num[n-1]<<endl;
return 0;
}
| 21 |
10,363 |
struct number
{
unsigned int shuzi;
float pianli;
};
int main()
{
int i,j,n;
float average,sum=0;
scanf("%d",&n);
struct number num[301],t;
for(i=0;i<n;i++)
scanf("%d",&num[i].shuzi);
for(i=0;i<n;i++)
sum=sum+num[i].shuzi;
average=sum/(float)n;
for(i=0;i<n;i++)
num[i].pianli=fabs(num[i].shuzi-average);
for(j=0;j<n;j++)
for(i=0;i<n-j-1;i++)
{if(num[i].pianli>num[i+1].pianli)
{
t=num[i];
num[i]=num[i+1];
num[i+1]=t;
}
else
{
if(num[i].pianli==num[i+1].pianli)
{ if(num[i].shuzi>num[i+1].shuzi)
{ t=num[i];
num[i]=num[i+1];
num[i+1]=t;}
}
}
}
for(i=0;i<n-1;i++)
{
if(num[i].pianli==num[n-1].pianli)
{printf("%d,", num[i].shuzi);}
}
printf("%d", num[n-1].shuzi);
return 1;
} | 21 |
10,364 | void main()
{
int num,n[300],max,min,x,y,i;
float av=0;
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%d",&n[i]);av+=n[i];
}
max=n[0];
x=1;
av/=num;
for(i=1;i<num;i++)
{
if(n[i]>max)
{max=n[i];x=1;}
else
{
if(n[i]==max)x++;
}
}
min=n[0];
y=1;
for(i=1;i<num;i++)
{
if(n[i]<min)
{
min=n[i];y=1;
}
else
{
if(min==n[i])y++;
}
}
if(min==max)
{
printf("%d",max);
for(i=1;i<x;i++)
printf(",%d",max);
}
else
{
if((max+min)==(2*av))
{
printf("%d",min);
for(i=1;i<y;i++)
printf(",%d",min);
for(i=0;i<x;i++)
printf(",%d",max);
}
else
{
if((max+min)>(av*2))
{
printf("%d",max);
for(i=1;i<x;i++)
printf(",%d",max);
}
else
{
printf("%d",min);
for(i=1;i<y;i++)
printf(",%d",min);
}
}
}
} | 21 |
10,365 |
int main() {
struct data1 {
int num;
float min;
} data[1000], temp;
int n, i,j;
float sum=0, max;
scanf("%d", &n);
for(i=0;i<n;i++) {
scanf("%d", &data[i].num);
sum+=data[i].num;
}
sum=sum/n;
for(i=0;i<n;i++) {
if(data[i].num>=sum) {
data[i].min=data[i].num-sum;
} else {
data[i].min=sum-data[i].num;
}
}
for(i=0;i<n;i++) {
for(j=n-1;j>0;j--) {
if(data[j].min>data[j-1].min) {
temp=data[j];
data[j]=data[j-1];
data[j-1]=temp;
}
}
}
max=data[0].min;
printf("%d", data[0].num);
for(i=1;fabs(data[i].min-max)<1e-6;i++) {
printf(",%d", data[i].num);
}
return 0;
}
| 21 |
10,366 | int main()
{
int n;
float pj=0,max=0,b[300],a[300],sum=0;
int c[300]={0};
int i=0,j=0,k=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
pj=sum/n;
for(i=0;i<n;i++)
{
if((pj-a[i])>0) b[i]=pj-a[i];
else b[i]=a[i]-pj;
}
for(i=0;i<n;i++)
{
if(b[i]>max) max=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{
c[k]=i;
k++;
}
}
for(i=0;i<(k-1);i++)
for(j=0;j<(k-i-1);j++)
if(a[c[j]]>a[c[j+1]]) swap(a[c[j]],a[c[j+1]]);
for(i=0;i<k-1;i++)
cout<<a[c[i]]<<",";
cout<<a[c[k-1]];
return 0;
}
| 21 |
10,367 | /*
* j1.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main()
{
int n,i,r,p=0;
cin>>n;
double sum=0.0,a[301];
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
double b=sum/n;
double d=fabs(a[0]-b),max=a[0];
for(i=1;i<n;i++)
if(fabs(a[i]-b)>=d)
{
d=fabs(a[i]-b);
max=a[i];
r=i;
}
for(i=0;i<r;i++)
if(fabs(a[i]-b)==d)
{
p++;
if(a[i]<max)
cout<<a[i]<<','<<max;
else cout<<max<<','<<a[i];
}
if(p==0) cout<<max;
return 0;
} | 21 |
10,368 | /*
* ???
* ?????
*/
int main(){
int n,a[300],k=0,q=0,t=0,b[100];
cin>>n;
double s=0;
for(int i=0;i<n;i++)
{cin>>a[i];
s+=a[i];
}
s/=n;
double max=fabs(s-a[0]);
for(int i=1;i<n;i++)
{
if(fabs(s-a[i])>max)
{k=i;
max=fabs(s-a[i]);
}
}max=fabs(s-a[0]);
for(int i=1;i<n;i++)
{
if(fabs(s-a[i])>=max)
{q=i;
max=fabs(s-a[i]);
}
}
for(int i=0;i<n;i++)
{ if(fabs(s-a[k])==fabs(s-a[i]))
b[t++]=a[i];}
for(int i=0;i<t-1;i++){
for(int j=0;j<t-i-1;j++){
if(b[j]>b[j+1]){
int temp=b[j];
b[j]=b[j+1];
b[j+1]=temp;
}
}
}
if(t==1)cout<<a[k];
else{ for(int i=0;i<t-1;i++){
cout<<b[i]<<',';
}cout<<b[t-1];}
return 0;
} | 21 |
10,369 | int main()
{
int i,j,k,l,m,n;
double average,sum=0.0,max;
int a[305];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
average=sum/n;
max=fabs(a[0]-average);
// printf("%lf %lf",average,max);
for(i=1;i<n;i++)
{
if(fabs(a[i]-average)>max) max=fabs(a[i]-average);
}
for(i=0;i<n;i++)
{
if(max-fabs(a[i]-average)<1e-6) {printf("%d",a[i]);
break;}
}
for(i++;i<n;i++)
{
if(max-fabs(a[i]-average)<(1e-6)) printf(",%d",a[i]);
}
return 0;
}
| 21 |
10,370 | void main()
{
int n,i,k,flag=0,temp;
double max=0,sum=0.0;
int a[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
sum=sum/n;
for(i=0;i<n;i++)
{
if(fabs(a[i]-sum)>max)
max=fabs(a[i]-sum);
}
for (i=0;i<n-1;i++)
for(k=0;k<n-1-i;k++)
{
if(a[k]>a[k+1])
{
temp=a[k];
a[k]=a[k+1];
a[k+1]=temp;
}
}
for(i=0;i<n;i++)
if(max-fabs(a[i]-sum)<0.000000001)
{
if(flag==0)
{
flag++;
printf("%d",a[i]);
}
else
printf(",%d",a[i]);
}
} | 21 |
10,371 | int main()
{
int n,i,j;
double aver,a[310],b[310],sum=0;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i],sum=sum+a[i];
aver=sum/n;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++)
if(a[j]>a[j+1])
{
double t;
t=a[j];a[j]=a[j+1];a[j+1]=t;
}
for(i=0;i<n;i++)
b[i]=abs(a[i]-aver);
double max=0;
for(i=0;i<n;i++)
if(b[i]>max)
max=b[i];
int c[300],k=0;
for(i=0;i<n;i++)
if(b[i]==max)
c[k]=i,k++;
cout<<a[c[0]];
for(i=1;i<k;i++)
cout<<','<<a[c[i]];
cout<<endl;
return 0;
} | 21 |
10,372 |
void main()
{
int n,i,sign=0;
float max;
unsigned int a[300];
float ab[300],c[300];
unsigned int sum=0;
float aver;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=((float)sum)/n;
max=0;
for(i=0;i<n;i++)
{
c[i]=(float)a[i]-aver;
if(c[i]>0) ab[i]=c[i];
else ab[i]=-c[i];
if(ab[i]>max) max=ab[i];
}
for(i=0;i<n;i++)
{
if(ab[i]==max&&c[i]<=0)
{
printf("%d",a[i]);
sign=1;
}
}
for(i=0;i<n;i++)
{
if(ab[i]==max&&c[i]>=0&&sign==1)
printf(",%d",a[i]);
if(ab[i]==max&&c[i]>=0&&sign==0)
printf("%d",a[i]);
}
} | 21 |
10,373 | void main()
{ float h,p,q,sum=0.0;
long int i,n,a[300],max,min;
scanf("%ld",&n);
scanf("\n");
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
for(i=0;i<n;i++)
{sum=sum+a[i];}
h=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];
}
p=max-h;
q=h-min;
if(p>q)
printf("%ld",max);
if(p<q)
printf("%ld",min);
if(p==q)
printf("%ld,%ld",min,max);
} | 21 |
10,374 | main()
{
int n, num, k , max=-1, min=100000, sum=0;
scanf("%d",&n);
for(k=0; k<n; ++k)
{scanf("%d",&num);
sum=sum+num;
if(num>max) max=num;
if(num<min) min=num;
}
if((max*n-sum)==(sum-min*n)) printf("%d,%d",min,max);
else if ((max*n-sum)>(sum-min*n)) printf("%d", max);
else printf("%d",min);
}
| 21 |
10,375 | int main()
{
int n,i,j,k,a[500],t=0,p;
double aver=0,b[500],max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
aver+=a[i];
}
aver/=n;
for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
if(a[j]>a[j+1])
{
k=a[j];
a[j]=a[j+1];
a[j+1]=k;
}
for(i=0;i<n;i++)
b[i]=fabs(a[i]-aver);
max=b[0];
p=0;
for(i=0;i<n;i++)
if(b[i]>max)
{
max=b[i];
p=i;
}
for(i=0;i<n;i++)
if((max-b[i])<(1e-9))
{
t++;
if(t==1)
printf("%d",a[i]);
else
{
printf(",");
printf("%d",a[i]);
}
}
return 0;
}
| 21 |
10,376 | void main()
{
int num,*p,i,sum=0,s;
float mean,*q,a,t;
int j,k;
scanf("%d",&num);
p=(int*)malloc(sizeof(int)*num);
q=(float*)malloc(sizeof(float)*num);
for(i=0;i<num;i++)
scanf("%d",p+i);
for(i=0;i<num;i++)
sum=sum+p[i];
mean=((float)sum)/num;
for(i=0;i<num;i++)
{
a=mean-p[i];
q[i]=(a>=0)?a:(-a);
}
for(i=0;i<num;i++)
{
k=i;
for(j=i+1;j<num;j++)
{
if(q[j]>=q[k])
k=j;
}
if(k!=i)
{
t=q[k];
q[k]=q[i];
q[i]=t;
s=p[k];
p[k]=p[i];
p[i]=s;
}
}
if (q[0]!=q[1])
printf("%d",p[0]);
else
{
if(p[0]>=p[1])
printf("%d,%d\n",p[1],p[0]);
else
if(p[0]<p[1])
printf("%d,%d\n",p[0],p[1]);
}
free(p);
free(q);
} | 21 |
10,377 | int main()
{
int i=0,j=0,k=0;
float num[300]={0};
int n;
float ave=0, sum=0;
float temp=0;
int temp_num;
cin>>n;
i=1;
while(i<=n)
{
cin>>num[i];
sum=sum+num[i];
i++;
}
ave=sum/n;
i=1;
float distance =0;
while(i<=n)
{
if((num[i]-ave)>=0)
distance=num[i]-ave;
else
distance=ave-num[i];
if(temp<(distance))
{
temp=distance;
}
i++;
}
//cout<<temp;
for(i=1;i<=n-1;i++)
{
for(j=1;j<=n-i;j++)
{
if(num[j]>num[j+1])
{
temp_num=num[j];
num[j]=num[j+1];
num[j+1]=temp_num;
}
}
}
i=1;
int record=0;
while(i<=n)
{
//cout<<num[i];
//cout<<temp-(num[i]-ave)<<endl;
if((num[i]-ave)>=0)
distance=num[i]-ave;
else
distance=ave-num[i];
if(temp-(distance)<=0.000001)
{
if(record==0)
{
cout<<num[i];
record=record+1;
}
else
{
cout<<","<<num[i];
}
}
i=i+1;
}
} | 21 |
10,378 | void main()
{
int n,a[300],b[300],i,p,k,j=1,q;
double s=0,m=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
s=s/n;
for(i=0;i<n;i++)
{
t=fabs(a[i]-s);
if(t>m)
{
m=t;
k=i;
p=1;
}
else if(fabs(t-m)<=1e-6)
p++;
}
b[0]=a[k];
if(p==1)
printf("%d",a[k]);
else
{
for(i=k+1;i<n;i++)
if(fabs(fabs(a[i]-s)-m)<=1e-6)
{
b[j]=a[i];
j++;
}
for(j=0;j<p;j++)
{
q=j;
for(i=j+1;i<p;i++)
if(b[q]>b[j])
q=i;
b[j]=b[q];
}
for(j=0;j<p;j++)
{
printf("%d",b[j]);
if(j<p-1)
printf(",");
}
}
} | 21 |
10,379 | int main()
{
int n,i,j,m;
float a[300],jun,sum,max,k,t;
sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%f",&a[i]);
sum=sum+a[i];
}
for(j=0;j<n-1;j++){
for(i=0;i<n-1-j;i++)
if(a[i]>a[i+1]){
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
jun=sum/n;
max=jun-a[0];
for(i=1;i<n;i++){
k=a[i]-jun;
if(k<0){
k=0-k;
}
if(k>max)
max=k;
}
for(i=0;i<n;i++){
k=a[i]-jun;
if(k<0){
k=0-k;
}
if(k==max){
printf("%d",(int)a[i]);
break;
}
}
m=i+1;
for(i=m;i<n;i++){
k=a[i]-jun;
if(k<0){
k=0-k;
}
if(k==max){
printf(",%d",(int)a[i]);
}
}
return 0;
}
| 21 |
10,380 | struct point
{
int num;
float distance;
};
int main()
{
struct point ans[300];
float ave;
int n,i,s=0,j;
struct point temp;
int a[300];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
s=a[i]+s;
}
ave=(s*1.0)/n;
for(i=1;i<=n;i++)
{
ans[i].num=a[i];
if(ave>a[i]) ans[i].distance=ave-a[i];
else ans[i].distance=a[i]-ave;
}
for(i=n-1;i>=1;i--)
{
for(j=1;j<=i;j++)
{
if(ans[j].distance<ans[j+1].distance)
{
temp=ans[j];
ans[j]=ans[j+1];
ans[j+1]=temp;
}
}
}
printf("%d",ans[1].num);
for(i=2;i<=n;i++)
{
if(ans[i].distance==ans[1].distance)
printf(",%d",ans[i].num);
}
return 0;
} | 21 |
10,381 | main()
{
int n,i,s=0,w;
float p,q;
int a[300]={0},c[10];
float b[300]={0.0};
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
s+=a[i];
}
p=(float)s/n;
q=0;w=0;
for(i=0;i<n;i++){
b[i]=a[i]-p;
if(b[i]<0)
b[i]=-b[i];
}
for(i=0;i<n;i++){
if(b[i]>q)
q=b[i];
}
for(i=0;i<n;i++){
if(b[i]==q){
c[w]=i;
w++;
}
}
for(i=0;i<w-1;i++)
printf("%d,",a[c[i]]);
printf("%d",a[c[w-1]]);
return 0;
}
| 21 |
10,382 | void main()
{ int n,i,num[300],s=0,u=0,m;
float aver,t[300],max,sum=0,min;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d,",&num[i]);
for(i=0;i<n;i++)
sum=sum+(float)(num[i]);
aver=sum/(float)(n);
for(i=0;i<n;i++)
t[i]=aver-(float)(num[i]);
min=t[0];
for(i=0;i<n;i++)
{if(t[i]>min)
{min=t[i];
s=i;
}
max=t[0];
for(m=0;m<n;m++)
{if(t[m]<max)
{max=t[m];
u=m;
}
}
}if(t[s]+t[u]<0)
printf("%d",num[u]);
else if(t[s]+t[u]>0)
printf("%d",num[s]);
else
printf("%d,%d",num[s],num[u]);
} | 21 |
10,383 |
void main()
{
int n;
int m[300];
int i,j;
int b;
int sum=0,temp;
float ave;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&m[i]);
for(i=0;i<n;i++)
sum=sum+m[i];
ave=(float)sum/(float)n;
for (i=1;i<n-1;i++)
{
for (j=0;j<n-i;j++)
{
if (m[j]>m[j+1])
{
temp=m[j];
m[j]=m[j+1];
m[j+1]=temp;
}
}
}
if ((ave-(float)m[0])>((float)m[n-1]-ave))
printf("%d",m[0]);
else if ((ave-(float)m[0])<((float)m[n-1]-ave))
printf("%d",m[n-1]);
else
printf("%d,%d",m[0],m[n-1]);
}
| 21 |
10,384 | int main()
{
int n,m,a[300],c[300],t;
float x,b[300],s;
scanf("%d\n",&n);
for(m=0,x=0;m<n;m++)
{
scanf("%d",&a[m]);
x=x+a[m];
}
x=x/n;
for(m=0,s=0;m<n;m++)
{
b[m]=x-a[m];
if(s<0)s=-s;
if((b[m]>0&&b[m]>s)||(b[m]<0&&b[m]<-s))s=b[m];
}
if(s<0)s=-s;
for(m=0,t=0;m<n;m++)
if(b[m]==s||b[m]==-s){c[t]=a[m];t++;}
c[t]='a';
for(m=0;c[m+1]!='a';m++)
for(t=m+1;c[t]!='a';t++)
if(c[m]>c[t])
{
n=c[m];
c[m]=c[t];
c[t]=n;
}
for(m=0;c[m+1]!='a';m++)
printf("%d,",c[m]);
printf("%d",c[m]);
return 0;
} | 21 |
10,385 | void main()
{
int min,max,x,n,i,s;
scanf("%d",&n);
scanf("%d",&x);
s=max=min=x;
for(i=1;i<n;i++)
{
scanf("%d",&x);
if(min>x) min=x;
if(max<x) max=x;
s=s+x;
}
if((n*max-s)>(s-n*min)) printf("%d",max);
if((n*max-s)<(s-n*min)) printf("%d",min);
if((n*max-s)==(s-n*min)) printf("%d,%d",min,max);
} | 21 |
10,386 | int main()
{
int n,a[300]={0},i,j,sum=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
double max=abs(a[0]*n-sum);
for(i=1;i<n;i++)
if(abs(a[i]*n-sum)>max)
max=abs(a[i]*n-sum); //????????????
int save[300]={0};
int count=0;
double e=0.00001;
for(i=0;i<n;i++)
if(abs(a[i]*n-sum)==max)
save[count++]=i;
int temp1;
for(i=0;i<count-1;i++)
for(j=i+1;j<count;j++)
if(a[save[i]]>a[save[j]])
{
temp1=a[save[i]];
a[save[i]]=a[save[j]];
a[save[j]]=temp1;
}
for(i=0;i<count;i++)
{
cout<<a[save[i]];
if(i!=count-1)cout<<',';
}
return 0;
} | 21 |
10,387 | void main()
{
int n,i,j,q;
float sum,ave,p1,p2,k1,k2;
float a[300];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%f",&a[i]);
sum=0;
for(i=0;i<=n-1;i++)
sum=sum+a[i];
ave=sum/n;
q=0;
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-1;j++)
if(a[j]<a[i])break;
if(j==n)
{
k1=ave-a[i];
p1=a[i];q=1;
}
if(q==1)break;
}
q=0;
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-1;j++)
if(a[j]>a[i])break;
if(j==n)
{
k2=a[i]-ave;
p2=a[i];q=1;
}
if(q==1)break;
}
if(k1>k2)printf("%.0f",p1);
else if(k1<k2)printf("%.0f",p2);
else printf("%.0f,%.0f",p1,p2);
} | 21 |
10,388 | void main()
{
float a[300],b[300];int c[300];float sum=0,max;int i,j,n,m=0;int k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum=sum+a[i];
}sum=sum/n;
for(i=0;i<n;i++)
{
b[i]=a[i]-sum;
if(b[i]<0)b[i]=0-b[i];
}max=b[0];
for(i=0;i<n;i++)
{
if(b[i]>max)max=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{c[m]=(int)a[i];m++;}
}
for(i=0;i<m;i++)
for(j=i+1;j<m;j++)
{
if(c[i]>c[j])
{k=c[j];c[j]=c[i];c[i]=k;}
}
for(i=0;i<m-1;i++)printf("%d,",c[i]);
printf("%d",c[m-1]);
} | 21 |
10,389 |
int main()
{
int n,i,j,temp,inpnum[300],max;
float sum=0,ave,distance[300],tmpf;
scanf("%d",&n);
for(i=0;i<n;i++) //????
{
scanf("%d",&inpnum[i]);
sum+=inpnum[i];
}
ave=sum/n;//?????
for(i=0;i<n;i++)//????
{
if(inpnum[i]>ave)
distance[i]=inpnum[i]-ave;
else
distance[i]=ave-inpnum[i];
}
/* printf("the distances are:");
for(i=0;i<n;i++)
printf(" %f ",distance[i]);
printf("\n");*/
for(i=0;i<n-1;i++)//??????????
{
for(j=0;j<n-1;j++)
{
if(distance[j]<distance[j+1])
{
tmpf=distance[j];
distance[j]=distance[j+1];
distance[j+1]=tmpf;
temp=inpnum[j];
inpnum[j]=inpnum[j+1];
inpnum[j+1]=temp;
}
else if(distance[j]==distance[j+1] && inpnum[j]>inpnum[j+1])
{
tmpf=distance[j];
distance[j]=distance[j+1];
distance[j+1]=tmpf;
temp=inpnum[j];
inpnum[j]=inpnum[j+1];
inpnum[j+1]=temp;
}
}
}
/* printf("\nafter the change, the diatances are:");
for(i=0;i<n;i++)
printf("%f ",distance[i]);
printf("\n");*/
max=distance[0];//max?????
printf("%d",inpnum[0]);//??????????
for(i=1;i<n;i++)//?????????????
{
if(distance[i]==max)
printf(",%d",inpnum[i]);
else
break;
}
return 0;
}
| 21 |
10,390 | int n,i;
long int rec[301];
long int min,max;
float sum;
main()
{
scanf("%d\n",&n);
sum=0;
min=100000;
max=0;
for(i=1;i<=n;i++)
{
scanf("%d",&rec[i]);
sum=sum+rec[i];
if (rec[i]<min) min= rec[i];
if (rec[i]>max) max=rec[i];
}
sum=sum/n;
if (max-sum==sum-min) printf("%d,%d\n",min,max);
else if (max-sum>sum-min) printf("%d\n",max);
else printf("%d\n",min);
} | 21 |
10,391 | void main()
{
int num[300],i,k=0,n,j;
float aver,sub[300],sum=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&num[i]);
sum=sum+num[i];
}
aver=sum/n;
for (i=0;i<n;i++)
sub[i]=fabs(num[i]-aver);
for (i=0;i<n;i++)
if (sub[i]>sub[k])
k=i;
for (i=0;i<n;i++)
if (sub[i]==sub[k]&&i!=k)
{
if (num[i]>num[k])
{
j=num[i];
num[i]=num[k];
num[k]=j;
}
printf("%d,",num[i]);
break;
}
printf("%d\n",num[k]);
}
| 21 |
10,392 | int main()
{
int n,a[max],tmp,i,j;
float ave,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
ave=(float)sum/n;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
if(fabs(a[i]-ave)<fabs(a[j]-ave)){
tmp=a[i];
a[i]=a[j];
a[j]=tmp;
}
}
}
printf("%d",a[0]);
i=1;
while(fabs(a[i]-ave)==fabs(a[0]-ave)){
printf(",%d",a[i]);
i++;
}
return 0;
}
| 21 |
10,393 | //============================================================================
// Name : ex5.4.cpp
// Author : Zhang Yu
// Version :
// Copyright : Your copyright notice
// Description : ?????
//============================================================================
int main() {
int n;
cin >>n;
double num[n];
double sum=0;
for (int i=0;i<=n-1;++i)
{
cin >>num[i];
sum+=num[i];
}
double average=sum/n;
double men[n];
for (int i=0;i<=n-1;++i)
men[i]=-1;
double deltamax=0;
for (int i=0;i<=n-1;++i)
{
if (deltamax<abs(average-num[i]))
deltamax=abs(average-num[i]);
}
int k=0;
for (int i=0;i<=n-1;++i)
{
if (deltamax==abs(average-num[i]))
men[k++]=num[i];
}
sort(men,men+k);
for (int i=0;i<=k-1;++i)
{
if (i==0)
cout <<men[i];
else
cout <<","<<men[i];
}
return 0;
}
| 21 |
10,394 | void main()
{
int n,i,sum=0,j,t=0,x;
int a[300];
double b[300];
double p;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
p=(double)sum/n;
for(i=0;i<n;i++){
b[i]=fabs(a[i]-p);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(b[i]>=b[j]){
t++;
}
}
if(t==n){
printf("%d",a[i]);
t=0;
x=i;
break;
}
else{t=0;}
}
for(i=x+1;i<n;i++){
for(j=0;j<n;j++){
if(b[i]>=b[j]){
t++;
}
}
if(t==n){
printf(",%d",a[i]);
}
t=0;
}
} | 21 |
10,395 |
int main()
{
int n=0;//??????n
int a[300],sum=0,t;//????a??????,sum???,t????
double ave,dis[300],max=0.0;//???????ave?????,??dis??????,max?????????
cin>>n;
int i=0,j=0;//??????ij
int p=0;//p?????
for(i=0;i<n;i++)//????,??
{
cin>>a[i];
sum+=a[i];
}
ave=(double)sum/(double)n;//???
for(i=0;i<n-1;i++)//?????????
for(j=i+1;j<n;j++)
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
for(i=0;i<n;i++)//?????
dis[i]=(a[i]-ave)*(a[i]-ave);
max=dis[0];
for(i=0;i<n;i++)//??????
if(dis[i]>=max)
{
max=dis[i];
p++;
}
if(p==1)//?????????????
{
for(i=0;i<n;i++)
if(dis[i]==max)
cout<<a[i];
}
else
if(p>1)
{
for(i=0;i<n;i++)
if(dis[i]==max)
{
j=i;
cout<<a[j];
break;
}
for(i=j+1;i<n;i++)
if(dis[i]==max)
cout<<","<<a[i];
}
return 0;
} | 21 |
10,396 | void main()
{
int n,i,j;
float ave,a[305][2],t[2],sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i][0]);
for(i=0;i<n;i++)
sum=sum+a[i][0];
ave=sum/n;
for(i=0;i<n;i++)
a[i][1]=fabs(a[i][0]-ave);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
if((a[j][1]>a[i][1])||((a[j][1]==a[i][1])&&(a[j][0]<a[i][0])))
{
t[0]=a[i][0];
t[1]=a[i][1];
a[i][0]=a[j][0];
a[i][1]=a[j][1];
a[j][0]=t[0];
a[j][1]=t[1];
}
}
printf("%.0f",a[0][0]);
for(i=1;i<n;i++)
{
if(a[i][1]==a[0][1])
printf(",%.0f",a[i][0]);
}
}
| 21 |
10,397 | int main()
{
int n;
cin>>n;
float sum;
int a[300];
for(int i=0;i<=n-1;i++)
{
cin>>a[i];
sum=sum+a[i];
}
int k;
for(int i=0;i<n-1;i++)
{
for(int s=0;s<n-1-i;s++)
{
if(a[s]>a[s+1])
{
k=a[s];
a[s]=a[s+1];
a[s+1]=k;
}
}
}
float pingjun=sum/n;
float h=pingjun-a[0],t=a[n-1]-pingjun;
if(h==t)
{
cout<<a[0]<<","<<a[n-1]<<endl;
}
else if(h>t)
{
cout<<a[0];
}
else if(h<t)
{
cout<<a[n-1];
}
return 0;
}
| 21 |
10,398 | int main()
{
int n,i,k=0;
scanf("%d",&n);
float x,nu[300];
float d=0;
float z=0;
float nn[300];
for(i=0;i<n;i++)
{
scanf("%f",&nu[i]);
z=z+nu[i];
}
x=z/(float)n;
for(i=0;i<n;i++)
{
if(x-nu[i]>d)
{ d=x-nu[i];}
if(nu[i]-x>d)
{ d=nu[i]-x;}
}
for(i=0;i<n;i++)
{
if(x-nu[i]-d<=0.01&&x-nu[i]-d>=-0.01)
{
nn[k]=nu[i];
k++;
}
else
if(nu[i]-x-d<=0.01&&nu[i]-x-d>=-0.01)
{ nn[k]=nu[i];
k++;}
}
printf("%.0f",nn[0]);
for(i=1;i<k;i++)
{
printf(",%.0f",nn[i]);
}
return 0;
} | 21 |
10,399 | int main()
{
int i,j,n,t,a[300]={0};
float ave=0,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
ave=sum/n;
for(i=0;i<n-1;i++){
for(j=0;j<n-i-1;j++){
if(a[i]>a[i+1]){
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
}
if((ave-a[0])>(a[n-1]-ave))
printf("%d",a[0]);
else if((ave-a[0])<(a[n-1]-ave))
printf("%d",a[n-1]);
else
printf("%d,%d",a[0],a[n-1]);
return 0;
}
| 21 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.