id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
10,000 | int main()
{
int i,j=0,n,a[300]={0},t,num=0,re[300];
double ave=0,max=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
ave+=a[i];
}
ave/=n;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;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(max<fabs((double)a[i]-ave))
max=fabs((double)a[i]-ave);
for(i=0;i<n;i++)
if(fabs(max-fabs((double)a[i]-ave))<1E-5)
{
re[num]=a[i];
num++;
}
if(num==1)
cout<<re[0]<<endl;
else
{
cout<<re[0];
for(i=1;i<num;i++)
cout<<","<<re[i];
cout<<endl;
}
return 0;
}
| 21 |
10,001 | /*
* 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 |
10,002 | /*
* 1.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main(){
int n,i,sum=0,num=1;
int a[500];
double aver,c;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
aver=1.0*sum/n;
c=abs(aver-a[0]);
for(i=1;i<n;i++){
if(abs(aver-a[i])==c)
num++;
if(abs(aver-a[i])>c){
c=abs(aver-a[i]);
num=1;
}
}
if(num==1)
for(i=0;i<n;i++)
if(c==abs(aver-a[i]))
cout<<a[i];
if(num>1){
int g=0,h=0;
for(i=0;i<n;i++)
if(c==(aver-a[i])){
g=1;
cout<<a[i];
break;
}
i++;
for(;i<n;i++)
if(c==(aver-a[i]))
cout<<","<<a[i];
if(g!=1){
for(i=0;i<n;i++)
if(c==(a[i]-aver)){
h=1;
cout<<a[i];
break;
}
}
if(h==1)i++;
if(g==1)i=0;
for(;i<n;i++)
if(c==(a[i]-aver))
cout<<","<<a[i];
}
return 0;
}
| 21 |
10,003 | //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 |
10,004 | int main()
{
int n,i,j,max;
float average,sum=0,distance,maxdistance,temp,sign;
unsigned int num[300];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&num[i]);
sum=sum+num[i];
}
average=sum/n;
for(i=1;i<n;i++)
{
for(j=n-1;j>=i;j--)
{
if(num[j]<num[j-1])
{
temp=num[j];
num[j]=num[j-1];
num[j-1]=temp;
}
}
}
maxdistance=0;
for(i=0;i<n;i++)
{
distance=(num[i]-average>0)?(num[i]-average):(average-num[i]);
if(distance>maxdistance)
maxdistance=distance;
}
for(i=0;i<n;i++)
{
distance=(num[i]-average>0)?(num[i]-average):(average-num[i]);
if(distance==maxdistance)
{
printf("%d",num[i]);
break;
}
}
for(i++;i<n;i++)
{
distance=(num[i]-average>0)?(num[i]-average):(average-num[i]);
if(distance==maxdistance)
{
printf(",%d",num[i]);
break;
}
}
printf("\n");
return 0;
} | 21 |
10,005 | void main()
{ unsigned int n,i,j,a[300],b[300];float av=0,m,mm=0;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=0;i<n;i++) av=av+a[i];
av=av/n;
for(i=0;i<n;i++)
{ if(av>a[i]) m=av-a[i];
else m=a[i]-av;
if(m>=mm) mm=m;
}
for(j=0;j<300;j++) b[j]=0;
j=0;
for(i=0;i<n;i++)
{ if(av>a[i]) m=av-a[i];
else m=a[i]-av;
if(m==mm) {b[j]=a[i];j++;}
}
for(j=0;b[j]!=0;j++) {printf("%d",b[j]);
if(b[j+1]!=0) putchar(',');}
} | 21 |
10,006 | int a(int k)
{
if(k>0)
return k;
return -k;
}
int main()
{
int num[300];
int n,i,flag=1;
int sum=0,max=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&num[i]);
sum+=num[i];
}
for(i=1;i<=n;i++)
{
if(max<a(num[i]*n-sum))
max=a(num[i]*n-sum);
}
for(i=1;i<=n;i++)
{
if(max==sum-num[i]*n)
{
if(flag==0)
printf(",");
flag=0;
printf("%d",num[i]);
}
}
for(i=1;i<=n;i++)
{
if(max==-sum+num[i]*n)
{ if(flag==0)
printf(",");
flag=0;
printf("%d",num[i]);
}
}
return 0;
}
| 21 |
10,007 | 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 |
10,008 | void main()
{float temp,aver;int b[300];
int c,d,j,s=0,i,n,a[300];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
for(i=0;i<=n-1;i++)
s=s+a[i];
for(i=0;i<=n-1;i++)
{a[i]=a[i]*n;b[i]=abs(a[i]-s);}
for(i=0;i<=n-2;i++)
for(j=i+1;j<=n-1;j++)
{if(b[i]<=b[j]){temp=b[i];b[i]=b[j];b[j]=temp;} }
c=(s-b[0])/n;d=(s+b[0])/n;
if(b[0]==b[1])
{
printf("%d,%d",c,d);goto end;}
else
{for(i=0;i<=n-1;i++)
{a[i]=a[i]/n;
if(a[i]==c) {printf("%d",c);goto end;}}
}
printf("%d",d);
end:scanf("%d",i);
} | 21 |
10,009 | int main()
{
int n,i,j,temp,a[300],sum=0;
double t,b[300],max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
t=1.0*sum/n;
for(i=0;i<n-1;i++)
{
for(j=n-1;j>i;j--)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for(j=0;j<n;j++)
{
if(a[j]>=t)
{
b[j]=a[j]-t;
}
else
{
b[j]=t-a[j];
}
max=b[0];
if(b[j]>=max)
{
max=b[j];
}
else if(b[j]<max)
{
max=b[0];
}
}
int mm = 0;
for(j=0;j<n;j++)
{
if (max == b[j])
{
if ( mm == 0)
{
printf("%d",a[j]);
}
else
{
printf(",%d",a[j]);
}
mm++;
}
}
return 0;
}
| 21 |
10,010 | void main()
{
int n,i,all=0;
float ave,cha=0,a[300],sum=0,chan[300];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%f",&a[i]);
sum+=a[i];
}
ave=sum/n;
//printf("%f",ave);
for(i=0;i<=n-1;i++)
{
chan[i]=fabs(ave-a[i]);
//printf("%f",chan[i]);
if(chan[i]>cha)
{
cha=chan[i];
}
}
for(i=0;i<=n-1;i++)
if(chan[i]==cha)
all++;
for(i=0;i<=n-1;i++)
{if(chan[i]==cha&&all!=1)
{
printf("%.0f,",a[i]);
all--;
}
else if(chan[i]==cha&&all==1)
printf("%.0f",a[i]);}
getchar();
getchar();
}
| 21 |
10,011 | int main()
{
int n,i,j,s=0,k;
int a[10000],b[10000];
double x=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
x=x+a[i];
}
x=x/n;
t=fabs(x-a[0]);
for(i=0;i<n;i++)
{
if(fabs(x-a[i])>t)
{
t=fabs(x-a[i]);
}
}
for(i=0;i<n;i++)
{
if(fabs(x-a[i])<=t+0.000001&&fabs(x-a[i])>=t-0.000001)
{
b[s]=a[i];
s=s+1;
}
}
for(i=0;i<s-1;i++)
{
for(j=0;j<s-1-i;j++)
{
if(b[j]>b[j+1])
{
k=b[j];
b[j]=b[j+1];
b[j+1]=k;
}
}
}
for(i=0;i<s;i++)
{
if(i==0)
{
printf("%d",b[i]);
}
else
printf(",%d",b[i]);
}
return 0;
}
| 21 |
10,012 | 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 |
10,013 | 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 |
10,014 |
float k( float i)
{
if(i>=0)
return i;
else return -i;
}
void main()
{
int n,a[400],s=0,max=0,min,count=0,i;
float aver;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
aver=((float)s)/n;
for(i=0,min=a[0];i<n;i++)
{
if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
if(((float)max-aver)>(-(float)min+aver))
printf("%d",max);
if(((float)max-aver)<(-(float)min+aver))
printf("%d",min);
if(((float)max-aver)==(-(float)min+aver))
printf("%d,%d",min,max);
} | 21 |
10,015 | int main()
{
int a[300];
double b[300];
int n;
int i,j;
double zong=0;
double max=0;
double ping;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
zong=zong+a[i];
}
ping=zong/n;
for(i=0;i<=n-1;i++)
{
if(ping-a[i]>=0)
b[i]=ping-a[i];
else
b[i]=a[i]-ping;
}
for(i=0;i<=n-1;i++)
{
if(b[i]>max)
{
max=b[i];
}
}
for(i=0,j=0;i<=n-1;i++)
{
if(b[i]==max)
{
j++;
if(j==1)
printf("%d",a[i]);
else
printf(",%d",a[i]);
}
}
printf("\n");
return 0;
} | 21 |
10,016 | int main()
{
int n, a[320]={0}, i, m;
float b[320], k, max;
m=1;
k=0;
max=0;
cin >> n;
for(i=0; i<n; i++)
{
cin >> a[i];
k=(k*i+a[i])/(i+1);
}
for(i=0; i<n; i++)
{
b[i]=fabs(a[i]-k);
if(b[i]>max)
{
max=b[i];
}
}
for(i=0; i<n; i++)
{
if(fabs(b[i]-max)<=1e-5)
{
if(m==1)
{
cout << a[i];
m=0;
}
else
cout << "," << a[i];
}
}
return 0;
} | 21 |
10,017 | //============================================================================
// Name : 4.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
int main() {
int n;
cin>>n;
double a[1000],b[1000];
for(int i=0;i<n;i++)//????
cin>>a[i];
double sum=0;
for(int i=0;i<n;i++)
sum+=a[i];
double average=sum/n;//?????
for(int i=0;i<n;i++)
b[i]=fabs(a[i]-average);
double max1=b[0];//??????
for(int i=0;i<n;i++)
max1=max(max1,b[i]);
double c[1000];
int num=0;
for(int i=0;i<n;i++)//?????????
if(b[i]==max1)
{
c[num]=a[i];
num++;
}
sort(c,c+num-1);//?????
cout<<c[0];//??????
for(int i=1;i<num;i++)
cout<<","<<c[i];
return 0;
}
| 21 |
10,018 | 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 |
10,019 | int main()
{
int n, i, j, a[300], tempint, count = 1;
double aver = 0, b[300], temp;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
aver += a[i];
}
aver = aver / n;
for(i = 0; i < n; i++)
{
b[i] = fabs(aver - a[i]);
}
for(i = 0; i < n - 1; i++)
{
for(j = 0; j < n - 1 - i; j++)
{
if(b[j] < b[j+1])
{
temp = b[j];
b[j] = b[j+1];
b[j+1] = temp;
tempint = a[j];
a[j] = a[j+1];
a[j+1] = tempint;
}
}
}
i = 0;
while(fabs(b[i] - b[i+1]) < 10e-6)
{
count++;
i++;
}
cout << a[0];
for(i = 1; i <= count - 1; i++)
{
cout << "," << a[i] ;
}
cout << endl;
return 0;
} | 21 |
10,020 | int main()
{
int num[301],change[301];
int n=0,i=0,sum=0,count=0;
double ave=0,max=0;
memset(num,0,sizeof(num));
memset(change,0,sizeof(change));
cin>>n;
for(i=0;i<n;i++)
cin>>num[i];
for(i=0;i<n;i++)
sum=sum+num[i];
ave=(double)sum/n;
for(i=0;i<n;i++)
if(fabs(num[i]-ave)>max)
max=fabs(num[i]-ave);
for(i=0;i<n;i++)
if(fabs(fabs(num[i]-ave)-max)<0.00001)
{
change[count]=num[i];
count++;
}
if(count==2)
{
if(change[1]>change[0])
cout<<change[0]<<","<<change[1];
else
cout<<change[1]<<","<<change[0];
}
else
cout<<change[0];
return 0;
} | 21 |
10,021 | int a[305];
int n;
double s;
double ave;
int minn, maxn;
int ans[305], num;
int main()
{
cin >> n;
s = 0;
num = 0;
cin >> a[0];
s += a[0];
minn = a[0]; maxn = a[0];
for( int i = 1;i < n; i++ )
{
cin >> a[i];
s += a[i];
if(minn > a[i]) minn = a[i];
if(maxn < a[i]) maxn = a[i];
}
ave = s / n;
double t1, t2;
t1 = ave - minn;
t2 = maxn - ave;
if(t1 > t2)
cout << minn <<endl;
else if(t1 < t2)
cout << maxn <<endl;
else
cout << minn <<","<< maxn <<endl;
return 0;
} | 21 |
10,022 | void main()
{
unsigned int a[301],i,j,k,n,t;
float av,cha[301],temp,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
av=sum/n;
for(j=0;j<n;j++)
cha[j]=fabs(a[j]-av);
for(j=0;j<n;j++)
for(k=0;k<n-j-1;k++)
if(cha[k+1]>cha[k])
{temp=cha[k];t=a[k];
cha[k]=cha[k+1];a[k]=a[k+1];
cha[k+1]=temp;a[k+1]=t;}
if(cha[0]!=cha[1])
printf("%d",a[0]);
else
{if(a[0]>a[1])
printf("%d,%d",a[1],a[0]);
else
printf("%d,%d",a[0],a[1]);}
}
| 21 |
10,023 | int main()
{
int n,i,j;
int a[100];
double max,s,p;
scanf("%d",&n);
max=0;
s=0;
j=0;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
p=s/n;
for(i=1;i<=n;i++)
if (fabs(p-a[i])>max)
{
max=fabs(p-a[i]);
j=i;
}
if (j!=0)
printf("%d",a[j]);
for(i=1;i<=n;i++)
if (fabs(p-a[i])==max && i!=j)
printf(",%d",a[i]);
return 0;
}
| 21 |
10,024 | int main(){
int n,i,a[300],k=0;
double ave=0.0,max=0.0,x;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
ave+=a[i];
}
ave/=n;
for(i=0;i<n;i++){
x=a[i]-ave;
if(fabs(x)>fabs(max)){
max=x;
k=0;
}
else if(fabs(x)==fabs(max)) k++;
}
if(k==0) printf("%d",(int)(max+ave));
else printf("%d,%d",(int)(ave-fabs(max)),(int)(ave+fabs(max)));
}
| 21 |
10,025 | int main()
{
int n,a[300]={0},j,i,sum=0,temp;
float b,c[300]={0},min;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
b=(float)sum/n;
//printf("%f\n",b);??
for(i=0;i<n;i++)
{
if(a[i]>b)
c[i]=a[i]-b;
else
c[i]=b-a[i];
// printf("%f\n",c[i]);
}
for(i=1;i<n;i++)
{
for(j=n-1;j>=i;j--)
{
if(c[j-1]>c[j])
{
min=c[j];
c[j]=c[j-1];
c[j-1]=min;
temp=a[j];
a[j]=a[j-1];
a[j-1]=temp;
}
}
}
if(c[n-1]==c[n-2])
{
if(a[n-2]>a[n-1])
{
temp=a[n-1];
a[n-1]=a[n-2];
a[n-2]=temp;
}
printf("%d,%d",a[n-2],a[n-1]);
}
else
printf("%d",a[n-1]);
return 0;
}
| 21 |
10,026 | void main()
{
int n,i,s=0,j=0,t,k;
int a[301],c[300];
float b[301];
float average,max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
average=(float)s/n;
for(i=0;i<n;i++)
{
if((float)a[i]<average)
b[i]=average-(float)a[i];
else
b[i]=(float)a[i]-average;
}
max=b[0];
for(i=1;i<n;i++)
{
if(max<b[i])
max=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{
c[j]=a[i];
j++;
}
}
if(j==1) printf("%d",c[0]);
else
{
for(k=1;k<=j-1;k++)
{
for(i=0;i<=j-k-1;i++)
{
if(c[i]>c[i+1])
{t=c[i]; c[i]=c[i+1]; c[i+1]=t;}
}
}
for(i=0;i<=j-2;i++)
printf("%d,",c[i]);
printf("%d\n",c[j-1]);
}
}
| 21 |
10,027 | 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 |
10,028 | int main()
{
int a[300];
float b[300];
int i,n;
float sum=0;
scanf("%d",&n);
for(i=0;i<=n-2;i++)
{
scanf("%d ",&a[i]);
}
scanf("%d",&a[n-1]);
for(i=0;i<=n-1;i++){
sum=sum+a[i];
}
float m;
m=sum/n;
for(i=0;i<=n;i++){
b[i]=a[i]-m;
if(b[i]<0){
b[i]=m-a[i];
}
}
float max=0;
for(i=0;i<=n-1;i++){
if(b[i]>max){
max=b[i];
}
}
int h=0;
int c[300];
for(i=0;i<=n-1;i++){
if(b[i]==max){
c[h]=a[i];
h++;
}
}
int j;
int t;
for(i=0;i<=h-2;i++){
for(j=0;j<=h-2;j++){
if(c[j]>=c[j+1]){
t=c[j+1];
c[j+1]=c[j];
c[j]=t;
}
}
}
for(i=0;i<=h-2;i++){
printf("%d,",c[i]);
}
printf("%d\n",c[h-1]);
return 0;
} | 21 |
10,029 | int n,i,a[400],j=0,m;
void main()
{
float s=0,d=0,b[400],x;
int c[400]={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++)
{
if(a[i]>=s) b[i]=a[i]-s;
else b[i]=s-a[i];
}
for(i=0;i<n;i++)
if(b[i]>d) d=b[i];
for(i=0;i<n;i++)
{
if(b[i]>d) x=b[i]-d;
else x=d-b[i];
if(x<1e-6)
{
if(a[i]<c[j])
{
c[j+1]=c[j];
c[j++]=a[i];
}
else c[j++]=a[i];
}
}
printf("%d",c[0]);
for(i=1;i<j;i++)
printf(",%d",c[i]);
}
| 21 |
10,030 | void main()
{
int n;
unsigned int num[300],ttl=0;
float dlt[300];
int rmb[300];
float avrg,t1;
int i,j,t,t2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
ttl+=num[i];
}
avrg=(double)ttl/n;
for(i=0;i<n;i++)
{
if((double)num[i]>=avrg)
dlt[i]=(double)num[i]-avrg;
else
dlt[i]=avrg-(double)num[i];
}
t1=dlt[0];
for(i=1;i<n;i++)
{
if(t1<=dlt[i])
t1=dlt[i];
}
j=0;
for(i=0;i<n;i++)
{
if(dlt[i]==t1)
{
rmb[j]=num[i];
j++;
}
}
t=j;
for(i=0;i<t-1;i++)
for(j=i+1;j<t;j++)
{
if(rmb[i]>rmb[j])
{
t2=rmb[i];
rmb[i]=rmb[j];
rmb[j]=t2;
}
}
printf("%d",rmb[0]);
for(i=1;i<t;i++)
{
printf(",%d",rmb[i]);
}
} | 21 |
10,031 | 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 |
10,032 | void main()
{
int n,a=0,i,q=0,c[2],j,u=1;
int num[501];
float av,k[501],p[501],temp;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
i==1?scanf("%d",&num[i]):scanf(" %d",&num[i]);
}
for(i=1;i<=n;i++) a=a+num[i];
av=a/n;
for(i=1;i<=n;i++)
k[i]=abs(num[i]-av);
for(i=1;i<=n;i++)
p[i]=k[i];
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(k[i]<k[j])
{
temp=k[i];
k[i]=k[j];
k[j]=temp;
}
if(num[1]==1&&num[9]==12) {printf("1");u=0;}
if(u)for(i=0;i<=n;i++)
{
if(k[1]!=k[2]&&p[i]==k[1])
printf("%d",num[i]);
}
if(k[1]==k[2])
{
for(i=1;i<=n;i++)if(p[i]==k[1])
{c[q]=num[i];
q++;}
c[0]<c[1]?printf("%d,%d",c[0],c[1]):printf("%d,%d",c[1],c[0]);
}
}
| 21 |
10,033 | float cc(int x,float y)
{
if (x>y)
return(x-y);
else return(y-x);
}
void main()
{
int n,i,p=0,j;
float sum=0,t=0;
int a[301],b[301];
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
sum=sum/n;
for (i=1;i<=n;i++)
if (cc(a[i],sum)>t)
t=cc(a[i],sum);
for (i=1;i<=n;i++)
{
if (cc(a[i],sum)==t)
{
p++;
b[p]=a[i];
}
}
for (i=1;i<p;i++)
{
for (j=1;j<=p-i;j++)
{
if (b[j]>b[j+1])
{
t=b[j];
b[j]=b[j+1];
b[j+1]=t;
}
}
}
if (p==1)
printf("%d",b[1]);
else
{
printf("%d",b[1]);
for (i=2;i<=p;i++)
printf(",%d",b[i]);
}
} | 21 |
10,034 | int main()
{
int n,i,max,sum=0,b1=0,b2=0;
float ave;
unsigned int a[300];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
ave=(float)sum/n;
max=0;
for(i=0;i<n;i++){
if(fabs(a[i]-ave)>=max){
if(a[i]<ave){
max=fabs(a[i]-ave);
b1=i;
}
else{
max=fabs(a[i]-ave);
b2=i;
}
}
}
if((a[b2]-ave)>(ave-a[b1])) printf("%d",a[b2]);
else if((a[b2]-ave)<(ave-a[b1])) printf("%d",a[b1]);
else printf("%d,%d",a[b1],a[b2]);
return 0;
} | 21 |
10,035 | /*
* ???????.cpp
*
* Created on: 2011-12-21
* Author:???
*/
int main(){
int n,a[300],i;
cin>>n;
cin>>a[1];
int min=a[1],max=a[1];//?????????
double sum=a[1]+0.0; //???
for(i=1;i<n;i++){ //???????????????
cin>>a[i];
sum+=a[i];
if(a[i]<min)min=a[i];
else if(a[i]>max)max=a[i];
}
if(2*sum/n>max+min)cout<<min<<endl;//????????????????????
else if(2*sum/n<max+min)cout<<max<<endl;
else cout<<min<<","<<max;
return 0;
}
| 21 |
10,036 |
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 |
10,037 | 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 |
10,038 |
double num[400];
double dis[400];
int main()
{
int n;
int i,j;
double temp;
double ave=0;
const double min=1e-6;
double max=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>num[i];
ave+=num[i];
}
ave=ave/n;
for(i=n-2;i>=0;i--)
for(j=0;j<=i;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++)
dis[i]=fabs(num[i]-ave);
for(i=0;i<n;i++)
if(max<dis[i])max=dis[i];
for(j=n-1;j>=0;j--)
if(fabs(max-dis[j])<min) break;
for(i=0;i<j;i++)
{if(fabs(max-dis[i])<min)cout<<num[i]<<",";}
cout<<num[j];
return 0;
}
| 21 |
10,039 | main()
{
int n,i,j;
float ave,x,sum=0;
float a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum+=a[i];
}
ave=sum/n;
for(i=0;i<n;i++)
for(j=0;j<n-1;j++)
if(a[j]>a[j+1])
{
x=a[j];
a[j]=a[j+1];
a[j+1]=x;
}
if((ave-a[0])<(a[n-1]-ave)) printf("%d\n",(int)a[n-1]);
else if((ave-a[0])>(a[n-1]-ave)) printf("%d\n",(int)a[0]);
else printf("%d,%d\n",(int)a[0],(int)a[n-1]);
} | 21 |
10,040 |
void main()
{
unsigned long a[1000], n, i, min, max;
double ave=0;
scanf("%d", &n);
for (i=0;i<n;i++)
{
scanf("%d", &a[i]);
}
min=a[0];
max=a[0];
for (i=0;i<n;i++)
{
ave+=a[i];
if (a[i]<min) min=a[i];
if (a[i]>max) max=a[i];
}
ave/=n;
double d1=ave-min, d2=max-ave;
if (fabs(d1-d2)<1e-10)
printf("%d,%d", min, max);
else if (d1>d2)
printf("%d", min);
else
printf("%d", max);
}
| 21 |
10,041 | int main()
{
int i,n,m;
double sum=0,ave=0,max=0,g[1000],s[1000];
cin>>n;
for(i=0;i<n;i++)
cin>>g[i];
for(i=0;i<n;i++)
sum=sum+g[i];
ave=sum/n;
for(i=0;i<n;i++)
{
if((g[i]-ave)>0)
s[i]=g[i]-ave;
if((g[i]-ave)<0)
s[i]=ave-g[i];
}
for(i=0;i<n;i++)
{
if(s[i]>=max)
{
max=s[i];
m=i;
}
}
for(i=0;i<n;i++)
{
if(s[i]==max&&i<m)
cout<<g[i]<<",";
if(s[i]==max&&i==m)
cout<<g[i];
}
return 0;
}
| 21 |
10,042 | int main()
{
int n,i,count=0;
double a[1000]={0.0},total=0.0,average,max=-1.0;
scanf("%d", &n);
for(i=1;i<=n;i++)
{
scanf("%lf", &a[i]);
total+=a[i];
}
average=total/n;
for(i=1;i<=n;i++)
{
if(fabs(a[i]-average)>max) max=fabs(a[i]-average);
}
for(i=1;i<=n;i++)
{
if(fabs(fabs(a[i]-average)-max)<0.001)
{
if(count==0)
{
printf("%.0f", a[i]);
count+=1;
}
else printf(",%.0f", a[i]);
}
}
printf("\n");
return 0;
}
| 21 |
10,043 | int main()
{
int n;
double sum = 0.0;
double ave;
double a[300];
double b[300];
double c[300] = {0.0};
int d[300];
int i, j, num = 0;
double temp;
cin >> n;
for ( i = 0; i < n; i++ )
{
cin >> a[i];
sum = sum + a[i];
}
for ( i = 0; i < n - 1; i++ )
for ( j = 0; j < n - 1 - i; j++ )
if ( a[i] < a[j] )
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
ave = sum / n;
for( i = 0; i < n; i++ )
{
b[i] = fabs(a[i] - ave);
}
double max = 0.0;
for( i = 0; i < n; i++ )
if ( b[i] > max )
max = b[i];
for( i = 0; i < n; i++ )
if ( (max - b[i]) < 1e-6 )
num++;
if ( num == 1 )
{
for ( i = 0; i < n; i++ )
if ( (max - b[i]) < 1e-6 )
cout << a[i] << endl;
}
if ( num > 1 )
{
for ( i = 0; i < n; i++ )
{
if ( (max - b[i]) < 1e-6 )
{
if ( num == 1 )
cout << a[i];
if ( num > 1 )
{
cout << a[i] << ",";
num--;
}
}
}
}
return 0;
}
| 21 |
10,044 |
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 |
10,045 | 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 |
10,046 |
int main()
{
int n, i, j, a[10000];
float sum=0, ave, max=0, b, c, d, e;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%d", &a[i]);
sum=sum+(float)a[i];
}
ave=sum/(float)n;
c=ave;
b=ave;
for(j=0; j<n; j++)
{
if((float)a[j]>c)
c=(float)a[j];
else if((float)a[j]<b)
b=(float)a[j];
}
d=c-ave;
e=ave-b;
if(d>e)
printf("%d\n", (int)c);
else if(d<e)
printf("%d\n", (int)b);
else
printf("%d,%d\n", (int)b, (int)c);
return 0;
} | 21 |
10,047 | /*
* 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 |
10,048 | 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 |
10,049 | int main()
{
int n,i,j,t,x,a[1000],b[1000];
scanf("%d",&n);
for (i=1;i<=n;i++) scanf("%d",&a[i]);
float s=0;
for (i=1;i<=n;i++) s=s+a[i];
s=s/n;
float max=0;
for (i=1;i<=n;i++)
{
if (fabs(a[i]-s)>max)
{
max=fabs(a[i]-s);
t=1;
b[t]=a[i];
continue;
}
if (fabs(a[i]-s)==max)
{
t++;
b[t]=a[i];
}
}
for (i=1;i<=t-1;i++)
for (j=i+1;j<=t;j++)
if (b[i]>b[j])
{
x=b[i];
b[i]=b[j];
b[j]=x;
}
for (i=1;i<=t-1;i++) printf("%d,",b[i]);
printf("%d",b[t]);
}
| 21 |
10,050 |
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 |
10,051 |
int main()
{
int n;
double max=0;
int num[310]={0};
int out[310]={0};
double sum=0,avr=0;
int i=0,j=0,k=0;
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++)
{
if(fabs(num[i]-avr)>max)
max=fabs(num[i]-avr);
}
//printf("%f \n",max);
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-i-1;k++)
{
if(out[k]>out[k+1])
{
int tmp=out[k];
out[k]=out[k+1];
out[k+1]=tmp;
}
}
}
for(i=0;i<j-1;i++)
printf("%d,",out[i]);
printf("%d",out[j-1]);
return 0;
}
| 21 |
10,052 | 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 |
10,053 | int main()
{
int n,i;int s[300]={0};int max,min;int ave;float ave2;
scanf("%d",&n);
scanf("%d",&s[0]);
ave=s[0];max=s[0];min=s[0];
for(i=1;i<=n-1;i++)
{
scanf("%d",&s[i]);
if(s[i]>max) max=s[i];
if(s[i]<min) min=s[i];
ave=ave+s[i];
}
ave2=(float)ave;
ave2=ave2/n;
if(fabs((max-ave2)-(ave2-min))<0.001) printf("%d,%d",min,max);
else if(max+min>2*ave2) printf("%d",max);
else if(max+min<2*ave2) printf("%d",min);
return 0;
}
| 21 |
10,054 | 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 |
10,055 | void main()
{
int n,i,j,k=0;
struct num
{
unsigned int a;
double b;
}num[301];
double aver,sum=0;
scanf("%d",&n);
printf("\n");
for(i=0;i<n;i++)
{
scanf("%d ",&num[i].a);
sum=sum+num[i].a;
}
printf("\n");
aver=sum/n;
for(i=0;i<n;i++)
num[i].b=fabs(num[i].a-aver);
for(j=0;j<n-1;j++)
{
for(i=0;i<n-1-j;i++)
{
if(num[i].b<num[i+1].b)
{
num[300]=num[i];
num[i]=num[i+1];
num[i+1]=num[300];
}
}
}
for(i=1;i<n;i++)
{ if(fabs(num[i].b-num[0].b)<0.000001)
k++;}
for(j=0;j<k;j++)
{
for(i=0;i<k-j;i++)
{
if(num[i].a>num[i+1].a)
{
num[300]=num[i];
num[i]=num[i+1];
num[i+1]=num[300];
}
}
}
if(k==0)
printf("%d",num[0].a);
else
{
printf("%d",num[0].a);
for(i=1;i<k+1;i++)
printf(",%d",num[i].a);
}
}
| 21 |
10,056 | struct number
{
unsigned int shu;
double cha;
}num[300];
void main()
{
int n,i,j;
unsigned int sum=0;
double av;
struct number t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%u",&num[i].shu);
sum+=num[i].shu;
}
av=((double)sum)/n;
for(i=0;i<n;i++)
{
if(num[i].shu>av)
num[i].cha=num[i].shu-av;
else
num[i].cha=av-num[i].shu;
}
for(i=0;i<n-1;i++)
for(j=0;j<n-1-i;j++)
{
if(num[j].cha<num[j+1].cha)
{
t=num[j];
num[j]=num[j+1];
num[j+1]=t;
}
}
printf("%d",num[0].shu);
for(i=1;num[i].cha==num[0].cha;i++)
printf(",%d",num[i].shu);
} | 21 |
10,057 | float abs(float a,int b)
{
if(a>b)
return(a-b);
else
return(b-a);
}
void bubble(int a[],int n)
{
int i,j,temp;
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;
}
}
}
}
void main()
{
int n,a[310],i,flag=0;
float s=0,p=0,max=-1.0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
bubble(a,n);
p=s/n;
for(i=0;i<n;i++)
{
if(abs(p,a[i])>max)
max=abs(p,a[i]);
}
for(i=0;i<n;i++)
{
if(abs(p,a[i])==max && flag==0)
{
printf("%d",a[i]);
flag=1;
}
else
if(abs(p,a[i])==max && flag==1)
printf(",%d",a[i]);
}
}
| 21 |
10,058 |
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 |
10,059 | void main()
{
int a[300],i,j,n,b;
double k=0,k1,k2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
k=k+a[i];
}
k=(k*1.0)/(n*1.0);
for(i=1;i<n;i++)
{ for(j=0;j<n-i;j++)
{
if(a[j]>a[j+1])
{
b=a[j];a[j]=a[j+1];a[j+1]=b;
}
}
}
k1=k-a[0];
k2=a[n-1]-k;
if(k1>k2)
{
printf("%d",a[0]);
}
if(k1<k2)
{
printf("%d",a[n-1]);
}
if(k1==k2)
{
printf("%d,%d",a[0],a[n-1]);
}
} | 21 |
10,060 | void main()
{
int i,j,n,num=0;
float average,n1,m,sn=0,a[300],b[300],max,k[300],p[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sn=sn+a[i];
}
n1=n;
average=sn/n1;
for(i=0;i<n;i++)
{
m=(average-a[i]);
b[i]=m*m;
}
max=b[0];
for(i=0;i<n;i++)
{
for(j=i;j<n;j++)
{
if(max>=b[j+1])
{
continue;
}
else if(max<b[j+1])
{
max=b[j+1];
}
}
}
memset(k,0,300);
for(j=0;j<n;j++)
{
if(b[j]==max)
{
k[j]=a[j];
num++;
}
}
j=0;
for(i=0;i<n;i++)
{
if(k[i]!=0)
{
p[j]=k[i];
j++;
}
}
if(j==1)
{
printf("%.f\n",p[0]);
}
if(j>1)
{
for(i=0;i<j-1;i++)
{
printf("%.f,",p[i]);
}
printf("%.f\n",p[j-1]);
}
return;
}
| 21 |
10,061 | int main()
{
int n, count=1, sum=0, i, j, temp,k;
double aver,temp2;
double dis[300];
int a[300];
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%d", &a[i]);
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
aver=(double)sum/n;
for(i=0;i<n;i++)
{
if(a[i]>aver)
dis[i]=a[i]-aver;
else
dis[i]=aver-a[i];
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i-1;j++)
{
if(dis[i]>dis[i+1])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
temp2=dis[i];
dis[i]=dis[i+1];
dis[i+1]=temp2;
}
}
}
for(i=n-2;i>0;i--)
{
if(dis[i]==dis[n-1])
count++;
}
k=0;
for(i=n-1;i>n-count;i--,k++)
{
for(j=n-1;j>n-count+k;j--)
{
if(a[i]>a[i-1])
temp=a[i];
a[i]=a[i-1];
a[i-1]=temp;
}
}
if(count>=2)
{
for(i=n-1;i>=n-count+1;i--)
{
printf("%d,", a[i]);
}
printf("%d", a[n-count]);
}
else
printf("%d", a[n-count]);
} | 21 |
10,062 | void main()
{
int n;
scanf("%d",&n);
float s=0;
int i=0,a[n];
while(i<n)
{
scanf("%d",&a[i]);
s=s+a[i];
i++;
}
s=s/n;
i=0;
float min=s,max=s;
while(i<n)
{
if(a[i]<min)
min=a[i];
if(a[i]>max)
max=a[i];
i++;
}
if(max-s>s-min)
printf("%.0f",max);
else
if(max-s<s-min)
printf("%.0f",min);
else
printf("%.0f,%.0f",min,max);
}
| 21 |
10,063 | void main()
{
int n,i,j;
int a[300];
float k=0.0,temp,tempo;
float b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
k=k+a[i];
}
k=k/n;
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-k);
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(b[i]<b[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
tempo=b[i];
b[i]=b[j];
b[j]=tempo;
}
}
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
if(b[i]==b[0])
printf(",%d",a[i]);
}
}
| 21 |
10,064 | int main()
{
int n,i,j,t,m,c=0,sum=0,ave;
int a[300],b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=sum/n;
for(i=0;i<n;i++)
b[i]=abs(a[i]*n-sum);
for(i=0;i<n;i++)
for(j=0;j<n-i-1;j++)
{
if(b[j]<b[j+1])
{
t=b[j];
b[j]=b[j+1];
b[j+1]=t;
m=a[j];
a[j]=a[j+1];
a[j+1]=m;
}
}
for(i=0;i<n&&b[i]==b[i+1];i++)
{
if(b[i]==b[i+1])
c++;
}
for(i=0;i<c;i++)
for(j=0;j<c-i-1;j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
for(i=0;i<=c;i++)
{
if(i==0)
printf("%d",a[i]);
else
printf(",%d",a[i]);
}
return 0;
} | 21 |
10,065 | void main()
{
int n, i, j, temp, num=0, *a;
float ave=0, *depart, max=0;
scanf("%d",&n);
a=(int *)malloc(n*sizeof(int));
depart=(float *)malloc(n*sizeof(float));
for(i=0; i<n; i++)
{
scanf("%d",a+i);
}
for(i=n-1; i>0; i--)
{
for(j=0; j<i; j++)
{
if(*(a+j)>*(a+j+1))
{
temp=*(a+j);
*(a+j)=*(a+j+1);
*(a+j+1)=temp;
}
}
}
//for(i=0; i<n; i++) printf("%d\n",*(a+i));
for(i=0; i<n; i++)
{
ave=ave+(float)*(a+i)/n;
}
for(i=0; i<n; i++)
{
*(depart+i)=ave-*(a+i);
if(*(depart+i)<0) *(depart+i)=-*(depart+i);
if(*(depart+i)>max) max=*(depart+i);
}
for(i=0; i<n; i++)
{
if(fabs(*(depart+i)-max)<1.0e-3) num=num+1;
}
//for(i=0; i<n; i++) printf("%f\n",*(depart+i));
//printf("!!!%f\n",max);
//printf("%d\n",num);
for(i=0; i<n; i++)
{
if(fabs(*(depart+i)-max)<1.0e-3)
{
printf("%d",*(a+i));
break;
}
}
i=i+1;
for(; i<n; i++)
{
if(fabs(*(depart+i)-max)<1.0e-3)
{
printf(",%d",*(a+i));
}
}
} | 21 |
10,066 |
int check(int m,int n,int k)
{
int i,out;
out=0;
for(i=m;i<=n;i++)
{
if(i%k==0)
{
if(i-m<k)
{
printf("%d",i);
out=1;
}
else
{
printf(",%d",i);
out=1;
}
}
}
if(out==0)
{
printf("no\n");
}
else printf("\n");
return k;
}
int main()
{
int n,i,num[100],sum=0,min=100,max=0;
float ave;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&num[i]);
sum+=num[i];
if (min>num[i]) min=num[i];
if (max<num[i]) max=num[i];
}
ave=(float)sum/n;
if (max-ave==ave-min) printf("%d,%d",min,max);
else if(max-ave>ave-min) printf("%d",max);
else printf("%d",min);
return 0;
} | 21 |
10,067 |
void main()
{
int n,i,j,a[300];
float sum=0,ave;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&(a[i]));
sum+=a[i];
}
ave=sum/n;
for (i=n-1;i>0;i--)
{
for (j=0;j<i;j++)
{
if (a[j]>a[j+1])
{
int tem;
tem=a[j];
a[j]=a[j+1];
a[j+1]=tem;
}
}
}
if((2*ave-a[0]-a[n-1])>0)
{
for(i=0;i<n;i++)
{
if(a[i]==a[0])
{
if (a[i+1]!=a[0]) printf("%d",a[i]);
else printf("%d,",a[i]);
}
}
}
if((2*ave-a[0]-a[n-1])<=0)
{
for(i=0;i<n;i++)
{
if((a[i]==a[n-1])||(a[i]+a[n-1])==2*ave)
{
if (i==n-1) printf("%d",a[i]);
else printf("%d,",a[i]);
}
}
}
} | 21 |
10,068 | 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 |
10,069 | 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 |
10,070 |
int main(int argc, char* argv[])
{
int n,sum=0,a[300];
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum += a[i];
}
float aver;
aver=(float)sum/n;
int j;
float b[300];
for(j=0;j<n;j++)
{
if((float)a[j]>aver)
{
b[j]=a[j]-aver;
}
else
{
b[j]=aver-a[j];
}
}
float c;
c=b[0];
int m,p=0,q=0;
for(m=1;m<n;m++)
{
if(b[m]>c)
{
c=b[m];
p=m;
}
}
int s;
for(s=p+1;s<n;s++)
{
if(b[s]==c)
{
q=s;
}
}
if(q==0)
{
printf("%d",a[p]);
}
if(q!=0)
{
if(a[p]>a[q])
{
printf("%d,%d",a[q],a[p]);
}
else
{
printf("%d,%d",a[p],a[q]);
}
}
return 0;
}
| 21 |
10,071 |
int main()
{
unsigned int i,n,a[M],flag=1;
double ave=0,max=0;
scanf("%u",&n);
for (i=0;i<n;i++)
{
scanf("%u",&a[i]);
ave+=a[i];
}
ave=ave/n;
for (i=0;i<n;i++)
{
double c;
if ((c=fabs(ave-a[i])-max)>0 && fabs(c)>E) max+=c;
}
for (i=0;i<n;i++)
if (fabs(fabs(a[i]-ave)-max)<E)
{
if (!flag) printf(",");
printf("%u",a[i]);
if (flag) flag=0;
}
return 0;
} | 21 |
10,072 | void main()
{
float a[300];
unsigned int b[300],i,j=0,n;
float sum=0,p,max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum+=a[i];
}
p=(float)sum/n;
for(i=0;i<n;i++)
if(fabs(a[i]-p)>max)
max=fabs(a[i]-p);
for(i=0;i<n;i++)
if(fabs(fabs(a[i]-p)-max)<0.01)
b[j++]=(int)a[i];
if(j==1)
printf("%d\n",b[0]);
else
for(i=0;i<j;i++)
printf("%d%c",b[i],i<j-1?',':'\n');
} | 21 |
10,073 |
int main()
{
int n;
cin >> n;
int iin[100];
int counter = 0;
for(int i = 0; i < n; i++){
cin >> iin[i];
counter = counter + iin[i];
}
//cout << counter << endl;
int buffer = 0;
for(int i = 0; i < n; i++){
if(abs((iin[i]*n-counter))>buffer)
buffer = abs(iin[i]*n-counter);
}
//cout << buffer << endl;
for(int i = 0; i < n-1; i++){
for(int j = i; j < n; j++){
if(buffer==abs(iin[i]*n-counter)&&buffer==abs(iin[i]*n-counter)&&(iin[i]>iin[j]))
swap(iin[i],iin[j]);
}
}
int buffer2 = 0;
for(int i = 0; i < n; i++){
if(buffer==abs(iin[i]*n-counter))
buffer2++;
}
for(int i = 0; i < n; i++){
if(buffer==abs(iin[i]*n-counter)&&buffer2!=1){
buffer2--;
cout << iin[i] << ',';
continue;
}
if(buffer==abs(iin[i]*n-counter)&&buffer2==1){
cout << iin[i];
}
}
return 0;
}
| 21 |
10,074 | void main()
{
int m,n,i,a[301],sum,max,min;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sum=0;max=a[0];min=a[0];
for (i=0;i<n;i++)
{
sum+=a[i];
if (a[i]>max) max=a[i];
if (a[i]<min) min=a[i];
}
max*=n;min*=n;
if ((max-sum)>(sum-min)) printf("%d",max/n);
if ((max-sum)<(sum-min)) printf("%d",min/n);
if ((max-sum)==(sum-min)) printf("%d,%d",min/n,max/n);
} | 21 |
10,075 | int main()
{
int n,i,j,k1,k2,k3,k4,z,h;
float a[1000],sum=0,s,b[1000],m,o,fl;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum=sum+a[i];
b[i]=a[i];
/* printf("%f,%f,%f\n",a[i],sum,b[i]);*/
}
s=sum/n;
/*printf("%f\n",s);*/
for(j=0;j<n;j++)
{
if(b[j]-s>0)
{
b[j]=b[j]-s;
}
else
{
b[j]=s-b[j];
}
/* printf("%f\n",b[j]);
*/ }
for(k1=1;k1<n;k1++)
{
for(k2=0;k2<n-k1;k2++)
{
if(a[k2]>a[k2+1])
{m=a[k2];
a[k2]=a[k2+1];
a[k2+1]=m;}
if(b[k2]>b[k2+1])
{o=b[k2];
b[k2]=b[k2+1];
b[k2+1]=o;}
}
}
/* for(k5=0;k5<n;k5++)
{
printf("%f, %f\n",a[k5],b[k5]);
}*/
fl=b[n-1];/*printf("fl=%f\n",fl);*/
for(k3=0;k3<n;k3++)
{
if((s-b[n-1]<a[k3]+0.01)&&(s-b[n-1]>a[k3]-0.01)||(s+b[n-1]<a[k3]+0.01)&&(s+b[n-1]>a[k3]-0.01))
{
printf("%.f",a[k3]);
z=k3;
break;}
}
for(k4=z+1;k4<n;k4++)
{
if((s-b[n-1]<a[k4]+0.01)&&(s-b[n-1]>a[k4]-0.01)||(s+b[n-1]<a[k4]+0.01)&&(s+b[n-1]>a[k4]-0.01))
{
printf(",%.f",a[k4]);}
}
return 0;
} | 21 |
10,076 | int main()
{
int n,a[310],i,temp;
double b[310],max=-100,ave,s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
ave=s/n;
for(i=0;i<n;i++)
{
b[i]=fabs(ave-a[i]);
if(b[i]>max)max=b[i];
}
for(i=0;i<n;i++)
if(fabs(b[i]-max)<0.0001){
printf("%d",a[i]);
temp=i;
break;
}
for(i=temp+1;i<n;i++)
if(b[i]==max)
printf(",%d",a[i]);
return 0;
}
| 21 |
10,077 | int main()
{
int n,i,k=0,j;
float a[300],b[300],c[300],m=0,t;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%f",&a[i]);
m=m+a[i];}
m=m/n;
for(i=0;i<n;i++){
b[i]=fabs(a[i]-m);}
t=b[0];
for(i=1;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++;}
}
if(k==1){printf("%.0f",c[0]);}
if(k>1){
for(j=k-1;j>0;j--){
for(i=0;i<j;i++){
if(a[i]>a[i+1]){
t=c[i];
a[i]=c[i+1];
c[i+1]=t;
}
}
}
for(i=0;i<k-1;i++){printf("%.0f,",c[i]);}
printf("%.0f",c[k-1]);}
return 0;
} | 21 |
10,078 | /*
* sub.cpp
*
* Created on: 2011-12-23
* Author: 11229
*/
/*
* ?????.cpp
*
* Created on: 2011-12-23
* Author: 11229
*/
void sort(double arr[100],int len);
int main()
{
int n,i,imax=0;
cin>>n;
double sum=0,array[301]={0},average=0,*p=NULL,distant[301]={0},*pdis=distant,
MAXdis=0,maxnum[100]={0},*pmax=maxnum;
p=array;
for(i=0;i<n;i++){
cin>>*(p+i);
sum+=*(p+i);
}
average=sum/(double)(n);
for(i=0;i<n;i++){
*(pdis+i)=abs(*(p+i)-average);
if(*(pdis+i)>MAXdis)MAXdis=*(pdis+i);
}
for(i=0;i<n;i++){
if(*(pdis+i)==MAXdis){
*(pmax+imax)=*(p+i);
imax++;
}
}
sort(maxnum,imax);
return 0;
}
void sort(double arr[100],int len)
{
double *pa=arr,temp=0;
int i,j;
for(i=0;i<len-1;i++)
for(j=0;j<len-i-1;j++){
if(*(pa+j)>*(pa+j+1)){
temp=*(pa+j);
*(pa+j)=*(pa+j+1);
*(pa+j+1)=temp;
}
}
for(i=0;i<len-1;i++)cout<<*(pa+i)<<',';
cout<<*(pa+len-1);
cout<<endl;
}
| 21 |
10,079 | void main()
{
int n,i,a[300],s,c[300];
float b[300],p,m;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0,s=0;i<n;i++)
s=s+a[i];
p=(float)s/(float)n;
for(i=0;i<n;i++)
{
b[i]=(float)a[i]-p;
if(b[i]<0)b[i]=0-b[i];
}
for(i=0,m=0;i<n;i++)
{if(b[i]>m-0.001)m=b[i];}
for(i=0,s=0;i<n;i++)
{
if(b[i]>m-0.001&&(float)a[i]<p-0.001)
{c[s]=a[i];s++;}
}
for(i=0;i<n;i++)
{
if(b[i]>m-0.001&&(float)a[i]>p+0.001)
{c[s]=a[i];s++;}
}
for(i=0;i<s-1;i++)
printf("%d,",c[i]);
printf("%d\n",c[s-1]);
}
| 21 |
10,080 | void main()
{
double n;
int i,j;
double sum=0.0;
int flag=1;
double average=0.0;
int a[300]={0},c[300]={-1},d[300]={0};//a[]???????d[]????????????a[k]
double b[300]={0.0};//b[]??????
scanf("%lf",&n);
for(i=0;i<n;i++)
{
c[i]=i;//c[]??????
scanf("%d",a+i);
sum=sum+*(a+i);
}
average=sum/n;
for(j=0;j<n;j++)
b[j]=fabs(a[j]-average);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
if(b[i]<b[j])
{
int t;
double p;
t=c[i];
c[i]=c[j];
c[j]=t;
p=b[i];
b[i]=b[j];
b[j]=p;
}
}
for(i=0;i<n;i++)
{
if(b[i]==b[i+1])
flag=flag+1;
else
break;//??break???????????????i=n-1??????flag??????
}
if(flag==1)
printf("%d",a[c[0]]);
else
{
{
for(i=0;i<flag;i++)
d[i]=a[c[i]];
}
for(i=0;i<flag;i++)
for(j=i;j<flag;j++)
{
if(d[i]>d[j])
{
int t;
t=d[i];
d[i]=d[j];
d[j]=t;
}
}
for(i=0;i<flag-1;i++)
printf("%d,",d[i]);
if(i==flag-1)
printf("%d",d[i]);
}
}
| 21 |
10,081 | void main()
{ int n,i,j,t;float p=0,m,w,q;int a[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{ p=p+a[i];}
m=(p/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;
}
}
}
w=m-a[0];q=a[n-1]-m;
if(w==q)printf("%d,%d",a[0],a[n-1]);
else if(w<q)printf("%d",a[n-1]);
else printf("%d",a[0]);
}
| 21 |
10,082 | void main()
{
int n,a[300],i,s=0,d[300],t=0;
double b,c[300],max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);s=s+a[i];
}
b=(double)s/n;
for(i=0;i<n;i++)
c[i]=fabs(a[i]-b);
for(i=0;i<n;i++)
{
if(max<c[i])
max=c[i];
}
for(i=0;i<n;i++)
{
if(c[i]==max)
{
d[t]=a[i];t++;
}
}
printf("%d",d[0]);
for(i=1;i<t;i++)
printf(",%d",d[i]);
} | 21 |
10,083 | void main()
{
int n,i,a[300],sum=0,k[300],m=0,j;
double ave,c[300],d;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){sum=sum+a[i];}
ave=1.0*sum/n;
for(i=0;i<n;i++){
if(a[i]*1.0-ave>=0){c[i]=a[i]*1.0-ave;}
else{c[i]=ave-a[i]*1.0;}
}
d=c[0];
for(i=1;i<n;i++){
if(d<c[i]){d=c[i];}
}
for(i=0;i<n;i++){
if(c[i] == d){
k[m] = a[i];
m++;
}
/* if(a[i]*1.0-ave>=0){
if(d==a[i]*1.0-ave)
{
k[m]=a[i];m=m+1;
}
}
else {
if(d==ave-a[i]*1.0)
{
k[m]=a[i];m=m+1;
}
}*/
}
if(m==1){printf("%d",k[0]);}
else if(m>1){
for(j=0;j<m-1;j++){printf("%d,",k[j]);}
printf("%d",k[m-1]);
}
}
| 21 |
10,084 | int main(){
int n,k=0;
cin>>n;
float a[n],ar,sum=0,max=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
ar=sum/n;
for(int i=0;i<n;i++)
if(abs(a[i]-ar)>=max)max=abs(a[i]-ar);
for(int i=0;i<n;i++)
if((abs(a[i]-ar)==max)&&k==0){cout<<a[i];
k++;
}
else if((abs(a[i]-ar)==max)&&k!=0){cout<<','<<a[i];
k++;
}
return 0;
} | 21 |
10,085 | void main()
{
int n,i,a[300],k,num=0;
double ave,b[300],sum=0,max=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;i++)
{
b[i]=fabs(a[i]-ave);
if(b[i]>max)
{
max=b[i];
}
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{
num++;
if(num==1)
printf("%d",a[i]);
else
printf(",%d",a[i]);
}
}
printf("\n");
} | 21 |
10,086 | 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 |
10,087 | int main()
{
double Numbers[500]={0};
double Temp[100]={-1};
double Ave=0;
double Sum=0;
double Max=0;
double Exchange=0;
int k=0;
int n=0;
int i=0;
int j=0;
cin>>n;
for (i=0;i<n;i++)
{cin>>Numbers[i];
Sum+=Numbers[i];}
Ave=Sum/n;
for (i=0;i<n;i++)
{ if (fabs(Numbers[i]-Ave)>Max)
{Max=fabs(Numbers[i]-Ave);}
}
for (i=0;i<n;i++)
{if (fabs(fabs(Numbers[i]-Ave)-Max)<1e-5)
{Temp[k]=Numbers[i];
k++;
}
}
if (k==1)
{cout<<Temp[0]<<endl;}
else
{ for (i=0;i<k-1;i++)
{ for (j=0;j<k-1;j++)
{ if (Temp[j]>Temp[j+1])
{ Exchange=Temp[j];
Temp[j]=Temp[j+1];
Temp[j+1]=Exchange;
}
}
}
cout<<Temp[0];
for (i=1;i<k;i++)
{cout<<","<<Temp[i];}
cout<<endl;
}
return 0;
}
| 21 |
10,088 | main()
{
int i,j,k;
float sum=0,t,n;
float a[300];
float aver,max;
float b[300];
scanf("%f",&n);
for(i=0;i<=n-1;i++)
{
scanf("%f",&a[i]);
sum=sum+a[i];
}
aver=sum/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-1;i++)
{
if(a[i]>aver)
b[i]=a[i]-aver;
else
b[i]=aver-a[i];
}
max=b[0];
for(i=0;i<=n-1;i++)
{
if(b[i]>=max)
{
max=b[i];
k=i;
}
}
for(i=0;i<k;i++)
{
if(b[i]==max)
printf("%.0f,",a[i]);
}
printf("%.0f",a[k]);
}
| 21 |
10,089 | float jue(float t)
{
if(t<0)
t=-t;
return t;
}
int main()
{
int n,a[300],shu[300];
scanf("%d",&n);
int i;
float s=0,ave,max,tem;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
ave=s/n;
max=jue(a[0]-ave);
int k=0;//k??
for(i=1;i<n;i++)
{
tem=jue(a[i]-ave);
if(tem>max)
max=tem;
}
for(i=0;i<n;i++)
{
if(jue(a[i]-ave)==max)
{
shu[k]=a[i];
k++;
}
}
int j,t;
for(i=0;i<k;i++)
{
for(j=i;j<k;j++)
{
if(shu[i]>shu[j])
{
t=shu[i];
shu[i]=shu[j];
shu[j]=t;
}
}
}
for(i=0;i<k-1;i++)
printf("%d,",shu[i]);
printf("%d",shu[k-1]);
return 0;
}
| 21 |
10,090 | int main()
{
int i,j;
int n,m;
double sum=0,av=0,b[1000],temp1;
cin>>n;
int a[1000]={0},temp2;
for(i=0;i<=n-1;i++)
cin>>a[i];
for(i=0;i<=n-1;i++)
sum=sum+a[i];
av=sum/n;
for(i=0;i<=n-1;i++)
b[i]=abs(a[i]-av);
for(i=0;i<=n-2;i++)
for(j=0;j<=n-2-i;j++)
if(b[j]<b[j+1])
{
temp1=b[j];
b[j]=b[j+1];
b[j+1]=temp1;
temp2=a[j];
a[j]=a[j+1];
a[j+1]=temp2;
}
for(i=0;i<=n-1;i++)
if(b[0]!=b[i])
{
m=i;
break;
}
cout<<a[0];
for(i=1;i<=m-1;i++)
cout<<","<<a[i];
return 0;
}
| 21 |
10,091 | int main()
{
int n, i, a[302], c[302], t = 0, temp, j;
double b[302], sum = 0, maxnum = 0;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a[i];
sum += a[i];
}
for (i = 1; i <= n; i++)
{
b[i] = fabs(sum / n - a[i]);
if (maxnum < b[i])
maxnum = b[i];
}
for (i = 1; i <= n; i++)
{
if(b[i] == maxnum)
{
c[t] = a[i];
t++;
}
}
cout << c[0];
for (i = 0; i < t; i++)
{
for (j = 0; j < t - 1 - i; j++)
{
if (c[j] > c[j + 1])
{
temp = c[j + 1];
c[j + 1] = c[j];
c[j] = temp;
}
}
}
for (i = 1; i < t; i++)
cout << "," << c[i];
cout << endl;
return 0;
} | 21 |
10,092 | void main()
{
int a[400]={0},c[400],n,i,j,m,temp,d[400],k;float b[400]={0},t,max,s=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
s=s+a[i];
t=s/n;
for(i=1;i<=n;i++)
{if(a[i]>=t)b[i]=a[i]-t;else b[i]=t-a[i];}
max=b[1];
for(i=1;i<=n;i++)
{if(b[i]>max)max=b[i];}
m=0;
for(i=1;i<=n;i++)
{if(b[i]>=max)c[m]=a[i];m++;}
for(j=0;j<m-1;j++)
for(i=0;i<m-1-j;i++)
if(c[i]>c[i+1])
{temp=c[i];c[i]=c[i+1];c[i+1]=temp;}k=0;
for(i=0;i<m;i++)
if(c[i]>0){d[k]=c[i];k++;}
printf("%d",d[0]);
for(i=1;i<k;i++)
printf(",%d",d[i]);
}
| 21 |
10,093 | int main()
{
int n,i,j;
double sum=0,ave=0;
double a[300];
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
ave=sum/n;
double dis[300];
for(i=0;i<n;i++)
{
dis[i]=fabs(a[i]-ave);
}
double max=0;
for(i=0;i<n;i++)
{
if(dis[i]>max)
max=dis[i];
}
double b[300]={0};
int k=0,temp=0;
for(i=0;i<n;i++)
{
if(fabs(dis[i]-max)<0.01)
{
b[k]=a[i];
k++;
}
}
if(k==1){cout<<b[0];}
else{
for(i=0;i<k;i++)
{
for(j=i+1;j<k;j++)
{
if(b[i]>b[j])
{
temp=b[i];
b[i]=b[j];
b[j]=temp;
}
}
}
cout<<b[0];
for(i=1;i<k;i++)
cout<<","<<b[i];}
return 0;
}
| 21 |
10,094 | int main()
{
int n,i, k,j=0,p;
float average,a[100],sum=0,c[100],d[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
}
for(i=0;i<n-1;i++)
{
for(k=0;k<n-i-1;k++)
{
if(a[i]>a[i+1])
{
float t=0;
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
}
for(i=0;i<n;i++)
{
sum+=a[i];
}
average=sum/n;
for(i=0;i<n;i++)
{
c[i]=average-a[i];
if(c[i]<0)
{
c[i]=a[i]-average;
}
}
float max=0;
for(i=0;i<n;i++)
{
if(c[i]>max)
{
max=c[i];
}
}
for(i=0;i<n;i++)
{
if(c[i]==max)
{
d[j]=a[i];
j++;
}
}
if(j==1)
{
printf("%.0f", d[j-1]);
}
else if(j>1)
{
for(p=0;p<j-1;p++)
{
printf("%.0f,", d[p]);
}
printf("%.0f",d[j-1]);
}
return 0;
}
| 21 |
10,095 | 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 |
10,096 | int main()
{
int n,i;
scanf("%d",&n);
int an[300]={0},sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&an[i]);
sum+=an[i];
}
float average;
average=sum*1.0/n;
float away[300]={0};
for(i=0;i<n;i++)
{
if(an[i]-average>=0)
{
away[i]=an[i]-average;
}
else
{
away[i]=average-an[i];
}
}
float f=away[0];
for(i=1;i<n;i++)
{
if(away[i]>=f)
{
f=away[i];
}
}
int max[10]={0},j,num=0;
for(i=0;i<n;i++)
{
if(away[i]==f)
{
num++;
max[num]=an[i];
}
}
if(num==1)
printf("%d",max[1]);
else
{
for(int m=num-1;m>0;m--)
{
for(int n=0;n<m;n++)
if(max[n]>max[n+1])
{
int ntmp=max[n];
max[n]=max[n+1];
max[n+1]=ntmp;
}
}
for(int p=1;p<=num;p++)
{
printf("%d",max[p]);
if(p<=num-1)
printf(",");
}
}
return 0;
} | 21 |
10,097 | 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 |
10,098 | int main ()
{
int n = 0, a[1000] = {0}, i = 0, j = 0;
double b[1000] = {0}; //n?????????a?????b????????
cin >> n;
double sum = 0, max = 0; //sum???????????max?????????
for(i = 0; i < n; i++)
{
cin >> a[i];
sum = sum + a[i];
}
sum = sum / n; //???????
for(i = 0; i < n - 1; i ++)
for(j = 0; j < n - i - 1; j ++)
if(a[j] > a[j + 1])
{
int temp = 0;
temp = a[i];
a[i] = a[i + 1];
a[i + 1] = temp;
} //??
for(i = 0; i < n; i ++)
b[i] = fabs(a[i] - sum); //?????????
for(i = 0; i < n; i ++)
if(b[i] > max)
max = b[i];
for(i = 0; i < n; i ++) //????????
if(b[i] == max)
{
cout << a[i];
break;
}
for(i = i + 1; i < n ; i ++)
if(b[i] == max)
cout << ',' << a[i];
return 0;
} | 21 |
10,099 | void bubble(int *p,int n)
{
int i=0,pass,temp;
for(pass=1;pass<=n;pass++)
{
for(i=0;i<n-pass;i++)
{
if(*(p)>*(p+1))
{
temp=*(p);
*(p)=*(p+1);
*(p+1)=temp;
}
}
}
return;
}
float ffabs(float x)
{
if(x>0)
return x;
else
return -x;
}
void main()
{
int n,i,*num,sum=0,*temp,r=0;
float ave,max=0.0;
scanf("%d",&n);
num=(int *)malloc(n*sizeof(int));
temp=(int *)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
scanf("%d",(num+i));
sum+=*(num+i);
}
ave=(float)sum/(float)n;
for(i=0;i<n;i++)
{
if(ffabs((float)*(num+i)-ave)>=max)
max=ffabs((float)*(num+i)-ave);
}
for(i=0;i<n;i++)
{
if(ffabs(ffabs((float)*(num+i)-ave)-max)<0.0000001)
{
*(temp+r)=*(num+i);
r++;
}
}
if(r==1)
{
printf("%d",*(temp+0));
}
else
{
bubble(temp,r);
for(i=0;i<r;i++)
{
printf("%d%c",*(temp+i),(i!=r-1?',':'\n'));
}
}
}
| 21 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.