id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
10,100 | void main()
{
int n,i,j=0,m,t,p=1,q;
float k,c,d;
int a[300];
float b[300];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
j=j+a[i];
}
c=j;
d=n;
k=c/d;
for(i=1;i<=n;i++)
{
if(a[i]>=k)
{
b[i]=a[i]-k;
}
else
b[i]=k-a[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n-i;j++)
if(b[j]<b[j+1])
{
t=b[j];
q=a[j];
b[j]=b[j+1];
a[j]=a[j+1];
b[j+1]=t;
a[j+1]=q;
}
}
for(i=1;i<=n;i++)
{
if(b[i]==b[i+1])
p++;
else
break;
}
for(i=1;i<=p;i++)
{
for(j=1;j<=p-i;j++)
if(a[j]>b[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
if(p==1)
printf("%d",a[1]);
if(p!=1)
{
for(i=1;i<p;i++)
{
printf("%d,",a[i]);
}
printf("%d",a[p]);
}
} | 21 |
10,101 | int s(int f[],int n)
{
int i,sum=0;
for(i=0;i<n;i++)
sum+=f[i];
return sum;
}
int dis(int x,int n,int sum)
{
int tp;
if((x*n)>sum)
tp=x*n-sum;
else
tp=sum-x*n;
return tp;
}
int max_d(int d[],int n,int sum)
{
int i,tp,max=0;
for(i=0;i<n;i++)
if(d[i]>max)
max=d[i];
return max;
}
void main()
{
int i,j=0,n,sum,l;
int f[300],d[300],out[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&f[i]);
sum=s(f,n);
for(i=0;i<n;i++)
d[i]=dis(f[i],n,sum);
l=max_d(d,n,sum);
for(i=0;i<n;i++)
{
if((f[i]*n<sum)&&(d[i]==l))
{
out[j]=f[i];
j++;
}
}
for(i=0;i<n;i++)
{
if((f[i]*n>sum)&&(d[i]==l))
{
out[j]=f[i];
j++;
}
}
printf("%d",out[0]);
for(i=1;i<j;i++)
printf(",%d",out[i]);
} | 21 |
10,102 | void main()
{
int i,n,t=0;
double a[300],b[300],sum=0.0,ave,max=0.0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%lf",&a[i]);
for(i=0;i<n;i++)
sum+=a[i];
ave=sum/(double)n;
for(i=0;i<n;i++)
{
if(ave>a[i])
b[i]=ave-a[i];
else b[i]=a[i]-ave;
if(b[i]>max)
max=b[i];
}
for(i=0;i<n;i++)
if(b[i]==max)
if(t==0)
{
printf("%.0lf",a[i]);
t++;
}
else
printf(",%.0lf",a[i]);
}
| 21 |
10,103 | 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 |
10,104 | void main()
{
int n,i,j,p=0;
float m,a[300],sum=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum=sum+a[i];
}
m=sum/n;
for(i=0;i<(n-1);i++)
{
for(j=(i+1);j<n;j++)
if(fabs(a[i]-m)<fabs(a[j]-m))
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
for(i=0;i<n;i++)
if(fabs(a[i]-m)==fabs(a[0]-m))
p=p+1;
for(i=0;i<(p-1);i++)
{
for(j=(i+1);j<p;j++)
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
printf("%.0f",a[0]);
for(i=1;i<p;i++)
{
printf(",%.0f",a[i]);
}
}
| 21 |
10,105 | 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 |
10,106 | void main()
{
int n,i,t[1000]={0},total=0,so[100]={0},temp=0,q=0,j=0;
double max=0.0,aver=0.0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t[i]);
for(i=0;i<n;i++)
total=total+t[i];
aver=(double)total/(double)n;
for(i=0;i<n;i++)
if(t[i]-aver>max||aver-t[i]>max)
{
if(t[i]-aver>0)
max=t[i]-aver;
else
max=aver-t[i];
}
for(i=0;i<n;i++)
if(t[i]-aver-max<0.00001&&max-(t[i]-aver)<0.00001||aver-t[i]-max<0.00001&&max-(aver-t[i])<0.00001)
{
so[q]=t[i];
q++;
}
for(i=0;i<q-2;i++)
for(j=0;j<q-1-i;j++)
{
if(so[j]<so[j+1])
{
temp=so[j];
so[j]=so[j+1];
so[j+1]=temp;
}
}
printf("%d",so[0]);
for(i=1;i<q;i++)
printf(",%d",so[i]);
} | 21 |
10,107 | int main()
{
int i;
double b[301],av,sum = 0,n,a[301];
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
sum = sum + a[i];
}
av = sum / n;
for(i = 0; i < n;i++)
{
b[i] = fabs(a[i] - av);
}
double max = 0;
int count = 0, c[301];
c[0] = 0;
for(i = 0; i < n; i++)
{
if(max < b[i])
{
count = 0;
memset(c,0,sizeof(c[301]));
max = b[i];
c[count] = i;
}
if(fabs(max - b[i]) < 1e-5)
{
count++;
c[count] = i;
}
}
for(i = 0; i <= count; i++)
for(int j = 0; j <= count - i - 1; j++)
{
double temp;
if(a[c[j+1]] > a[c[j]])
{
temp = a[c[j]];
a[c[j]] = a[c[j+1]];
a[c[j+1]] = temp;
}
}
cout << a[c[count]];
if(count >= 1)
{
for(i = count - 2; i >= 0; i--)
cout <<"," << a[c[i]];
}
cout << endl;
return 0;
}
| 21 |
10,108 |
int main(int argc, char* argv[])
{
int n,i=0,j=0,r[300],sum=0,l=0,k=0;
double aver,cha[300],max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&r[i]);
sum=sum+r[i];
}
aver=sum*1.0/n;
for(i=0;i<n;i++)
{
cha[i]=fabs(aver-r[i]);
}
for(i=0;i<n;i++)
{
if(cha[i]>max)
{
max=cha[i];
}
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
l++;
}
}
if(l==0)
{
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
printf("%d",r[i]);
}
}
}
else
{
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
k++;
if(k<l)
{
printf("%d,",r[i]);
}
else
{
printf("%d",r[i]);
}
}
}
}
return 0;
}
| 21 |
10,109 | //#include<string.h>
int i,n,a[1000],max,min;
float aver;
int main(){
scanf("%d",&n);
scanf("%d",&a[0]);
min=a[0];max=a[0];aver=a[0];
for(i=1;i<n;i++){
scanf("%d",&a[i]);
aver+=a[i];
if(a[i]>max) max=a[i];
if(a[i]<min) min=a[i];
}
aver/=n;
if(max+min-aver*2==0) printf("%d,%d\n",min,max);
if(max+min-aver*2<0) printf("%d\n",min);
if(max+min-aver*2>0) printf("%d\n",max);
scanf("%d",&i);
return 0;
}
| 21 |
10,110 | void main()
{
unsigned int n,a[300],i,sum=0,max,min;
float m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
m=(float)sum/n;
max=a[0];
min=a[0];
for(i=0;i<n;i++)
{
if(max<a[i])
max=a[i];
if(min>a[i])
min=a[i];
}
if(((float)max-m)>(m-(float)min))
printf("%d",max);
else if(((float)max-m)<(m-(float)min))
printf("%d",min);
else if(((float)max-m)==(m-(float)min))
printf("%d,%d",min,max);
} | 21 |
10,111 | void main()
{
int n,i,j,k,a[300];
float d=0,m=0,p=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);d=d+a[i];
}
d=(float)d;
d=d/n;
for(i=0;i<n;i++)
{
if(a[i]-d>=0)
{if(a[i]-d>p)
{p=a[i]-d;j=i;}}
else
{if(d-a[i]>m)
{m=d-a[i];k=i;}
}
}
if(p>m)
printf("%d",a[j]);
else if(p<m)
printf("%d",a[k]);
else printf("%d,%d",a[k],a[j]);
} | 21 |
10,112 |
void main()
{
float num[300];
int n,i,j;
float temp;
float max1,max2;
float a,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&num[i]);
for(i=0;i<n;i++)
sum=sum+num[i];
a=sum/(float)n;
for(i=0;i<n;i++)
{ for(j=0;j<n-i-1;j++)
if(num[i]>num[i+1])
{
temp=num[i];
num[i]=num[i+1];
num[i+1]=temp;
}
}
max1=num[0];
for(i=1;num[i]<a;i++)
{
if((a-num[i])>(a-max1))
max1=num[i];
}
max2=num[n-1];
for(i=n-1;num[i]>a;i++)
{
if((num[i]-a)>(a-max2))
max2=num[i];
}
if((a-max1)==(max2-a))
printf("%.0f,%.0f",max1,max2);
else if((a-max1)>(max2-a))
printf("%.0f",max1);
else
printf("%.0f",max2);
} | 21 |
10,113 | void main()
{
int i,j=0,n;
double p,b[300],max,a[300],sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
sum=sum+a[i];
}
p=sum/n;
for(i=0;i<n;i++)
{
if(a[i]>=p)
b[i]=a[i]-p;
else b[i]=p-a[i];
}
max=b[0];
for(i=1;i<n;i++)
{
if(b[i]>max)
{
max=b[i];
}
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{
printf("%.0lf",a[i]);
break;
}
}
for(j=i+1;j<n;j++)
{
if(b[j]==max)
printf(",%.0lf",a[j]);
}
printf("\n");
}
| 21 |
10,114 | /*
* 1000012889_1.cpp
*
* Created on: 2011-1-9
* Author: ???
* ??? ?????
*/
int main(){
int n,i;
double a,max=0,min=0,sum=0,ave=0;
cin>>n;
for(i=0;i<n;i++){
cin>>a;
sum+=a;
if(i==0){
max=a;
min=a;
}
else{
if(a>max)
max=a;
else if(a<min)
min=a;
}
}
ave=sum/n;
if(max-ave>ave-min)
cout<<max<<endl;
else if(max-ave<ave-min)
cout<<min<<endl;
else
cout<<min<<','<<max<<endl;
return 0;
}
| 21 |
10,115 | void main(void)
{
int a[300], b[300];
int n, i, j;
float max, sum = 0, ave;
scanf("%d", &n);
for(i = 0;i < n;i ++)
{
scanf("%d",&a[i]);
sum += a[i];
}
ave = sum / n;
for(i = 0;i < n;i ++)
{
for(j = 0;j < n - 1;j ++)
if(a[j] > a[j + 1])
{
max = a[j];
a[j] = a[j + 1];
a[j + 1] = max;
}
}
if(ave - a[0] > a[n - 1] - ave)
max = ave - a[0];
else
max = a[n - 1] - ave;
j = 0;
for(i = 0;i < n;i ++)
if(fabs(fabs(a[i] - ave) - max) < 1e-5)
{ b[j] = a[i];
j++;
}
for(i = 0;i < j - 1;i ++)
printf("%d,",b[i]);
printf("%d",b[j - 1]);
} | 21 |
10,116 | int main()
{
int a[300],b[300]={1};
int n,i,j,count=0;
double total=0.0,result=0.0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
total+=a[i];
}
result=total/n;
double max=0.0;
for(i=0;i<n;i++)
{
if((double)fabs((a[i]-result))-max>0.00001)
max=fabs(a[i]-result);
}
for(i=0,j=0;i<n;i++)
{
if(fabs(fabs(a[i]-result)-max)<0.00001)
{
b[j]=a[i];
count++;
j++;
}
}
int t;
for(i=0;i<count-1;i++)
for(j=i;j<count-1;j++)
{
if(b[j]>b[j+1])
{
t=b[j];
b[j]=b[j+1];
b[j+1]=t;
}
}
cout<<b[0];
for(i=1;i<count;i++)
cout<<","<<b[i];
return 0;
} | 21 |
10,117 | void main()
{
int n,i,a[300]={0},c=0,j,temp2;
float b,temp1,f[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
c=c+a[i];
}
b=(float)c/(float)n;
for(i=0;i<n;i++)
{
if((float)a[i]-b>=0)
f[i]=(float)a[i]-b;
else f[i]=b-(float)a[i];
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(f[j]<f[j+1])
{
temp1=f[j];
f[j]=f[j+1];
f[j+1]=temp1;
temp2=a[j];
a[j]=a[j+1];
a[j+1]=temp2;
}
}
}
i=0;
while(f[i]==f[i+1])
i=i+1;
if(i==0)
printf("%d",a[0]);
else
{
for(j=0;j<i;j++)
{
printf("%d,",a[j]);
}
printf("%d",a[i]);
}
} | 21 |
10,118 | struct
{float a;
float c;
}num[401];
void main()
{
int n,i,j;
float sum=0,b,h=0,k;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%f",&num[i].a);
for(i=0;i<n;i++)
{
sum=sum+num[i].a;
}
b=sum/n;
for(i=0;i<n;i++)
{
num[i].c=fabs(num[i].a-b);
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-1;i++)
{
if(num[i].c<num[i+1].c)
{num[400]=num[i];
num[i]=num[i+1];
num[i+1]=num[400];
}}
}
for(i=1;i<n;i++)
{
if(num[i].c==num[0].c)
h=h+1;
}
for(j=0;j<h-1;j++)
{
for(i=0;i<h-1;i++)
{
if(num[i].c>num[i+1].c)
{num[400]=num[i];
num[i]=num[i+1];
num[i+1]=num[400];
}}
}
printf("%.0f",num[0].a);
for(i=1;i<h+1;i++)
printf(",%.0f",num[i].a);
} | 21 |
10,119 | int main()
{
int i,n,t=0,count=0,j;
float k,sum=0,a[300],b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
k=(float)sum/(float)n;
for(i=0;i<n;i++)
{
if(a[i]>=k)
b[i]=a[i]-k;
else b[i]=k-a[i];
}
float x=b[0];
for(i=1;i<n;i++)
{
if(b[i]>x)
{
x=b[i];
t=i;
}
}
j=n;
for(i=0;i<n;i++)
{
if(b[i]==b[t])
{
if(i!=t) j=i;
}
}
if(j!=n)
{
if(a[t]<a[j])
printf("%.0f,%.0f\n",a[t],a[j]);
else printf("%.0f,%.0f\n",a[j],a[t]);
}
else printf("%.0f\n",a[t]);
return 0;
} | 21 |
10,120 |
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 |
10,121 | struct num
{
int a;
double b;
}num[300];
void main()
{
int n,i,j;
double sum=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num[i].a);
sum=sum+num[i].a;
}
t=sum/n;
for(i=0;i<n;i++)
{
if(num[i].a>t)
num[i].b=num[i].a-t;
else
num[i].b=t-num[i].a;
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(num[j].b<num[j+1].b)
{
num[300]=num[j];
num[j]=num[j+1];
num[j+1]=num[300];
}
}
}
if(num[0].b!=num[1].b)
printf("%d\n",num[0].a);
else if(num[0].b==num[1].b)
{
printf("%d",num[0].a);
printf(",%d\n",num[1].a);
}
}
| 21 |
10,122 | void main()
{
int a[300],c[300]={0},i,j,n,k=0,l=0;
float z=0,b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
z=z+a[i];
z=z/n;
for(i=0;i<n;i++)
{if(a[i]>z)
b[i]=a[i]-z;
else b[i]=z-a[i];
}
for(i=0;i<n;i++)
{for(j=0;j<n;j++)
{if(b[j]>b[i])
c[i]++;}
}
for(i=0;i<n;i++)
{if(c[i]==0)
k++;}
for(i=0;i<n;i++)
{if(c[i]==0)
{l++;
if(l==k)
printf("%d",a[i]);
else printf("%d,",a[i]);}
}
} | 21 |
10,123 |
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 |
10,124 | int main()
{struct student
{
double a;
double b;
};
struct student stu[300];
struct student temp;
int n,i,j,t=1;
double s=0.0;
double max=0.0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%lf",&stu[i].a);
s+=stu[i].a;
}
s=s/n;
for(i=0;i<n;i++){
stu[i].b=stu[i].a-s;
if(stu[i].b<0)
stu[i].b=-stu[i].b;
}
for(j=1;j<n;j++){
for(i=0;i<n-j;i++){
if(stu[i].a>stu[i+1].a){
temp=stu[i];
stu[i]=stu[i+1];
stu[i+1]=temp;
}
}
}
for(i=0;i<n;i++)
if(stu[i].b>max)
max=stu[i].b;
for(i=0;i<n;i++){
if(stu[i].b==max){
if(t==1){
printf("%.0lf",stu[i].a);
t=2;
}
else
printf(",%.0lf",stu[i].a);
}
}
return 0;
}
| 21 |
10,125 | 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 |
10,126 | int main(){
int n,i,j=0,p;
float in[301],sum=0,sm;
float b[301],max=0, t[301],f[301];
cin>>n;
for(i=0;i<n;i++){
cin>>in[i];
sum+=in[i];}
float k;
k=sum/n;//?????
for(i=0;i<n;i++){
if(in[i]>k){
b[i]=in[i]-k;}
else b[i]=k-in[i];
}
for(i=0;i<n;i++){
if(b[i]>max)
max=b[i];
}
for(i=0;i<n;i++){
if(b[i]==max){
t[j]=b[i];
f[j]=in[i];
j++;
}
}
for(i=0;i<j;i++){
for(p=j;p>i;p--){
if(f[p]<f[p-1]){
sm=f[p];f[p]=f[p-1];f[p-1]=f[p];
}
}
}
for(i=0;i<j-1;i++)
cout<<f[i]<<',';
cout<<f[j-1]<<endl;
return 0;
} | 21 |
10,127 | void main()
{
int i,n,a[305],sum,z;
int aver,x=0,y;
scanf("%d",&n);
for(i=0,sum=0;i<n;i++)
{scanf("%d",&a[i]);sum+=a[i];}
aver=(sum+n-2)/n;
for(i=0;i<n;i++)
{y=a[i]-aver;
if(y<0) y=0-y;
if(x<y) x=y;}
for(i=0;;i++){
y=a[i]-aver;
if(y==x||y==0-x) {printf("%d",a[i]),z=i;break;}
else continue;}
for(i=z+1;i<n;i++){
y=a[i]-aver;
if(y==x||y==0-x) printf(",%d",a[i]);}
}
| 21 |
10,128 | void main()
{
int n,a[300],i,max,mat,t=0,sum=0;
float ave;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
ave=(float)sum/n;
max=a[0];
for(i=1;i<n;i++)
{
if(fabs(a[i]-ave)>fabs(max-ave))
max=a[i];
else if(fabs(a[i]-ave)==fabs(max-ave))
{
t=1;
mat=a[i];
}
}
if(t==0)
printf("%d",max);
else
printf("%d,%d",max,mat);
}
| 21 |
10,129 | 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 |
10,130 |
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 |
10,131 | int main()
{
int n,i,flag;
int a[300];
double sum,ave,max;
double b[300];
scanf("%d",&n);
sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
ave=sum/n;
for(i=0;i<n;i++)
{
b[i]=((double)a[i]-ave);
if(b[i]<0)
b[i]=-b[i];
}
max=b[0];
for(i=1;i<n;i++)
{
if(b[i]>max)
{
max=b[i];
}
}
flag=0;
for(i=0;i<n;i++)
{
if(b[i]==max)
{
if(flag==0)
{
printf("%d",a[i]);
flag=1;
}
else
{
printf(",%d",a[i]);
}
}
}
return 0;
}
| 21 |
10,132 | void main()
{
int n,i,j,a[301],sum,t;
float average;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(sum=0,i=1;i<=n;i++)
sum=sum+a[i];
average=(float)sum/n;
for(i=1;i<n;i++)
for(j=i;j<n;j++)
if(a[j]>a[j+1]){t=a[j];a[j]=a[j+1];a[j+1]=t;}
if(average-a[1]>a[n]-average)printf("%d",a[1]);
else if(average-a[1]<a[n]-average)printf("%d",a[n]);
else printf("%d,%d",a[1],a[n]);
}
| 21 |
10,133 | void main()
{
int a[300];
int n,i,j;long s=0;
float b,t,k[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
b=(double)s/n;
t=fabs(a[0]-b);
for(i=0;i<n;i++)
{
k[i]=fabs(a[i]-b);
if(k[i]>t)
t=k[i];
}
for(i=0;i<n;i++)
if(k[i]==t)
{printf("%d",a[i]);
j=i+1;
break;
}
for(i=j;i<n;i++)
if(k[i]==t)
printf(",%d",a[i]);
}
| 21 |
10,134 |
int main(int argc, char* argv[])
{
int n,i,a[300],s=0;
double t,max=0;
int x,y,flag;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s+=a[i];
}
t=(float)s/n;
for(i=0;i<n;i++)
{
if(fabs(a[i]-t)>max)
{
x=a[i];
max=fabs(a[i]-t);
flag=0;
}
else if(fabs(a[i]-t)==max)
{
y=a[i];
flag=1;
}
}
if(flag){
if(x>y){
printf("%d,%d",y,x);
}
else{
printf("%d,%d",x,y);
}
}
else{
printf("%d",x);
}
return 0;
}
| 21 |
10,135 | 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 |
10,136 | /* Name : ?????
* Version : 1.0
* Date : 2013-01-12
* New :
* Description :
* State : Design
*/
int main()
{
int N=0;
double Num[300]={0},Diff[300]={0},Extre[300]={0};
double Average=0,Sum=0;
double Max=0;
cin>>N;
for (int i=0;i<N;i++)
{
cin>>Num[i];
Sum+=Num[i];
}
Average=Sum/(double)N;
for (int i=0;i<N;i++)
{
Diff[i]=Num[i]-Average;
if (Diff[i]<0) Diff[i]=-Diff[i];
if (Max<Diff[i]) Max=Diff[i];
}
int K=0;
for (int i=0;i<N;i++)
if (Diff[i]==Max)
{
Extre[K]=Num[i];
K++;
}
for (int i=0;i<K;i++)
for (int k=0;k<K-1;k++)
if (Extre[k]>Extre[k+1])
{
double temp=Extre[k];
Extre[k]=Extre[k+1];
Extre[k+1]=temp;
}
cout<<Extre[0];
for (int i=1;i<K;i++) cout<<','<<Extre[i];
return 0;
}
| 21 |
10,137 | void main()
{
int n,sum=0,max=0;
int i,j,t,a[400];
float f,f1,f2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
f=(double)sum/n;
for(i=0;i<n-1;i++)
for(j=0;j<n-1-i;j++)
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
f1=(double)a[0];
f2=(double)a[n-1];
if(fabs(f-f1)==fabs(f-f2))
printf("%d,%d",a[0],a[n-1]);
else if(fabs(f-f1)>fabs(f-f2))
printf("%d",a[0]);
else
printf("%d",a[n-1]);
}
| 21 |
10,138 | int main()
{
int i,j,sum;
int n,p=0;
double x,temp;
int a[301],c[301];
double b[301];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(i=0,sum=0;i<=n-1;i++)
{
sum=sum+a[i];
}
x=(1.0*sum)/n;
for(i=0;i<=n-1;i++)
{
if(a[i]-x<0)
{
b[i]=x-a[i];
}
else
{
b[i]=a[i]-x;
}
}
for(i=0;i<=n-2;i++)
{
for(j=0;j<=n-2-i;j++)
{
if(b[j+1]>b[j])
{
temp=b[j];
b[j]=b[j+1];
b[j+1]=temp;
}
}
}
for(i=0;i<=n-1;i++)
{
if(a[i]-x==b[0]||a[i]-x==(-1*b[0]))
{
c[p]=a[i];
p++;
}
}
for(i=0;i<=p-2;i++)
{
for(j=0;j<=p-2-i;j++)
{
if(c[j+1]<c[j])
{
temp=c[j];
c[j]=c[j+1];
c[j+1]=temp;
}
}
}
if(c[0]==15)
{
printf("15");
}
else
{
printf("%d",c[0]);
for(i=1;i<=p-1;i++)
{
printf(",%d",c[i]);
}
}
return 0;
} | 21 |
10,139 |
int main(int argc, char* argv[])
{
int n,i,sum=0;
scanf("%d",&n);
float average;
int b[300];
int *a;
a=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
average=(float)sum/n;
int max=a[0];
for(int j=0;j<n;j++)
{
if(a[j]>max)
{
max=a[j];
}
}
int min=a[0];
for(int k=0;k<n;k++)
{
if(a[k]<min)
{
min=a[k];
}
}
if((max-average)>(average-min))
{
printf("%d",max);
}
else if((max-average)<(average-min))
{
printf("%d",min);
}
else
{
printf("%d,%d",min,max);
}
return 0;
}
| 21 |
10,140 | /*
* 1234.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main()
{
int i,c=0,t=0,n;
double sum=0;
double a[301],b[301];
double s;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
sum+=a[i];
s=sum/n;
double max=0;
for(i=0;i<n;i++)
{ if(abs(s-a[i])>=max)
max=abs(s-a[i]);
}
for(i=0;i<n;i++)
{ if(abs(s-a[i])==max) {b[t++]=a[i];
c++;}
}
for(i=0;i<c-1;i++)
cout<<b[i]<<",";
cout<<b[c-1]<<endl;
return 0;
}
| 21 |
10,141 | int main()
{
int n, i,shu[300],he=0,j;
double a;
scanf ("%d", &n);
for (i=0; i<n; i++)
{
scanf ("%d", &shu[i]);
he=he+shu[i];}
a = (double)he / n;
for (i=0;i<n;i++)
{ for (j=n-1;j>=1;j--)
{ int t;
if (shu[j-1]>shu[j]){
t = shu[j-1];
shu[j-1]=shu[j];
shu[j]=t;}
}
}
if ((a-shu[0])>(shu[n-1]-a))
printf ("%d", shu[0]);
else if ((a-shu[0])<(shu[n-1]-a))
printf ("%d", shu[n-1]);
else if ((a-shu[0])==(shu[n-1]-a)&&shu[0]!=shu[n-1])
printf ("%d,%d", shu[0], shu[n-1]);
return 0;
}
| 21 |
10,142 |
int main()
{
int n,a[300]={0},b[300]={0},i,sum=0,j,temp;
double aver,dist,temp1;
scanf("%d\n",&n);
scanf("%d",&a[0]);
for(i=1;i<n;i++)
scanf(" %d",&a[i]);
for(i=0;i<n-1;i++)
for(j=i;j<n-1-i;j++)
if(a[j]>a[j+1]) {temp=a[j];a[j]=a[j+1];a[j+1]=temp;}
for(i=0;i<n;i++)
sum+=a[i];
aver=sum/(double)n;
dist=fabs(a[0]-aver);
for(i=0;i<n;i++)
if(dist<fabs(a[i]-aver))
dist=fabs(a[i]-aver);
for(i=0;i<n;i++)
if(fabs(dist-fabs(a[i]-aver))<1e-9)
{printf("%d",a[i]);break;}
for(j=i+1;j<n;j++)
if(fabs(dist-fabs(a[j]-aver))<1e-9)
{printf(",%d",a[j]);}
printf("\n");
}
| 21 |
10,143 | 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 |
10,144 | 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 |
10,145 |
int main()
{ int n;
int c[300];
scanf("%d",&n);
int i; int sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&c[i]);
sum+=c[i];
}
double b;
b=(double)sum/n;
double largest=0;
double d[300]={0};
for(i=0;i<n;i++)
{
if(c[i]>b)
d[i]=(double)c[i]-b;
else
{
d[i]=b-(double)c[i];
}
if(d[i]>largest)
largest=d[i];
}
int j; int e;double m;
for(i=0;i<n;i++){
for(j=n-1;j>i;j--)
{
if(c[j]<c[j-1])
{ e=c[j-1];
c[j-1]=c[j];
c[j]=e;
m=d[j-1];
d[j-1]=d[j];
d[j]=m;
}
}
}
for(i=0;i<n;i++)
{
if(d[i]==largest)
{printf("%d",c[i]);
d[i]=0;
break;}
} for(i=0;i<n;i++)
{
if(d[i]==largest)
{printf(",%d",c[i]);
}
}
return 0;
}
| 21 |
10,146 | int main()
{
int n,i,t,j,x[300],s[300],k=0;
double a,y[300],sum=0,b=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&x[i]);
sum+=x[i];
}
a=sum/n;
for(i=0;i<n;i++)
{
if(x[i]>a){y[i]=x[i]-a;}
if(x[i]<a){y[i]=a-x[i];}
}
for(i=0;i<n;i++)
{
if(y[i]>b){b=y[i];}
}
for(i=0;i<n;i++)
{
if(y[i]==b){
s[k]=x[i];
k=k+1;
}
}
for(i=0;i<k;i++)
{
for(j=k-1;j>i;j--)
{
if(s[j]<s[j-1])
{
t=s[j];
s[j]=s[j-1];
s[j-1]=t;
}
}
}
for(i=0;i<k-1;i++)
{
printf("%d,",s[i]);
}
printf("%d",s[k-1]);
return 0;
}
| 21 |
10,147 | 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 |
10,148 | /*
* 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 |
10,149 | 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 |
10,150 | void main()
{
int a[301],i,j,n,sum=0,max,temp;
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=i+1;j<=n-1;j++)
if(a[j]<a[i])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
if((a[0]+a[n-1])*n==sum*2)
printf("%d,%d\n",a[0],a[n-1]);
else if((a[0]+a[n-1])*n<sum*2)
printf("%d\n",a[0]);
else if((a[0]+a[n-1])*n>sum*2)
printf("%d\n",a[n-1]);
}
| 21 |
10,151 | void main()
{
int n,i,j,k,m;
unsigned int a[301],c[301],t,b=0,d;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
b=b+a[i];
d=abs(a[0]*n-b);
for(i=1;i<n;i++)
if(abs(a[i]*n-b)>d) d=abs(a[i]*n-b);
j=0;
for(i=0;i<n;i++)
if(abs(a[i]*n-b)==d)
{
c[j]=a[i];
j++;
}
for(i=0;i<j-1;i++)
{
k=i;
for(m=i+1;m<j;m++)
if(c[m]<c[k]) k=m;
t=c[k];c[k]=c[i];c[i]=t;
}
for(i=0;i<j;i++)
if(i!=j-1) printf("%d,",c[i]);
else printf("%d\n",c[i]);
} | 21 |
10,152 | /*/?? - ?????
?? ??-From Whf
??
?? n ???????????????????????????????????????????????????????????????????n ???300
????6???3?6?7?1?5?4????? 26/6=4.33?? 1 ??????
????
?1????????? n?
?2???? n ??????????????
????
???????????????????????????????????????????????????
????
7
1 2 3 4 5 6 7
????
1,7
/*/
void main(){
int n,a[300],sum=0,i,j,temp,sign=0;
float p,dis;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum=sum+a[i];
}
p=(float)(sum)/n;
for(i=0;i<n;i++){
for(j=0;j<n-1-i;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
//printf("%f",p);
if(p-(float)a[0]==(float)a[n-1]-p){
for(i=0;i<n;i++){
if(a[i]==a[0])
if(sign==0){
printf("%d",a[i]);
sign=1;
}
else{
printf(",%d",a[i]);
}
if(a[i]==a[n-1])
if(sign==0){
printf("%d",a[i]);
sign=1;
}
else{
printf(",%d",a[i]);
sign=1;
}
}
}
else {
if(p-(float)a[0]>(float)a[n-1]-p){
dis=p-(float)a[0];
printf("%d",a[0]);
sign=0;
}
else{
dis=(float)a[n-1]-p;
sign=1;
}
//printf("%f",dis);
for(i=0;i<n;i++){
if(sign==0&&i==0||sign==1&&i==n-1)
continue;
if(sign==0&&a[i]==a[0]){
printf(",%d",a[i]);
}
else if(sign==1&&a[i]==a[n-1]){
printf("%d,",a[i]);
}
}
if(sign==1)
printf("%d",a[n-1]);
}
} | 21 |
10,153 | int main()
{
int a[123];
float b[123];
int m,n,i,j,k,t,flag=0;
float s=0.0,max=0.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++)
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++)
{
b[i]=(float)fabs(a[i]-s);
}
for(i=0;i<n;i++)
{
if(b[i]>max)
max=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{
if(flag==1)
printf(",");
printf("%d",a[i]);flag=1;
}
}
return 0;
} | 21 |
10,154 |
void main()
{
int n,i,sum=0,flag=0;float max=0,p;
int a[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
p=(float)sum/n;
//printf("%f\n",p);
//printf("%d\n",fabs(a[0]-p));
for(i=0;i<n;i++)
{
if((a[i]-p>max)||(p-a[i]>max))
max=fabs(a[i]-p);
}
//printf("%f\n",max);
for(i=0;i<n;i++)
{
//printf("%f\n%f\n",fabs(a[i]-p)-max,pow(10,-6));
if(fabs(fabs(a[i]-p)-max)<pow(10,-6))
{
if(flag==0) {printf("%d",a[i]);flag=1;}
else printf(",%d",a[i]);
}
}
}
| 21 |
10,155 | int main(int argc, char* argv[])
{
int n,i,c[300],k;
double a=0,b[300];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&c[i]);
a+=c[i];
}
a/=n;
for(i=0;i<n;i++){
b[i]=c[i]-a;
}
for(i=n-1;i>0;i--){
for(k=0;k<i;k++){
if(b[k]>b[k+1]){
double t=b[k];
b[k]=b[k+1];
b[k+1]=t;}
}
}
if(b[n-1]==0-b[0])
printf("%.0lf,%.0lf",b[0]+a,b[n-1]+a);
else if(b[n-1]<0-b[0])
printf("%.0lf",b[0]+a);
else if(b[n-1]>0-b[0])
printf("%.0lf",b[n-1]+a);
return 0;
}
| 21 |
10,156 | 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 |
10,157 |
int main()
{
int n, i, a[10000];
double sum = 0;
cin >> n;
for (i = 0; i < n; i++)
{
cin>>a[i];
sum += a[i];
}
double aver;
aver = sum / n;
int max = a[0], min = a[0];
for (i = 1; i < n; i++)
{
if (a[i] > max) max = a[i];
if (a[i] < min) min = a[i];
}
if (fabs((max - aver) - (aver - min)) < 1e-6 ) cout << min << "," << max;
else if ((max - aver) > (aver - min)) cout << max;
else cout << min;
return 0;
}
| 21 |
10,158 | int main()
{
int n, i, j, a[301], sum = 0, p;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a[i];
sum = sum + a[i];
}
for (j = 1; j < n; j++)
{
for (i = 1; i <= n -j; i++)
{
if (a[i] > a[i+1])
{
p = a[i];
a[i] = a[i+1];
a[i+1] = p;
}
}
}
int g[301],num[301] = {0};
double sum1, aver, b[301], q= 0;
sum1 = sum;
aver = sum1 /n;
for (i = 1; i <= n; i++)
{
if (a[i] - aver < 0) b[i] = aver - a[i];
else b[i] = a[i] -aver;
if (b[i] > q)
{
q = b[i];
}
}
for (i = 1; i <= n; i++)
{
if (b[i] == q)
{
num [i] = i;
}
}
q = 1;
for (i = 1; i <= n; i++)
{
if (num[i] == 0) continue;
else
{
g[i] = q;
q++;
}
}
for (i = 1; i <= n; i++)
{
if (num[i] == 0) continue;
else
{
if (g[i] == 1) cout <<a[i];
else
{
cout << "," << a[i];
}
}
}
return 0;
}
| 21 |
10,159 | int main()
{
int n,sum=0,i,m[350],max,j,cha[350];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m[i]);
sum=sum+m[i];
}
cha[0]=abs(m[0]*n-sum);
max=cha[0];
j=0;
for(i=1;i<n;i++)
{
cha[i]=abs(m[i]*n-sum);
if(cha[i]>max)
{
max=cha[i];
j=i;
}
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
if(i==j)
{
printf("%d",m[i]);
}
else
{
printf(",%d",m[i]);
}
}
}
return 0;
}
| 21 |
10,160 | int main()
{
int i,j,tmp,n,sum=0,p=0;
double average=0,b[300]={0},max=0;
int a[300]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
{
if(a[j]>a[j+1])
{
tmp=a[j+1];
a[j+1]=a[j];
a[j]=tmp;
}
}
average=(sum*1.0)/(n*1.0);
for(i=0;i<n;i++)
b[i]=fabs(a[i]-average);
for(i=0;i<n;i++)
if(max<b[i]) max=b[i];
for(i=0;i<n;i++)
{ if(b[i]==max) {printf("%d",a[i]); p=i;break;}}
for(i=p+1;i<n;i++)
if(b[i]==max) printf(",%d",a[i]);
return 0;
}
| 21 |
10,161 | main()
{
unsigned int n,i,j=0,k,a[310],b[310],t,sum=0;
float ave,max=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
ave=sum/(float)n;
for (i=0;i<n;i++)
if (fabs(a[i]-ave)>max) max=fabs(a[i]-ave);
for (i=0;i<n;i++)
if (fabs(fabs(a[i]-ave)-max)<0.00001) b[j++]=a[i];
for (i=0;i<j-1;i++)
for (k=i+1;k<j;k++)
if (b[i]>b[k])
{
t=b[k];
b[k]=b[i];
b[i]=t;
}
for (i=0;i<j;i++)
{
if (i!=0) printf(",");
printf("%d",b[i]);
}
printf("\n");
return 0;
} | 21 |
10,162 | int main()
{
int n,num[300],i,count=0,j;
float sum=0,ave,cha[300],max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
sum+=num[i];
}
ave=sum/n;
for(i=0;i<n;i++)
{
cha[i]=fabs(num[i]-ave);
if(cha[i]>max)
{
max=cha[i];
}
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
count++;
}
}
if(count==1)
{
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
printf("%d",num[i]);
}
}
}
if(count==2)
{
for(i=0;i<n;i++)
{
if(cha[i]==max&&num[i]<ave)
{
printf("%d,",num[i]);
}
if(cha[i]==max&&num[i]>ave)
{
printf("%d",num[i]);
}
}
}
return 0;
} | 21 |
10,163 | int compare(const void *a ,const void * b)
{
return *(int *)a-*(int *)b;
}
int main()
{
unsigned int n;
int a[300];
double sum=0,avg;
int i;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
qsort(a,n,sizeof(int),compare);
avg=sum/n;
if(fabs(fabs(a[0]-avg)-fabs(a[n-1]-avg))<1*1e-5)
{
cout<<a[0]<<","<<a[n-1]<<endl;
return 0;
}
if(fabs(a[0]-avg)-fabs(a[n-1]-avg)>1*1e-5)
cout<<a[0]<<endl;
else
cout<<a[n-1]<<endl;
}
| 21 |
10,164 | int main()
{
int a[400];
double sum=0;//???????????????
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
sort(a, a + n);//??????????
double average = sum / n;//????
if (a[0] == a[n - 1])cout << a[0] << endl;
else if (a[n-1] - average>average - a[0])cout << a[n-1]<<endl;
else if (a[n-1] - average == average - a[0])cout << a[0] << ',' << a[n-1]<<endl;
else cout << a[0] << endl;
return 0;
} | 21 |
10,165 | 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 |
10,166 | int main()
{
int n,sum=0,i,j,a[301],temp;
double ave;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",(a+i));
for(i=0;i<n;i++)
sum+=*(a+i);
ave=(double)sum/(double)n;
for(j=1;j<n;j++)
{
for(i=0;i<n-j;i++)
{
if(fabs(ave-*(a+i))<fabs(ave-*(a+i+1)))
{
temp=*(a+i);
*(a+i)=*(a+i+1);
*(a+i+1)=temp;
}
}
}
temp=0;
for(i=0;i<n;i++)
{
if(fabs(ave-*(a+i))!=fabs(ave-*(a+i+1)))
{
if(temp==0)
{
printf("%d",*(a+i));
temp++;
}
else
printf(",%d",*(a+i));
break;
}
else
{
if(temp==0)
{
printf("%d",*(a+i));
temp++;
}
else
printf(",%d",*(a+i));
}
}
printf("\n");
return 0;
} | 21 |
10,167 | /*
* temp2.cpp
*
* Created on: 2011-12-22
* Author: apple
*/
int main()
{
int n,num[100];
float len[100],max=0,ave,sum=0;
cin>>n;
for(int i=0;i<n;i++)
{cin>>num[i];
sum+=num[i];
}
ave=sum/n;
for(int i=0;i<n;i++)
{
len[i]=num[i]-ave;
if(len[i]<0) len[i]=0-len[i];
if(len[i]>max)
max=len[i];
}
int j=0,store[100];
for(int i=0;i<n;i++)
if(len[i]==max)
{store[j]=num[i];j++;}
int l=j,temp;
if(l==1)cout<<store[0]<<endl;
else {
for(int j=0;j<l-1;j++)
for(int i=j;i<l;i++)
if(store[i]>store[i+1])
{
temp=store[i];
store[i]=store[i+1];
store[i+1]=temp;
}
cout<<store[0];
for(int i=1;i<l;i++)
cout<<","<<store[i];
cout<<endl;
}
}
| 21 |
10,168 | void main()
{
int a[100],n,i,min=0,max=0;
float sum=0,aver,s,t;
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
aver=sum/n;
for(i=0;i<=n-1;i++){
if(a[i]<a[min]){
min=i;
}
if(a[i]>a[max]){
max=i;
}
}
s=aver-a[min];
t=a[max]-aver;
if(s>t){
printf("%d\n",a[min]);
}
else if(s<t){
printf("%d\n",a[max]);
}
else if(s==t){
printf("%d,%d\n",a[min],a[max]);
}
} | 21 |
10,169 | int main()
{
int i,j,k,p,temp,x[300],z[300];
float ave,total,y[300],max=0;
total=0;
p=0;
scanf("%d",&k);
for(i=0;i<=k-1;i++)
{
scanf("%d",&x[i]);
total+=x[i];
}
ave=total/k;
for(i=0;i<=k-1;i++)
y[i]=(fabs)(x[i]-ave);
for(i=0;i<=k-1;i++)
{
if(y[i]>max) max=y[i];
}
for(i=0;i<=k-1;i++)
{
if((max-y[i])<0.00001)
{
z[p]=x[i];
p++;
}
}
for(i=0;i<=p-2;i++)
{
for(j=i+1;j<=p-1;j++)
{
if(z[j]<z[i])
{
temp=z[j];
z[j]=z[i];
z[i]=temp;
}
}
}
printf("%d",z[0]);
for(i=1;i<=p-1;i++)
printf(",%d",z[i]);
return 0;
} | 21 |
10,170 | void main()
{
int a[300],n,i,j1=0,j2=0,sum=0;
double ave,qq=0.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++)
{
if(qq<fabs(a[i]-ave))
{
qq=fabs(a[i]-ave);
j1=i;
}
if(qq==fabs(a[i]-ave)&&a[i]!=a[j1])
j2=i;
}
if(fabs(a[j1]-ave)==fabs(a[j2]-ave))
{
if(a[j1]>a[j2]) printf("%d,%d",a[j2],a[j1]);
else if(a[j1]==a[j2]) printf("%d",a[j1]);
else printf("%d,%d",a[j1],a[j2]);
}
else printf("%d",a[j1]);
}
| 21 |
10,171 | void main()
{
int n,i,j,sum=0,count=0,temp,m=0;
int s[301],res[301]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&s[i]);
sum+=s[i];
}
for(i=0;i<n;i++)m=max(m,abs(s[i]*n-sum));
for(i=0;i<n;i++)if(abs(s[i]*n-sum)==m)res[count++]=i;
for(i=0;i<count;i++)
{
for(j=0;j<count-1;j++)
{
if(s[res[j]]>s[res[j+1]])
{
temp=res[j];
res[j]=res[j+1];
res[j+1]=temp;
}
}
}
for(i=0;i<count;i++)
{
printf("%d",s[res[i]]);
if(i<count-1)printf(",");
}
putchar(10);
} | 21 |
10,172 | 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 |
10,173 | int main()
{
int n,a[300];
double b[300];
cin >> n;
int i,begin=0;
double average,sum=0,max,counter=0;
for(i=0;i<n;i++)
{
cin >> a[i];
sum=sum+a[i];
}
average=sum/n;
for(i=0;i<n;i++)
{
if( a[i] > average)
{
b[i] = a[i] - average;
}
if( a[i] < average )
{
b[i] = average - a[i];
}
}
max= b[0];
for(i=1;i<n;i++)
{
if( b[i] > max)
{
max = b[i];
begin = i;
}
}
for (i=0;i<n;i++)
{
if( fabs(b[i] - max) < 1e-5)
{
counter++;
}
}
if(counter >= 2)
{
cout << a[begin];
for( i= begin+1;i<n;i++)
{
if( fabs(b[i] - max) < 1e-5)
{
cout << "," << a[i];
}
}
}
else cout << a[begin] << endl;
return 0;
} | 21 |
10,174 | int main()
{
int a[300], n, i,j,sum=0, t;
float aver, c=0;
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-1;i++)
for(j=0;j<n-1-i;j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
if(aver-a[0]>a[n-1]-aver)
printf("%d",a[0]);
else if(aver-a[0]<a[n-1]-aver)
printf("%d",a[n-1]);
else
printf("%d,%d",a[0],a[n-1]);
return 0;
} | 21 |
10,175 |
int main()
{
int n;
int a[300];
cin>>n;
int i,j;
float average=0;
for(i=0;i<=n-1;i++)
{
cin>>a[i];
average+=a[i];
}
average/=n;
for(i=0;i<=n-2;i++)
for(j=n-1;j>=i+1;j--)
{
if(a[j]<a[j-1]){
int t=a[j];
a[j]=a[j-1];
a[j-1]=t;
}
}
float s=(average-a[0])-(a[n-1]-average);
if(s>0)cout<<a[0];
else if(s<0)cout<<a[n-1];
else cout<<a[0]<<','<<a[n-1];
return 0;
} | 21 |
10,176 | void main()
{ int n,i,j;float t,sum,b[100];unsigned a[100],max,min;
scanf("%d",&n);
for(i=0;i<n-1;i++)
scanf("%u ",&a[i]);scanf("%u",&a[n-1]);
sum=0.0;
for(i=0;i<n;i++)
sum=sum+a[i];
t=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];}
if(max-t==t-min)printf("%d,%d",min,max);
else if(max-t>t-min)printf("%d",max);
else printf("%d",min);
}
| 21 |
10,177 | 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 |
10,178 | void main()
{
int a[300],n,i,j,temper;
float average,sum=0,b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
average=sum/n;
//printf("%f",average);
for(i=0;i<n;i++)
{
if(a[i]>average)
b[i]=a[i]-average;
else
b[i]=average-a[i];
}
//for(i=0;i<n;i++)
//{
//printf("%d",b[i]);
//}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(b[i]<b[j])
{temper=a[i];
a[i]=a[j];
a[j]=temper;
temper=b[i];
b[i]=b[j];
b[j]=temper;}
}
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
if(b[i]==b[0])
printf(",%d",a[i]);
}
}
| 21 |
10,179 |
int main ()
{
int n , sum = 0 , i = 0,flag = 0 , k = 0, j = 0;
float a[301] = {0}, dis[301] = {0}, max = 0 , pai[301]={0} ,temp = 0 ,ave = 0 ;
cin >> n;
for ( i = 0; i < n; i++)
{
cin >> a[i];
sum = sum + a[i];
}
ave =(float) sum / n;
for( i = 0; i < n ;i++)
{
dis[i] = fabs(a[i] - ave);
if( dis[i] > max)
max = dis[i];
}
for( i = 0; i < n; i++)
{
if( fabs(dis[i] - max)< 1e-5)
{
pai[k++] = a[i];
}
}
for( i = 0; i < k -1 ; i++)
{
for( j = 0; j < k - i - 1; j++)
{
if( pai[j] > pai[j+1])
{
temp = pai[j];
pai[j] = pai[ j+1];
pai[j+1] = temp;
}
}
}
for( i = 0 ; i < k; i ++)
{
if( flag == 0)
{
cout << pai[i];
flag = 1;
}
else
cout << "," << pai[i];
}
return 0;
}
| 21 |
10,180 | int main()
{
int n,a[300],i,b[300]={15},j=0,m,temp2;
double sum=0,temp,ave;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=sum/n;
temp=fabs(a[0]-ave);
for(i=0;i<n;i++)
{
if(fabs(a[i]-ave)>temp)
{
temp=fabs(a[i]-ave);
}
}
for(i=0;i<n;i++)
{
if(fabs(a[i]-ave)==temp)
{
b[j]=a[i];
j++;
}
}
for(i=1;i<j;i++)
{
for(m=0;m<j-i;m++)
{
if(b[m]>b[m+1])
{
temp2=b[m];
b[m]=b[m+1];
b[m+1]=temp2;
}
}
}
printf("%d",b[0]);
for(m=1;m<j;m++)
{
printf(",%d",b[m]);
}
printf("\n");
return 0;
} | 21 |
10,181 | int main()
{
int n,i,j;
double s=0,max=0,a[100],t;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
s+=a[i];
}
s/=n;
for(i=0;i<n;i++)
for(j=0;j<n-1;j++)
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
if(s-a[0]==a[n-1]-s)
cout<<a[0]<<','<<a[n-1];
else if(s-a[0]>a[n-1]-s)
cout<<a[0];
else
cout<<a[n-1];
return 0;
}
| 21 |
10,182 | void average(int a[],float b[])
{
int n=0,sum=0,i;
float aver;
for(;a[n]!=0;n++)
sum+=a[n];
aver=(float)sum/n;
for(i=0;i<n;i++)
b[i]=a[i]-aver;
}
float max(float b[],int n)
{
int i,k=0;
for(i=0;i<n;i++)
if(fabs(b[i])>fabs(b[k])) k=i;
return fabs(b[k]);
}
void main()
{
int n,a[300]={0},i,j=0;
float b[300]={0},c;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
average(a,b);
c=max(b,n);
for(i=0;i<n;i++)
{
if(b[i]==(-c))
{
if(j!=0) printf(",");
printf("%d",a[i]);
j++;
}
}
for(i=0;i<n;i++)
{
if(b[i]==c)
{
if(j!=0) printf(",");
printf("%d",a[i]);
}
}
printf("\n");
}
| 21 |
10,183 | float f(float a)
{
if(a<0)
return -a;
else
return a;
}
int main()
{
float n;
cin>>n;
double a[100];
int i,j;
float sum=0;
for(i=1;i<=n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
float ave,t;
ave=sum/n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n-i;j++)
{
if(a[j+1]<a[j])
{
t=a[j];a[j]=a[j+1];a[j+1]=t;
}
}
}
float max=f(a[1]-ave);
for(i=2;i<=n;i++)
{
if(f(a[i]-ave)>max)
max=f(a[i]-ave);
}
float z=0;
for(i=1;i<=n;i++)
{
if((f(a[i]-ave)==max)&&(z==0))
{
cout<<a[i];
z=1;
continue;
}
if((f(a[i]-ave)==max)&&(z==1))
{
cout<<",";
cout<<a[i];
z=1;
}
}
return 0;
} | 21 |
10,184 | void main()
{
int n,i,j,a[400],sum=0,t;
float p,max=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
p=(float)sum/(float)n;
for(i=0;i<=n-2;i++)
{
for(j=0;j<=n-2-i;j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
for(i=0;i<=n-1;i++)
{
if(fabs(a[i]-p)>max)
max=fabs(a[i]-p);
}
for(i=0,j=0;i<=n-1;i++)
{
if(fabs(fabs(a[i]-p)-max)<=0.00001)
{
if(j==0)
printf("%d",a[i]);
else
printf(",%d",a[i]);
j++;
}
}
printf("\n");
}
| 21 |
10,185 | 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 |
10,186 | int main()
{
int n;
cin >> n;
double num[500] = {0};
int nums[500] = {0};
int i, j;
double sum = 0;
for(i = 0; i < n; i ++)
{
cin >> num[i];
sum += num[i];
}
sum = sum / n;
double max = 0;
for (i = 0; i < n; i ++)
{
double s = fabs(num[i] - sum);
if(s > max)
{
max = s;
}
}
int shou = 0;
for (i = 0; i < n; i ++)
{
double p = fabs(num[i] - sum);
if(fabs(p - max) < 1e-6)
{
if(shou != 0)
{
cout << ",";
}
shou = 1;
cout << num[i];
}
}
return 0;
} | 21 |
10,187 | void main()
{
int i,j,x=0;
float m=0,k,b[300],c[300],d,a[300],n;
scanf("%f",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
for(i=0;i<n;i++)
{
m=m+a[i];
}
k=m/n;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(a[j]>a[j+1])
{
d=a[j];
a[j]=a[j+1];
a[j+1]=d;
}
}
}
for(i=0;i<n;i++)
{
if(a[i]>=k)
b[i]=a[i]-k;
else
b[i]=k-a[i];
}
for(i=0;i<n;i++)
c[i]=b[i];
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(c[j]<c[j+1])
{
d=c[j];
c[j]=c[j+1];
c[j+1]=d;
}
}
}
for(i=0;i<n;i++)
{
if(b[i]==c[0])
{
if(x!=0)
printf(",%d",(int)a[i]);
else
printf("%d",(int)a[i]);
x++;
}
}
}
| 21 |
10,188 | 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;
}
}
int main()
{
int n,a[MAX],b[MAX],sum=0,i,k=0,flag=0;
double c[MAX];
double avr;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
for (i=0;i<n;i++)
sum=sum+a[i];
avr=(double) sum/(double) n;
for (i=0;i<n;i++)
{
c[i]=avr-(double)a[i];
if (c[i]<0)
c[i]=-c[i];
}
double max=avr-(double)a[0];
if (max<0)
max=-max;
for (i=1;i<n;i++)
{
if (c[i]>=max)
max=c[i];
}
for (i=0;i<n;i++)
if(max==c[i])
{
b[k]=a[i];
k++;
}
if (k==1)
printf("%d",b[0]);
else
{
bubble(b,k);
printf("%d",b[0]);
for (i=1;i<k;i++)
printf(",%d",b[i]);
}
return 0;
} | 21 |
10,189 | void main()
{int n,i,j,k,t,max,min,pian,a[300],all,b[20];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
min=a[0];
max=a[0];
all=a[0];
for(i=1;i<n;i++)
{all=all+a[i];
if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
min=min*n;
max=max*n;
pian=(max-all)>(all-min)?(max-all):(all-min);
j=0;
for(i=0;i<n;i++)
if(((a[i]*n-all)==pian)||((a[i]*n-all)==(-pian)))
{b[j]=a[i];
j++;}
for(i=0;i<j;i++)
for(k=i+1;k<j;k++)
if(b[k]<b[i])
{t=b[i];
b[i]=b[k];
b[k]=t;
}
printf("%d",b[0]);
for(i=1;i<j;i++)
printf(",%d",b[i]);
}
| 21 |
10,190 | int main()
{
int n;
double in[400];
double cha[400]={0};
int i,j,k,s=0;
double temp=0;
int flag[400]={0};
double to=0,aver;
cin>>n;
for(i=0;i<=n-1;i++){
cin>>in[i];
to=to+in[i];
}
aver=to/n;
//cout<<aver<<endl;
for(i=0;i<=n-1;i++){
cha[i]=fabs(in[i]-aver);
// cout<<cha[i]<<endl;
}
for(i=0;i<=n-1;i++){
if(temp<cha[i]){
temp=cha[i];
}
}
//cout<<temp;
for(i=0;i<=n-1;i++){
if(fabs(cha[i]-temp)<=0.00000001){
flag[s]=i;
s++;
}
}
for(i=0;i<=s-2;i++){
cout<<in[flag[i]]<<",";
}
cout<<in[flag[s-1]]<<endl;
return 0;
} | 21 |
10,191 | void main()
{
int n,i,j,k,t,a[300],sum=0,s=0;
float average,b[300],max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n-1;i++) //????
{
k=i;
for(j=i+1;j<n;j++)
{
if(a[k]>a[j]) k=j;
}
if(k!=i)
{
t=a[i];
a[i]=a[k];
a[k]=t;
}
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
average=(float)sum/n;
for(i=0;i<n;i++)
{
if(a[i]-average>0) b[i]=a[i]-average;
else if(a[i]-average<=0) b[i]=average-a[i];
}
for(i=1,max=b[0],k=1;i<n;i++)
{
if(b[i]>=max)
{
max=b[i];
k=k+1;
}
}
if(k==1)
{
for(i=0;i<n;i++)
{
if(max==b[i])
{
printf("%d\n",a[i]);
}
}
}
else if(k>1)
{
for(i=0,s=0;i<n;i++)
{
if(max==b[i])
{
if(s==0)
{
printf("%d",a[i]);
s++;
}
else if(s!=0)
{
printf(",%d",a[i]);
}
}
}
}
} | 21 |
10,192 | int main()
{
int i,n,j,l,a[500];
float k;
scanf("%d",&n);
for(i=0,k=0;i<n;i++)
{
scanf("%d",&a[i]);
k=k+a[i];
}
k=k/n;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
if(a[j]<a[i])
{
l=a[j];a[j]=a[i];a[i]=l;
}
}
if(k-a[0]*1.0>a[n-1]*1.0-k)
printf("%d",a[0]);
if(k-a[0]*1.0<a[n-1]*1.0-k)
printf("%d",a[n-1]);
if(k-a[0]*1.0==a[n-1]*1.0-k)
printf("%d,%d",a[0],a[n-1]);
return 0;
} | 21 |
10,193 | /*
* 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,imin=0;
cin>>n;
double sum=0,array[301]={0},average=0,*p=NULL,distant[301]={0},*pdis=distant,
MAXdis=0,MINdis=100000,maxnum[100]={0},minnum[100]={0},*pmax=maxnum,*pmin=minnum;
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);
//if(*(pdis+i)<MINdis)MINdis=*(pdis+i);
}
for(i=0;i<n;i++){
if(*(pdis+i)==MAXdis){
*(pmax+imax)=*(p+i);
imax++;
}
//if(*(pdis+i)==MINdis){
//*(pmin+imin)=*(p+i);
//imin++;
//}
}
sort(maxnum,imax);
//sort(pmin,imin);
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,194 | 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 |
10,195 | int main(){
int a[100],i,n;
float ave,b[100],k=0,m=0,t=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
m=m+a[i];
}
ave=(float)m/n;
for(i=0;i<n;i++)
{
b[i]=fabs((float)(a[i]-ave));
if(b[i]>k)
k=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==k){
t++;
if(t==1)
printf("%d",a[i]);
else printf(",%d",a[i]);
}
}
return 0;
} | 21 |
10,196 | int main()
{
int i,j,k,n,max,min,temp;
int a[300];
float ave;
int sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=sum*1.0/n;
/* printf("%d %f",sum,ave);*/
for(i=0;i<n;i++)
{
for(j=n-1;j>i;j--)
{
if(a[j]>a[j-1])
{
temp=a[j-1];
a[j-1]=a[j];
a[j]=temp;
}
}
}
/*for(i=0;i<n;i++)
{
printf("%d",a[i]);
}*/
max=a[0];
min=a[n-1];
if(max-ave>ave-min)
{
for(i=n-1;i>=0;i--)
{
if(a[i]==max)
{
printf("%d",a[i]);
k=i-1;
break;
}
}
for(i=k;i>=0;i--)
{
if(a[i]==max)
{
printf(",%d",a[i]);
}
}
}
if(max-ave<ave-min)
{
for(i=n-1;i>=0;i--)
{
if(a[i]==min)
{
printf("%d",a[i]);
k=i-1;
break;
}
}
for(i=k;i>=0;i--)
{
if(a[i]==min)
{
printf(",%d",a[i]);
}
}
}
if((max-ave-ave+min<0.00001)&&(max-ave-ave+min>-0.000001))
{
for(i=n-1;i>=0;i--)
{
if(a[i]==min||a[i]==max)
{
printf("%d",a[i]);
k=i-1;
break;
}
}
for(i=k;i>=0;i--)
{
if(a[i]==min||a[i]==max)
{
printf(",%d",a[i]);
}
}
}
}
| 21 |
10,197 | 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 |
10,198 | int main()
{
int n;
scanf("%d", &n);
int i;
int x[100];
int sum=0;
for(i=0;i<n;i++)
{
scanf("%d", &x[i]);
sum=sum+x[i];
}
float aver;
aver=(float)sum/n;
float y[100];
for(i=0;i<n;i++)
{
y[i]=fabs(x[i]-aver);
}
float max=y[0];
for(i=1;i<n;i++)
{
if(y[i]-max>0)
{
max=y[i];
}
}
int z[100];
int m=0;
for(i=0;i<n;i++)
{
if(fabs(y[i]-max)<pow(10,-9))
{
z[m]=x[i];
m++;
}
}
int o,w;
for(i=1;i<m;i++)
{
for(o=0;o<m-i;o++)
{
if(x[o]>x[o+1])
{
w=z[o];
z[o]=z[o+1];
z[o+1]=w;
}
}
}
printf("%d", z[0]);
for(i=1;i<m;i++)
{
printf(",%d", z[i]);
}
return 0;
}
| 21 |
10,199 | void main()
{
int n,i,a[300],c[300],j,p=1,t;
float ave,x=0,b[300],m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
x=x+a[i];
b[i]=0;c[i]=0;
}
ave=x/n;
for(i=0;i<n;i++)
{
if(ave>=a[i])
b[i]=ave-a[i];
else b[i]=a[i]-ave;
if(i>0)
{
if(b[i]>m)
{
m=b[i];
for(j=0;j<p;j++)
c[j]=0;
c[0]=a[i];
p=1;
}
else
{
if(b[i]==m)
{
c[p]=a[i];
p=p+1;
}
}
}
else
{
m=b[0];
c[0]=a[0];
}
}
for(j=0;j<p;j++)
for(i=0;i<p-1-j;i++)
if(c[i]>c[i+1])
{
t=c[i];
c[i]=c[i+1];
c[i+1]=t;
}
printf("%d",c[0]);
for(i=1;i<p;i++)
printf(",%d",c[i]);
} | 21 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.