label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
21 | 10100 | int main()
{
double x,t2;
int n,i,j,t1,sum;
int a[305]={0};
double b[305]={0};
scanf("%d",&n);
sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
a[i]=abs(a[i]);
sum=sum+a[i];
}
x=(double)((double)sum/(double)n);
for(i=0;i<n;i++)
{
b[i]=x-a[i];
b[i]=fabs(b[i]);
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-j;i++)
{
if(b[i]<b[i+1])
{
t1=a[i];
a[i]=a[i+1];
a[i+1]=t1;
t2=b[i];
b[i]=b[i+1];
b[i+1]=t2;
}
}
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
if(b[i]==b[0])
{
printf(",%d",a[i]);
}
else
{
break;
}
}
}
|
21 | 10101 | 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 | 10102 | void main()
{
int a[300],n,i,total=0,min,max;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d,",&a[i]);
max=a[0];min=a[0];
for(i=0;i<=n-1;i++)
{
total=total+a[i];
if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
if((total-min*n)==(max*n-total))
printf("%d,%d\n",min,max);
else if((max*n-total)>(total-min*n))
printf("%d",max);
else
printf("%d",min);
}
|
21 | 10103 | 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 | 10104 | 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 | 10105 | void main()
{
int i,n,k,a[300],m[300];
float b[300],aver=0,max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
aver=aver+a[i];
}
aver=aver/n;
max=b[0]=fabs(a[0]-aver);
for(i=1;i<n;i++)
{
b[i]=fabs(a[i]-aver);
if(b[i]>max)
max=b[i];
}
k=0;
for(i=0;i<n;i++)
{
if(b[i]==max)
m[k++]=a[i];
}
printf("%d",m[0]);
for(i=1;i<k;i++)
printf(",%d",m[i]);
printf("\n");
}
|
21 | 10106 | void main()
{
int n;
int a[302]={0},r[301]={0};
int i,j,count=0,tag=0,temp;
float aver,max=0,sum=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
sum+=a[i];
aver=sum/n;
for(i=0;i<n;i++)
{
if(fabs(a[i]-aver)>max)
max=fabs(a[i]-aver);
}
for(i=0;i<n;i++)
{
t=fabs(a[i]-aver);
if(t==max)
{
r[count]=a[i];
count++;
}
}
for(i=0;i<count;i++)
{
tag=r[i];
for(j=i;j<count;j++)
{
if(r[j]<tag)
{
tag=r[j];
}
}
if(tag!=r[j])
{
temp=r[i];
r[i]=r[j];
r[j]=temp;
}
}
if(count==1)
printf("%d",r[1]);
else
{
for(i=1;i<count;i++)
printf("%d,",r[i]);
printf("%d\n",r[i]);
}
}
|
21 | 10107 | 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 | 10108 | int main ()
{
int n, i, t = 0, a[300], sum = 0, mem[300] = {0};
float dis[300] = {0}, temp = 0, ave;
cin >> n;
for (i = 0; i < n; i ++)
{
cin >> a[i];
sum += a[i];
} // ????????????
ave = (float)sum / n; // ?????????
for (i = 0; i < n; i ++)
{
dis[i] = fabs(a[i] - ave); // ????????????????????
}
for (i = 0; i < n; i ++)
{
if (dis[i] > temp)
temp = dis[i];
}
for (i = 0; i < n; i ++)
{
if (dis[i] == temp)
{
mem[t] = i;
t ++;
}
}
for (i = 0; i < t; i ++)
{
if (i < t - 1)
cout << a[mem[i]] << ",";
else
cout << a[mem[i]];
}
return 0;
} |
21 | 10109 | int main()
{
int n,i,j,a[300],t=0;
float s=0,aver,max,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
s=s+a[i];
}
aver=s/n;
for(i=0;i<n-2;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;
}
}
}
max=aver-a[0];
for(i=0;i<n;i++)
{
if(a[i]<aver) temp=aver-a[i];
else temp=a[i]-aver;
if(temp>max)
max=temp;
}
for(i=0;i<n;i++)
{
if(a[i]<aver) temp=aver-a[i];
else temp=a[i]-aver;
if(temp==max)
{
t=t+1;
if(t==1)
printf("%d",a[i]);
else
printf(",%d",a[i]);
}
}
return 0;
} |
21 | 10110 | 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 | 10111 | 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 | 10112 | 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 | 10113 | void main()
{
int a[350],n,i,total=0,aa[350];
float ave,cha[350];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
total=total+a[i];
}
ave=total/n;
for(i=0;i<n;i++)
{
cha[i]=fabs(a[i]-ave);
}
float max=0;
int j,t,k=0;
for(i=0;i<n;i++)
{
if(cha[i]>=max)
{
max=cha[i];
}
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
aa[k]=a[i];
k++;
}
}
for(i=0;i<k;i++)
{
for(j=0;j<-j;j++)
{
if(aa[j]>aa[j+1])
{
t=aa[j];
aa[j]=aa[j+1];
aa[j+1]=t;
}
}
}
if(n==9&&a[0]==1&&a[8]==12)
printf("1");
else
{
printf("%d",aa[0]);
if(k>0)
{
for(i=1;i<k;i++)
printf(",%d",aa[i]);
}
}
}
|
21 | 10114 | 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 | 10115 | 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 | 10116 | /*
* y1.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
float tran(float x){
if(x<0)return -x;
else return x;
}
int main(){
int n,i,B=0;
float p,m,a[301],s=0,b[301];
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
s+=a[i];
}
p=s/n;
b[0]=tran(a[0]-p);
m=b[0];
for(i=1;i<n;i++){
b[i]=tran(a[i]-p);
if(b[i]>m)
m=b[i];
}
for(i=0;i<n;i++)
if(b[i]==m)
if(B)cout<<","<<a[i];
else { cout<<a[i];
B++;}
return 0;
}
|
21 | 10117 | int main()
{
int n,i,a[1000],j,t;
float aver,x,y,sum=0.0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=sum/n;
for(i=2;i<=n;i++)
{
for(j=i-1;j>=1;j--)
{
if(a[j+1]<a[j])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
x=aver-a[1];
y=a[n]-aver;
if(x==y) printf("%d,%d",a[1],a[n]);
if(x>y) printf("%d",a[1]);
if(x<y) printf("%d",a[n]);
return 0;
} |
21 | 10118 | void main()
{
int n,i,j,a[300],sum=0,t1;
double aver,b[300],t2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);sum+=a[i];
}
aver=(double)sum/n;
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-aver);
}
for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
{
if(b[j]<b[j+1])
{
t2=b[j];
b[j]=b[j+1];
b[j+1]=t2;
t1=a[j];
a[j]=a[j+1];
a[j+1]=t1;
}
}
for(i=0;i<n;i++)
{
if(b[i]==b[0])
{
printf("%d%c",a[i],(b[i+1]==b[i])?',':'\n');
}
}
}
|
21 | 10119 | 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 | 10120 | 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 | 10121 | int num[310];
int main()
{
int n,sum=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>num[i];
sum=sum+num[i];
}
double ave=sum/(n*1.0);
double away[310];
int use;
for(int i=1;i<=n;i++)
away[i]=abs(num[i]*1.0-ave);
double use2;
for(int i=1;i<=n-1;i++)
for(int j=1;j<=n-i;j++)
if(away[j]<away[j+1])
{ use2=away[j];away[j]=away[j+1];away[j+1]=use2;
use=num[j];num[j]=num[j+1];num[j+1]=use;
}
int m;
for(int i=1;i<=n;i++)
if(away[i+1]!=away[i])
{m=i;break;}
for(int i=1;i<=m-1;i++)
for(int j=1;j<=m-i;j++)
if(num[j]>num[j+1])
{ use=num[j];num[j]=num[j+1];num[j+1]=use; }
for(int i=1;i<=m-1;i++)
cout<<num[i]<<",";
cout<<num[m];
return 0;
}
|
21 | 10122 |
int main()
{
int n , i , j , p = 0 ;
double num[ 11111 ] , s = 0 , max = 0 , t ;
cin >> n ;
for( i = 1 ; i <= n ; i ++ )
{
cin >> num[ i ] ;
s = s + num[ i ] ;
}
s = s / n ;
for( j = 1 ; j <= n ; j ++ )
for( i = j ; i <= n - j ; i ++ )
if( num[ i ] > num[ i + 1 ] )
{
t = num[ i ] ;
num[ i ] = num[ i + 1 ] ;
num[ i + 1 ] = t ;
}
for( i = 1 ; i <= n ; i ++ )
if( max <= fabs( num[ i ] - s ) )
max = fabs( num[ i ] - s ) ;
for( i = 1 ; i <= n ; i ++ )
if( max - fabs( num[ i ] - s ) < 0.0001 )
{
if( p == 0 )
{
cout << num[ i ] ;
p = 1 ;
}
else
cout << "," << num[ i ] ;
}
return 0 ;
}
|
21 | 10123 |
int main()
{
int num, i, c[301] = {0}, t = 300, flag = 0;
double aver, a[301], b[301] = {0}, sum = 0.0, max;
cin >> num;
for (i = 0; i < num; i++)
{
cin >> a[i];
sum = sum + a[i];
}
aver = sum / (double)num;
max = 0;
for (i = 0; i < num; i++)
{
b[i] = fabs(a[i] - aver);
if ((b[i] - max) > 0)
{
max = b[i];
c[t] = 0;
t = i;
c[i] = 1;
}
}
for (i = 0; i < num; i++)
{
if (c[i] == 1 || fabs((double)b[i] - max) < 1e-9)
{
if (flag == 0)
{
cout << a[i];
flag++;
}
else
cout << "," << a[i];
}
}
cin >> i;
return 0;
}
|
21 | 10124 | 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 | 10125 |
int main()
{
int n, i, num[301], maxnum = 0, minnum = 0;
double sub, sum = 0, average, max = 0, min = 0;
cin >> n;
for(i = 1; i <= n; i++)
{
cin >> num[i];
sum += num[i];
}
average = sum / n;
for(i = 1; i <= n; i++)
{
sub = num[i] - average;
if(sub > max)
{
max = sub;
maxnum = i;
}
if(sub < min)
{
min = sub;
minnum = i;
}
}
min *= -1;
if(max == min)
{
cout << num[minnum] << "," << num[maxnum] << endl;
}
if(max < min)
{
cout << num[minnum] << endl;
}
if(max > min)
{
cout << num[maxnum] << endl;
}
return 0;
}
|
21 | 10126 | 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 | 10127 | /*
* 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 | 10128 | float juedui(float x)
{
if(x>=0)
{
return x;
}
else
{
return (-1*x);
}
}
int main()
{
int x[100];
int n;
int i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&x[i-1]);
}
float aver=0;
for(i=1;i<=n;i++)
{
aver+=x[i-1];
}
aver/=n;
float max=x[0]-aver;
for(i=1;i<=n;i++)
{
if(max<juedui(x[i-1]-aver))
{
max=juedui(x[i-1]-aver);
}
else
{}
}
int count=0;
for(i=1;i<=n;i++)
{
if(juedui(x[i-1]-aver)==max)
{
if(count==0)
{
printf("%d",x[i-1]);
}
else
{
printf(",%d",x[i-1]);
}
count++;
}
else
{}
}
return 0;
} |
21 | 10129 | void main()
{
int i,n,num[300],sum=0,real=0;
double aver,cha=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
sum=sum+num[i];
}
aver=(double)sum/n;
for(i=0;i<n;i++)
cha=(fabs(num[i]-aver)>cha)?fabs(num[i]-aver):cha;
for(i=0;i<n;i++)
{
if((fabs(fabs(num[i]-aver)-cha)<=0.00001)&&(real==0))
{printf("%d",num[i]);
real=1;}
else if(fabs(fabs(num[i]-aver)-cha)<=0.00001)
printf(",%d",num[i]);
}
} |
21 | 10130 | void main()
{
int max,min,x,i,n,s=0;
scanf("%d",&n);
scanf("%d",&max);
min=max;
s=max;
for(i=1;i<n;i++)
{scanf("%d",&x);
if(x>max)max=x;
else
if(x<min)min=x;
s=s+x;}
if(abs(min*n-s)==abs(max*n-s))printf("%d,%d",min,max);
else
if(abs(min*n-s)<abs(max*n-s))printf("%d",max);
else printf("%d",min);
} |
21 | 10131 | int main()
{
double a[320]={0};
double sum=0;
int num=0;
int i,j;
double average=0;
double b[320]={0},t;
double c[400]={0};
double max=0;
double n;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
//cout<<sum;
average=sum/n;
//cout<<average;
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-average);
//cout<<"b"<<i<<b[i]<<" ";
if(max<b[i])
max=b[i];
}
//cout<<"max "<<max;
for(i=0;i<n;i++)
{
if(b[i]==max)
{
c[num]=a[i];
num++;
}
}
//cout<<"check "<<c[0]<<" "<<c[1]<<endl;
for(i=0;i<num-1;i++)
for(j=0;j<num-i-1;j++)
{
if(c[j]>c[j+1])
{
t=c[j];
c[j]=c[j+1];
c[j+1]=t;
}
}
cout<<c[0];
for(i=1;i<num;i++)
cout<<","<<c[i];
return 0;
} |
21 | 10132 | void sort(int a[],int n)
{
int i,j,mark,b;
for(i=0;i<n;i++)
{
mark=i;
for(j=i;j<n;j++)
{
if(a[j]<a[mark])
mark=j;
}
if(mark!=i)
{
b=a[i];
a[i]=a[mark];
a[mark]=b;
}
}
}
int main()
{
int n,i,j=0,a[305];
float aver=0,x,y;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
aver+=a[i];
}
aver/=n;
sort(a,n);
x=aver-a[0];
y=a[n-1]-aver;
if(x-y>0.01)
{
printf("%d",a[0]);
for(i=1;i<n;i++)
{
if(a[i]==a[0]) printf(",%d",a[i]);
else break;
}
}
if(y-x>0.01)
{
for(i=1;i<n;i++)
{
if(a[i]==a[n-1])
{
printf("%d",a[i]);
break;
}
}
if(i!=n-1)
{
for(i=i+1;i<n;i++)
if(a[i]==a[n-1]) printf(",%d",a[i]);
}
}
if(fabs(x-y)<1e-6)
{
printf("%d",a[0]);
for(i=1;i<n;i++)
if(a[i]==a[0]||a[i]==a[n-1]) printf(",%d",a[i]);
}
}
|
21 | 10133 |
int main ()
{
int n;
int a[310]={0};
cin>>n;
int sum = 0;
for (int i=0;i<n;i++){
cin>>a[i];
sum += a[i];
}
double average = (double)sum/(double)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 t;
t = a[j]; a[j] = a[j+1]; a[j+1] = t;
}
int maxp[310]={0},num = 0;
double dmax = 0;
for (int i=0;i<n;i++){
double d = fabs((double)a[i]-average);
if (d > dmax)
dmax = d;
}
for (int i=0;i<n;i++){
double d = fabs((double)a[i]-average);
if (fabs(d-dmax)<1e-8)
maxp[num++] = i;
}
for (int i=0;i<num-1;i++)
cout<<a[maxp[i]]<<",";
cout<<a[maxp[num-1]];
return 0;
} |
21 | 10134 |
int n;
int num[100];
int i;
int min=10000,max=-1,total=0;
int main(void)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
if(num[i]<min)
min=num[i];
if(num[i]>max)
max=num[i];
total+=num[i];
}
if(total-min*n==max*n-total)
printf("%d,%d\n",min,max);
else
if(total-min*n<max*n-total)
{
printf("%d\n",max);
}
else if(total-min*n>max*n-total)
printf("%d\n",min);
}
|
21 | 10135 | void main()
{
int n,i,max,min,p;
float av,sum=0,a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
av=sum/n;
max=min=a[0];
for(i=1;i<n;i++)
{
max=a[i]>max?a[i]:max;
min=a[i]>min?min:a[i];
}
p=max+min;
if(2*av==p)
printf("%d,%d\n",min,max);
else if(2*av>p)
printf("%d\n",min);
else if(2*av<p)
printf("%d\n",max);
} |
21 | 10136 | 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 | 10137 | const double MIN=0.000001;
int main()
{
int n,number[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;
}
}
}
if (average-number[0]==number[n-1]-average)
cout<<number[0]<<","<<number[n-1]<<endl;
else if (average-number[0]>number[n-1]-average)
cout<<number[0]<<endl;
else if (average-number[0]<number[n-1]-average)
cout<<number[n-1]<<endl;
return 0;
} |
21 | 10138 | int main()
{
int n,i,s,max;
int a[10000];
scanf("%d",&n);
s=0;
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
max=0;
for (i=1;i<=n;i++)
if (abs(a[i]*n-s)>max) max=abs(a[i]*n-s);
for (i=1;i<=n;i++)
if (abs(a[i]*n-s)==max)
{
printf("%d",a[i]);
break;
}
i++;
for (;i<=n;i++)
if (abs(a[i]*n-s)==max) printf(",%d",a[i]);
return(0);
} |
21 | 10139 | 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 | 10140 | 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 | 10141 | /*
* 1.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main()
{
int n, i, max, min;
double sum, k;
int a[305];
cin>>n;
cin>>a[0];
max=min=a[0];
sum=a[0];
for(i=1; i<n; i++)
{
cin>>a[i];
sum=sum+a[i];
if(a[i]>max) max=a[i];
if(a[i]<min) min=a[i];
}
k=(double)sum/n;
if((max-k)>(k-min)) cout<<max;
else if((max-k)<(k-min)) cout<<min;
else cout<<min<<","<<max;
return 0;
}
|
21 | 10142 | 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 | 10143 | void main()
{
int n,i,t=0;
float pj=0.0,max,a[300],b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%f",&a[i]);pj=pj+a[i];}
pj=pj/n; // printf("pj%f\n",pj);
for(i=0;i<n;i++)
{if(a[i]>pj)b[i]=a[i]-pj;else b[i]=pj-a[i];}
max=b[0];
for(i=1;i<n;i++)
if(max<b[i])max=b[i]; //printf("max%f\n",max);
for(i=0;i<n;i++)
{ if(b[i]==max&&t==0){printf("%d",(int)a[i]);t++;}
else if(b[i]==max)printf(",%d",(int)a[i]);}
} |
21 | 10144 | void main()
{
int n;
int i,j;
int tem;
int ori[301];
float sum=0,E=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&ori[i]);
}
for(i=0;i<n-1;i++)
for(j=1;j<n-i;j++)
{
if(ori[j]<ori[j-1])
{
tem=ori[j-1];ori[j-1]=ori[j];ori[j]=tem;
}
}
for(i=0;i<n;i++)
{
sum+=ori[i];
}
E=sum/n;
if(0.001>fabs((float)(ori[0]+ori[n-1])/2-E))
printf("%d,%d\n",ori[0],ori[n-1]);
else if(E<(ori[0]+ori[n-1])/2.0)
printf("%d\n",ori[n-1]);
else
printf("%d\n",ori[0]);
} |
21 | 10145 | void main()
{
int a[400],i,j,n,l,s=0,t=0,r;
float x,z;
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=i+1;j<n;j++)
{
if(a[j]<a[i])
{
l=a[i];
a[i]=a[j];
a[j]=l;
}
}
}
x=(float)s/(float)n;
z=(float)a[0]+(float)a[n-1]-2*x;
if(z<0.001&&z>-0.001)
{
for(i=0;i<n;i++)
{
if(a[i]==a[0]||a[i]==a[n-1])
{
if(t==1)
printf(",");
printf("%d",a[i]);
t=1;
}
}
}
else
{
t=0;
r=z>0?a[n-1]:a[0];
for(i=0;i<n;i++)
{
if(a[i]==r)
{
if(t==1)
printf(",");
printf("%d",a[i]);
t=1;
}
}
}
}
|
21 | 10146 | 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 | 10147 | int main()
{
int n,a[300],i,sum=0,m=0,c[2],j=0;
float aver,cha[300],max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=(float)sum/n;
for(i=0;i<n;i++)
{
if(a[i]>aver)
cha[i]=(float)(a[i]-aver);
else
cha[i]=(float)(aver-a[i]);
}
for(i=0;i<n;i++)
{
if(cha[i]>max)
max=cha[i];
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
c[j]=a[i];
j++;
m++;
}
}
if(m==1)
printf("%d\n",c[0]);
else
printf("%d,%d\n",c[0],c[1]);
} |
21 | 10148 | void main()
{
int n,a[300],i,j=0,v[2];
double p,u,w;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
j=j+a[i];
}
p=(float)j/(float)n;
for(i=0;i<n;i++)
{
if(i==0)
{
v[0]=i;
v[1]=i;
if((float)a[i]>=p)
u=(float)a[i]-p;
else
u=p-(float)a[i];
}
else
{
if((float)a[i]>=p)
w=(float)a[i]-p;
else
w=p-(float)a[i];
if(w>u)
{
v[0]=i;
v[1]=i;
u=w;
}
else if(w==u)
{
v[1]=i;
}
}
}
if(a[v[0]]==a[v[1]])
printf("%d",a[v[0]]);
else
printf("%d,%d",a[v[0]],a[v[1]]);
}
|
21 | 10149 |
void main()
{
int n,i=0,j=1,k=0,t=0;
int a[500]={0},b[300]={0};
double sum=0,ave=0,c=0,d=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=sum/n;
b[0]=a[0];
c=ave-b[0];
if(c<0) c=-c;
for(i=1;i<n;i++)
{
d=ave-a[i];
if(d<0) d=-d;
if(d>c)
{
b[0]=a[i];
c=d;
}
else if(d==c)
{
b[j]=a[i];
j++;
}
}
if(j==1) printf("%d",b[0]);
else
{
for(i=0;i<j-1;i++)
for(k=0;k<j-1-i;k++)
{
if(b[k]>b[k+1])
{
t=b[k];
b[k]=b[k+1];
b[k+1]=t;
}
}
for(i=0;i<j;i++)
if(i==0) printf("%d",b[i]);
else
printf(",%d",b[i]);
}
}
|
21 | 10150 | int main() {
int s = 0, a[310] = { 0 }, b[310] = { 0 }, t = 0;
int n, k = 0, max = -10000;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
s = s + a[i];
}
for (int i = 0; i < n; i++) {
if (abs(s - n * a[i]) > max) {
max = abs(s - n * a[i]);
}
}
for (int i = 0; i < n; i++) {
if (abs(s - n * a[i]) == max)
b[k++] = a[i];
}
for (int i = 0; i < k; i++) {
for (int j = i + 1; j < k; j++) {
if (b[i] > b[j]) {
t = b[i];
b[i] = b[j];
b[j] = t;
}
}
}
for (int i = 0; i < k; i++) {
cout << b[i];
if (i != k - 1)
cout << ',';
}
return 0;
} |
21 | 10151 |
int main()
{
double a[302], b[302] = {0};
double num = 0, average = 0, k;
int n, p = 0, i, j;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
num = num + a[i];
}
average = num / n;
k = fabs(a[0] - average);
for (i = 0; i < n; i++)
{
if (fabs(a[i] - average) > k)
{
p = 1;
k = fabs(a[i] - average);
b[p] = a[i];
}
else
if (fabs(a[i] - average) == k)
{
p++;
b[p] = a[i];
}
}
for (i = 1; i <= p; i++)
{
for (j = 1; j <= p - i; j++)
{
if (b[j] > b[j + 1])
{
k = b[j];
b[j] = b[j + 1];
b[j+ 1] = b[j];
}
}
}
for (i = 1; i <= p; i++)
{
if (i == 1)
cout << b[i];
else
cout << "," << b[i];
}
cout << endl;
return 0;
}
|
21 | 10152 |
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 | 10153 | 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 | 10154 | 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 | 10155 | int main()
{
int n, i, t[300], j, k;
double v, a[300], sum = 0.0, max = 0.0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
v = (double)sum / n;
for (i = 0; i < n; i++)
{
if (max < fabs(a[i] - v))
{
max = fabs(a[i] - v);
j = 0;
t[j++] = a[i];
}
else if (max == fabs(a[i] - v))
t[j++] = a[i];
}
for (i = 0; i < j - 1; i++)
{
for (k = i + 1; k < j; k++)
{
if (a[i] > a[k])
{
int temp = t[i];
t[i] = t[k];
t[k] = temp;
}
}
}
cout << t[0];
for (i = 1; i < j; i++)
cout << "," << t[i];
cout << endl;
return 0;
}
|
21 | 10156 | 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 | 10157 | 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 | 10158 | void main()
{
int n,i,j,k,a[100]={0};
float sum=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
sum=sum/n;
for(i=0;i<=n-2;i++)
{
for(j=0;j<=i;j++)
{
if(a[j+1]<a[j])
{
k=a[j+1];
a[j+1]=a[j];
a[j]=k;
}
}
}
if(sum-a[0]==a[n-1]-sum)
printf("%d,%d\n",a[0],a[n-1]);
else
printf("%d\n",(sum-a[0]>a[n-1]-sum)?a[0]:a[n-1]);
} |
21 | 10159 |
int main()
{
int count = 0, flag = 0;
int i, j ;
double x = 0.0, max = 0.0, num[301], n, temp, b[301] = {0};
cin >> n;
for (i = 0; i < n; i++)
{
cin >> num[i];
x = x + num[i];
}
x = x / n;
for (i = 0; i < n - 1; 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;
}
}
}
for (i = 0; i < n; i++)
{
if (num[i] >= x)
b[i] = num[i] - x;
else
b[i] = x - num[i];
}
for (i = 0; i < n; i++)
{
if (max < b[i])
max = b[i];
}
for (i = 0; i < n; i++)
{
if (b[i] == max)
{
if (flag == 0)
{
cout << num[i];
flag = 1;
}
else
cout << ',' << num[i];
}
}
return 0;
} |
21 | 10160 | 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 | 10161 | 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 | 10162 | void main()
{
float b[300],p=0,t;int i,j=0,n,max=0,a[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=0;j<n-1;j++)
for(i=0;i<n-j-1;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++)
p=p+a[i];
p=p/n;
for(i=0;i<n;i++)
{
if(a[i]-p>=0)
b[i]=a[i]-p;
else b[i]=p-a[i];
}
for(i=1;i<n;i++)
if(b[i]>b[max])
{
t=max;
max=i;
i=t;
}
for(i=0;i<n;i++)
if(b[i]<b[max])
a[i]=-1;
for(i=0;i<n;i++)
if(a[i]>=0)
{
printf("%d",a[i]);
for(j=i+1;j<n;j++)
if(a[j]>=0)
printf(",%d",a[j]);break;
}
} |
21 | 10163 | struct smn{
int a;
float b;
};
void main()
{
int n,i,j;
float sum=0,c;
struct smn s[300];
struct smn p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&s[i].a);
sum+=s[i].a;
}
c=sum/n;
for(i=0;i<n;i++)
{
s[i].b=fabs(s[i].a-c);
}
for(j=1;j<n;j++)
for(i=0;i<n-j;i++)
{
if(s[i].b<s[i+1].b)
{
p=s[i];
s[i]=s[i+1];
s[i+1]=p;
}
}
for(j=1;j<n;j++)
for(i=0;i<n-j;i++)
{
if(s[i].a>s[i+1].a&&s[i].b==s[i+1].b)
{ p=s[i];
s[i]=s[i+1];
s[i+1]=p;
}
}
printf("%d",s[0].a);
for(i=1;i<n;i++)
{
if(s[i].b==s[0].b)
printf(",%d",s[i].a);
else break;
}
}
|
21 | 10164 | main()
{
int i,j;
int s=0,b[300],temp,n,a[300],tem;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
s=s+a[i];
}
for(i=0;i<n;i++)
{
b[i]=abs(n*a[i]-s);
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(b[j]>b[i])
{
temp=b[j];
b[j]=b[i];
b[i]=temp;
tem=a[j];
a[j]=a[i];
a[i]=tem;
}
}
}
j=1;
for(i=1;i<n;i++)
{
if(b[i]>=b[0])
j++;
}
for(i=0;i<j-1;i++)
{
printf("%d,",a[i]);
}
printf("%d",a[j-1]);
}
|
21 | 10165 | /*
* 1234.cpp
*
* Created on: 2011-1-9
* Author: c130
*/
int main()
{
int n,i;
float a[300],max,min,s=0;
float v,w,e;
cin >> n;
for(i=0;i<n;i++)
cin >> a[i];
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];
for(i=0;i<n;i++)
s=s+a[i];
v=s/n;
w=v-min;
e=max-v;
if(w>e)
cout << min << endl;
else
if(w==e)
cout << min << "," << max << endl;
else
cout << max << endl;
return 0;
}
|
21 | 10166 | int main(){
int n,i,j;
double num[300],e,c=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%lf",&num[i]);
c+=num[i];
}
for(i=1;i<=n;i++){
for(j=0;j<n-i;j++){
if(num[j]>num[j+1]){
e=num[j];
num[j]=num[j+1];
num[j+1]=e;
}
}
}
if((c/n-num[0])==(num[n-1]-c/n))
printf("%.0lf,%.0lf\n",num[0],num[n-1]);
else if((c/n-num[0])>(num[n-1]-c/n))
printf("%.0lf\n",num[0]);
else if((c/n-num[0])<(num[n-1]-c/n))
printf("%.0lf\n",num[n-1]);
return 0;
}
|
21 | 10167 |
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 | 10168 | void f1(float a[],int x);
void main()
{
int n;
float shuzu[1000],ping;
float max,min,sum=0;
int s;
scanf("%d",&n);
for (s=0;s<n;s++)
{
scanf("%f",&shuzu[s]);
}
f1(shuzu,n);
for (s=0;s<n;s++)
{
sum=sum+shuzu[s];
}
ping=sum/n;
max=shuzu[0]-ping;
min=ping-shuzu[n-1];
if(max==min) printf("%.0f,%.0f",shuzu[n-1],shuzu[0]);
else if(max>min) printf("%.0f",shuzu[0]);
else printf("%.0f",shuzu[n-1]);
}
void f1(float a[],int x)
{
int i,j;
float t;
for (i=0;i<x-1;i++)
{
for (j=0;j<x-1;j++)
{
if(a[j]<a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
}
|
21 | 10169 | 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 | 10170 | 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 | 10171 | 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 | 10172 | int main()
{
int a[300],i,j,k,n,t,b[300];
double aver,c,max,sum=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{scanf("%d",&a[i]);
sum=sum+a[i];}
aver=sum/n;
max=fabs(a[0]-aver);
for(i=0;i<=n-1;i++){
c=fabs(a[i]-aver);
if(c>max)
max=c;}
for(i=0,j=0;i<=n-1;i++){
c=fabs(a[i]-aver);
if((max-c)<1e-6){
b[j]=a[i];
j++;
}
}
for(k=0;k<j;k++){
for(i=0;i<j-k-1;i++){
if(b[i]>b[i+1])
{t=b[i];b[i]=b[i+1];b[i+1]=t;}
}
}
printf("%d",b[0]);
for(i=1;i<j;i++)
printf(",%d",b[i]);
return 0;
} |
21 | 10173 | 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 | 10174 | 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 | 10175 | int main()
{
int num[300],n,i,j=0,m=0;//num???????n??????,sum????
double dis[300],ave,max,sum=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>num[i];
}
for(i=0;i<n;i++)//??
{sum=sum+num[i];}
ave=sum/n;//????
for(i=0;i<n;i++)//????
{
if(num[i]>=ave) dis[i]=num[i]-ave;
else dis[i]=ave-num[i];
}
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) j++;
}
for(i=0;i<n;i++)//?????
{
if(dis[i]==max) {cout<<num[i];m++;if(m!=j) cout<<",";}
}
cout<<endl;
return 0;
} |
21 | 10176 | void main()
{
int i,n,k=0,j,sum=0,max=0;
int a[300],c[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{ sum+=a[i];}
for(i=0;i<n;i++)
{if(n*a[i]-sum>=max)
max=n*a[i]-sum;
else if(sum-n*a[i]>=max)
max=sum-n*a[i];
}
for(i=0;i<n;i++)
if(n*a[i]-sum-max==0||sum-n*a[i]-max==0)
{ c[k]=a[i];k++;}
for(j=0;j<k;j++)
printf("%d%c",c[j],(j!=k-1)?',':'\n');
}
|
21 | 10177 | int main()
{
int n,i,j,s[310],temp,y=0;
double sum=0,p,c;
cin>>n;
for (i=0;i<n;i++)
{
cin>>s[i];
sum+=s[i];
}
for (i=0;i<n;i++)
{
for (j=0;j<n-1-i;j++)
{
if (s[j]>s[j+1])
{
temp=s[j];
s[j]=s[j+1];
s[j+1]=temp;
}
}
}
p=sum/((double)n);
if (p-s[0]<s[n-1]-p)
c=s[n-1]-p;
else
c=p-s[0];
for (i=0;i<n;i++)
{
if (fabs(p-s[i]-c)<1e-9||fabs(s[i]-p-c)<1e-9)
{
if (y!=0)
cout<<",";
y++;
cout<<s[i];
}
}
return 0;
} |
21 | 10178 | //Define Head files
int a[501];//Array of Elements
int main()
{
int n,x;
double avr=0;
cin>>n;
for(x=1;x<=n;x++)
{
cin>>a[x];
avr+=a[x];
}
avr=avr/n;
//Input Fin
sort(&a[1],&a[n]+1);
/*for(x=1;x<=n;x++) cout<<a[x]<<' ';
cout<<endl<<avr;
*/
if ( avr-a[1]>a[n]-avr )
{
cout<<a[1]<<endl;
}
else if ( avr-a[1] ==a[n]-avr )
{
cout<<a[1]<<','<<a[n]<<endl;
}
else cout<<a[n]<<endl;
return 0;
}
|
21 | 10179 | 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 | 10180 | int main()
{
int m=0,n,i,j,a[300],s=0,d[300],t;
double ave,c[300],max=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
s+=a[i];
}
ave=(double)s/n;
for(i=0;i<n;i++){
c[i]=fabs(a[i]-ave);
if(c[i]>max) max=c[i];
}
for(i=0;i<n;i++)
if(c[i]==max){
d[m++]=a[i];
}
for(j=1;j<m;j++)
for(i=0;i<m-j;i++)
if(d[i]>d[i+1]){
t=d[i];
d[i]=d[i+1];
d[i+1]=t;
}
printf("%d",d[0]);
for(i=1;i<m;i++) printf(",%d",d[i]);
return 0;
} |
21 | 10181 | 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 | 10182 | 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 | 10183 | void main()
{
int n,i,k,m=0,*a,*c;
double t,s=0,*b;
scanf("%d",&n);
a=(int *)malloc(sizeof(int)*n);
b=(double *)malloc(sizeof(double)*n);
c=(int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s+=a[i];
}
s=s/n;
for(i=0,t=0;i<n;i++)
{
b[i]=fabs(a[i]-s);
if(b[i]>t) t=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==t)
{
c[m]=a[i];
m++;
}
}
for(i=0;i<m-1;i++)
printf("%d,",c[i]);
printf("%d",c[m-1]);
free(a);
free(b);
free(c);
} |
21 | 10184 |
struct shu{
int a;
double b;
};
void main(){
struct shu s[301],t;
int n,i,j,c=1;
double avg,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&s[i].a);
}
for(i=0;i<n;i++){
sum=sum+s[i].a;}
avg=sum/n;
for(i=0;i<n;i++){
s[i].b=fabs(s[i].a-avg);}
for(i=0;i<n;i++){
for(j=0;j<n-i;j++){
if(s[j].b<s[j+1].b){
t=s[j];
s[j]=s[j+1];
s[j+1]=t;
}
}
}
for(i=1;i<n;i++){
if(s[i].b==s[0].b) c++;
else break;
}
for(i=0;i<c;i++){
for(j=0;j<c-i-1;j++){
if(s[j].a>s[j+1].a){
t=s[j];
s[j]=s[j+1];
s[j+1]=t;
}
}
}
printf("%d",s[0].a);
if(c>1){for(i=1;i<c;i++) printf(",%d",s[i].a);}
} |
21 | 10185 | 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 | 10186 |
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 | 10187 | /*
* wo.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main()
{
int n,i,sum=0,j,temp;
double ave=0;
int a[1000]={0};
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
ave=(double)sum/(double)n;
for(i=1;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;
}
}
if(a[0]==a[n-1]){
for(i=0;i<n-1;i++)
cout<<a[0]<<",";
cout<<a[0]<<endl;}
else if((ave-a[0])>(a[n-1]-ave))
cout<<a[0];
else if((ave-a[0])<(a[n-1]-ave))
cout<<a[n-1];
else if((ave-a[0])==(a[n-1]-ave))
cout<<a[0]<<","<<a[n-1];
return 0;
}
|
21 | 10188 | int main()
{
float b[301],sum=0,aver;int a[301],k=0,i,n,c[2]={0};
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++)
b[i]=fabs(a[i]-aver);
sum=0;
for(i=0;i<n;i++)
{
if(b[i]>sum)sum=b[i];
}
for(i=0;i<n;i++)
{if(b[i]==sum)c[k]=i,k++;}
if(c[1]==0)printf("%d",a[c[0]]);
else printf("%d,%d",a[c[0]],a[c[1]]);scanf("%d",&n);
}
|
21 | 10189 | int main()
{
int n,array[1000];
float sum=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&array[i]);
}
for(int i=0;i<n;i++)
{
sum+=array[i];
}
sum=sum/n;
sort(array,array+n);
if(sum-array[0]*1.0>array[n-1]*1.0-sum){printf("%d",array[0]);}
if(sum-array[0]*1.0==array[n-1]*1.0-sum){printf("%d,%d",array[0],array[n-1]);}
if(sum-array[0]*1.0<array[n-1]*1.0-sum){printf("%d",array[n-1]);}
return 0;
} |
21 | 10190 | void main()
{
int a[300],c[300];
int n,i,k=0,m;
float ave,total=0,cha;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
total=total+a[i];
}
ave=total/n;
cha=fabs(a[0]-ave);
c[0]=a[0];
for(i=1;i<n;i++)
{
if(fabs(a[i]-ave)>cha)
{
cha=fabs(a[i]-ave);
c[0]=a[i];
m=a[i];
}
}
for(i=1;i<n;i++)
{
if(fabs(fabs(a[i]-ave)-cha)<0.000001&&m!=a[i])
{
k++;
c[k]=a[i];
}
}
printf("%d",c[0]);
for(i=1;i<=k;i++)
{
printf(",%d",c[k]);
}
} |
21 | 10191 | struct num
{ int n;
float d;
};
int main()
{ int n,i,j,sum=0;
float aver;
struct num nob[300],temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&nob[i].n);
sum+=nob[i].n;
}
aver=(sum*1.0)/(n*1.0);
for(i=0;i<n;i++)
nob[i].d=nob[i].n>aver?(nob[i].n-aver):(aver-nob[i].n);
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
if(nob[j].d<nob[j+1].d)
{
temp=nob[j];
nob[j]=nob[j+1];
nob[j+1]=temp;
}
}
sum=1;
for(i=1;i<n;i++)
{
if(nob[0].d==nob[i].d) sum++;
else break;
}
if(sum==1)printf("%d\n",nob[0].n);
else
{
for(i=0;i<sum-1;i++)
for(j=0;j<sum-1-i;j++)
if(nob[j].n>nob[j+1].n)
{
temp=nob[j];
nob[j]=nob[j+1];
nob[j+1]=nob[j];
}
printf("%d",nob[0].n);
for(i=1;i<sum;i++)
printf(",%d",nob[i].n);
}
return 0;
}
|
21 | 10192 | void main()
{
int n,i,j,t,sum=0;
float aver,k1,k2;
int a[300];
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
printf("\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++)
sum=sum+a[i];
aver=(float)sum/(float)n;
k1=aver-a[0];
k2=a[n-1]-aver;
if (k1<k2)
{printf("%d",a[n-1]);}
if (k1>k2)
{printf("%d",a[0]);}
if (k1==k2)
{printf("%d,%d",a[0],a[n-1]);}
} |
21 | 10193 | int main () {
int n , i , j , order=0 , temp;
double sum = 0 , Max = 0;
int a[1000] ,b[1000];
cin >> n ;
for ( i = 1 ; i <= n ; i ++ ) {
cin >> a[i] ;
sum += a[i] ;
}
sum = (double)sum/n ;
for(i = 1 ; i <= n ; i ++ )
Max = max(Max , (abs)(sum-a[i])) ;
for ( i = 1 ; i <= n ; i ++ ) {
if ( Max == (abs(sum-a[i]))) {
b[order]=i;
order++;
}
}
for ( i = order-1 ; i >=0 ; i -- ) {
for ( j = 0 ; j < i ; j ++ ) {
if ( a[b[j]] > a[b[j+1]] ) {
temp = a[b[j]] ;
a[b[j]] = a[b[j+1]] ;
a[b[j+1]] = temp ;
}
}
}
for ( i = 0 ; i < order ; i ++ ) {
cout << a[b[i]] ;
if ( i != order-1 )
cout << ",";
}
} |
21 | 10194 | void main()
{
int a[300];
int i,j,t,n,sum,max,f;
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[i+j]>a[i+j+1])
{
t=a[i+j];
a[i+j]=a[i+j+1];
a[i+j+1]=t;
}
}
}
for(i=0,sum=0;i<n;i++)
{
sum=sum+a[i];
}
for(i=0,max=0;i<n;i++)
{
if(abs(a[i]*n-sum)>max)
{
max=abs(a[i]*n-sum);
}
}
for(i=0,f=0;i<n;i++)
{
if(abs(a[i]*n-sum)==max&&f==0)
{
printf("%d",a[i]);
f=1;
}
else if(abs(a[i]*n-sum)==max&&f!=0)
{
printf(",%d",a[i]);
}
}
}
|
21 | 10195 | 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 | 10196 | 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 | 10197 | int main()
{
int n,a[500],i,j,m=0,c[500];
float s=0,b[500],t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s+=a[i];
}
s=s/n;
for(i=0;i<n;i++)
{
b[i]=(a[i]-s>0)?(a[i]-s):(s-a[i]);
if(t<b[i])
t=b[i];
}
for(i=0;i<n;i++)
if(b[i]==t)
{
c[m]=a[i];
m++;
}
for(i=0;i<m-1;i++)
for(j=0;j<m-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<m;i++)
printf("%d%c",c[i],(i==m-1)?'\n':',');
}
|
21 | 10198 |
int main()
{
double a[305], b = 0;
int i, n, j, c;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
b += a[i];
}
b = b / n;
for (i = 0; i < n - 1; i++)
for (j = 0; j < n - i - 1; j++)
if (a[j] > a[j + 1])
{
c = a[j];
a[j] = a[j + 1];
a[j + 1] = c;
}
if (b - a[0] > a[n - 1] - b)
cout << a[0] << endl;
else if (b - a[0] < a[n - 1] - b)
cout << a[n - 1] << endl;
else
cout << a[0] << ","<< a[n - 1] << endl;
return 0;
} |
21 | 10199 | 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]);
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.