label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
21 | 10400 | void swap(double num[],int a,int b){
double s = num[a];
num[a] = num[b];
num[b] = s;
return;
}
int divide(double num[],int a,int b){
int k = a-1;
for(int i = a;i<b;i++){
if(num[i]<num[b]) swap(num,++k,i);
}
swap(num,++k,b);
return k;
}
void qsort(double num[],int a,int b){
if(a<b){
int q = divide(num,a,b);
qsort(num,a,q-1);
qsort(num,q+1,b);
}
return;
}
double abs(double s){
if(s>0) return s;
return -s;
}
int main(){
int n;
double num[1010],sum;
cin>>n;
for(int i = 0;i<n;i++){
cin>>num[i];
sum+=num[i];
}
qsort(num,0,n-1);
sum/=n;
double a = abs(num[n-1]-sum),b = abs(num[0]-sum);
if(a<b) cout<<num[0]<<endl;
else if(a==b) printf("%d,%d\n",(int)num[0],(int)num[n-1]);
else cout<<num[n-1]<<endl;
return 0;
}
|
21 | 10401 | int main()
{
int n, i, j, num[1000], sum=0, t;
double ans=0;
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%d", &num[i]);
sum+=num[i];
}
ans=(double)sum/n;
for(i=0;i<n;i++){
for(j=n-1;j>i;j--){
if(num[j-1]>num[j]){
t=num[j];
num[j]=num[j-1];
num[j-1]=t;}
}
}
if(num[n-1]-ans==ans-num[0]){
printf("%d,%d", num[0], num[n-1]);}
else if(num[n-1]-ans>ans-num[0]){
printf("%d", num[n-1]);}
else if(num[n-1]-ans<ans-num[0]){
printf("%d", num[0]);}
return 0;
}
|
21 | 10402 | 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 | 10403 | int main()
{
int n=0,i=0,j=0,k=1;
double pj=0.0,zh=0.0,max=0.0;
int a[1000]={0};
double b[1000]={0.0};
cin>>n;
for (i=0;i<n;i++)
cin>>a[i];
for (i=0;i<n;i++)
zh=zh+a[i];
pj=zh/n;
for (i=0;i<n;i++)
{
if (a[i]>pj)
b[i]=a[i]-pj;
else
b[i]=pj-a[i];
}
for (i=0;i<n;i++)
{
if (max<b[i])
max=b[i];
}
for (i=0;i<n;i++)
{
if (max==b[i]&&i!=n-1)
{
for (j=1;j<n-i;j++)
{
if (max!=b[i+j])
k=k*1;
if (max==b[i+j])
k=0;
}
if (k==0)
cout<<a[i]<<",";
if (k==1)
cout<<a[i]<<endl;
}
if (max==b[i]&&i==n-1)
cout<<a[i]<<endl;
}
return 0;
}
|
21 | 10404 | 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 | 10405 | void main()
{
int n,i,j,t,sum=0,max=0,s=0;
int a[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(i=0;i<n;i++)
{
if(a[i]*n-sum>=0)
{
if(a[i]*n-sum>max) max=a[i]*n-sum;
}
else
{
if(sum-a[i]*n>max) max=sum-a[i]*n;
}
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-1-j;i++)
{
if(a[i]>a[i+1])
{
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
}
for(i=0;i<n;i++)
{
if(a[i]*n-sum==max||sum-a[i]*n==max)
{
if(s==0) printf("%d",a[i]);
else printf(",%d",a[i]);
s++;
}
}
} |
21 | 10406 | void main()
{
int n,i,j,a[300]={0};
float sum=0,ave,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
for(j=0;j<(n-i);j++)
{ if(a[j]>a[j+1])
{temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;}}
for(i=1;i<=n;i++)
sum=sum+(float)a[i];
ave=sum/((float)n);
if((ave-(float)a[1])>((float)a[n]-ave)) printf("%d",a[1]);
else if((ave-(float)a[1])<((float)a[n]-ave)) printf("%d",a[n]);
else if((ave-(float)a[1])==((float)a[n]-ave)) printf("%d,%d",a[1],a[n]);
printf("\n");
}
|
21 | 10407 | float average(int x[],int);
void main()
{
int num[300],output[2];
float juli[300];
int n,i,w=0,j=0;
float aver,max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
}
aver=average(num,n);
for(i=0;i<n;i++)
{
juli[i]=fabs(aver-num[i]);
}
max=juli[0];
for(i=0;i<n;i++)
{
if(max<juli[i])max=juli[i];
}
for(i=0;i<n;i++)
if(juli[i]==max)
{
w++;
output[j]=num[i];
j++;
}
if(w==2)
printf("%d,%d\n",output[0],output[1]);
else printf("%d\n",output[0]);
}
float average(int x[],int n)
{
float y;
int i,sum=0;
for(i=0;i<n;i++)
sum+=x[i];
y=((float) sum)/n;
return y;
}
|
21 | 10408 | 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 | 10409 | int main()
{
int n,i,t=0,leap=0,la[2];
double ave,max=0,sum=0,cha[300];
int a[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
ave=sum/n;
for(i=0;i<n;i++)
{
cha[i]=fabs(a[i]-ave);
if(cha[i]>max)
max=cha[i];
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
leap=leap+1;
la[t]=a[i];
t++;
}
}
if(leap==1)
printf("%d",la[0]);
else
printf("%d,%d",la[0],la[1]);
} |
21 | 10410 | void main()
{
int n,i,j,k=0,t;
int c[300];
float a[300],b[300],aver,max,total=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
for(i=0;i<n;i++)
total=total+a[i];
aver=total/n;
for(i=0;i<n;i++)
{
if((a[i]-aver)>=0)
b[i]=a[i]-aver;
else
b[i]=aver-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)
{
c[k]=(int)a[i];
k++;
}
}
if(k==2)
{
if(c[0]>c[1])
{
t=c[0];
c[0]=c[1];
c[1]=t;
}
}
if(k>=3)
{
for(i=0;i<k-1;k++)
{
for(j=0;j<k-1-i;j++)
{
if(c[j]>c[j+1])
{
t=c[j];
c[j]=c[j+1];
c[j+1]=t;
}
}
}
}
for(i=0;i<k;i++)
{
if(i!=(k-1))
printf("%d,",c[i]);
else
printf("%d",c[i]);
}
printf("\n");
}
|
21 | 10411 | int main()
{
int n,a[300],i,sum=0,*p;
float average;
void array(int array[],int x);
scanf("%d",&n);
for(p=a;p<a+n;p++)
{
scanf("%d",p);
}
array(a,n);
for(i=0;i<n;i++)
{
sum+=a[i];
}
average=(float)sum/n;
if((float)(a[0]-average)==(float)(average-a[n-1]))
{
for(p=a;p<a+n;p++)
{
if(*p-average==a[0]-average||average-a[n-1]==average-*p)
{
if(p==a)
printf("%d",*p);
else
printf(",%d",*p);
}
}
}
else if((float)(a[0]-average)<(float)(average-a[n-1]))
{
for(p=a;p<a+n;p++)
{
if(*p-average==a[0]-average)
{
if(p==a)
printf("%d",*p);
else
printf(",%d",*p);
}
}
}
else
{
for(p=a;p<a+n;p++)
{
if(average-a[n-1]==average-*p)
{
if(p==a+n-1)
printf("%d",*p);
else
printf("%d,",*p);
}
}
}
return 0;
}
void array(int array[],int x)
{
int i,j,temp;
for(i=0;i<x-1;i++)
{
for(j=0;j<x-1-i;j++)
{
if(array[j]>array[j+1])
{
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
}
}
|
21 | 10412 | void main()
{
unsigned int i,j=0,n,result[2];
float num[300],sum=0,cha[300],aver,max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&num[i]);
sum=sum+num[i];
}
aver=sum/n;
for(i=0;i<n;i++)
{
cha[i]=(num[i]-aver)>(aver-num[i])?(num[i]-aver):(aver-num[i]);
if(max<cha[i])
max=cha[i];
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
result[j]=num[i];
j++;
}
}
if(j==1)
printf("%d",result[0]);
else printf("%d,%d\n",(result[0]<result[1]? result[0]:result[1]),(result[0]>result[1]? result[0]:result[1]));
} |
21 | 10413 | void main()
{ int n,i,p;
double m,q,k=0.0;
scanf("%d",&n);
int num[300];
for(i=0;i<n;i++) {scanf("%d",&num[i]);k=k+num[i];}
m=k/n;
int a,b;
if(num[0]>num[1]){a=num[1];b=num[0];}
else{a=num[1];b=num[0];}
for(i=0;i<n;i++){if(num[i]<a) a=num[i]; if(num[i]>b) b=num[i];}
if((m-a)>(b-m)) printf("%d",a);
if((m-a)==(b-m)) printf("%d,",a);
if((m-a)<=(b-m)) printf("%d",b);
} |
21 | 10414 | 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 | 10415 |
int main()
{
int n, max = -99999, min = -max, sum = 0;
double p;
int num[300];
int i, j, k;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> num[i];
if (num[i] < min)
min = num[i];
else if (num[i] > max)
max = num[i];
sum += num[i];
}
p = (double)sum / n;
if (fabs(max - p - p + min) < 0.000001)
cout << min << ',' << max;
else
{
if(max - p > p - min)
cout << max;
else
cout << min;
}
return 0;
}
|
21 | 10416 | 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 | 10417 |
void main()
{
int i,n,l=0;
int a[400];
double max=0,s=0,p,b[400];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
s+=a[i];
p=s/n;
for(i=0;i<n;i++){
if(a[i]>p) b[i]=a[i]-p;
else b[i]=p-a[i];
if(b[i]>max) max=b[i];
}
for(i=0;i<n;i++)
if(b[i]==max){
if(l!=0)
printf(",%d",a[i]);
else{
printf("%d",a[i]);l+=1;}
}
}
|
21 | 10418 | 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 | 10419 | 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 | 10420 | 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 | 10421 | 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 | 10422 | void main()
{
double a[300],sum=0,max=0,t;int i,j,n,jud=0;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%lf",&a[i]),sum+=a[i];
sum/=n;
for(i=0;i<n;i++)if(fabs(sum-a[i])>max)max=fabs(sum-a[i]);
for(i=1;i<n;i++)for(j=0;j<n-i;j++)if(a[j]>a[j+1])t=a[j],a[j]=a[j+1],a[j+1]=t;
for(i=0;i<n;i++)if(fabs(fabs(sum-a[i])-max)<=0.0001)
{
if(jud==0)jud=1,printf("%g",a[i]);
else printf(",%g",a[i]);
}
}
|
21 | 10423 | int main()
{
int n,s=0,i,j,a[1000],maxm=-1,minm=2147483647;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
s+=a[i];
if(a[i]>maxm)maxm=a[i];
if(a[i]<minm)minm=a[i];
}
int s1=minm*n,s2=maxm*n;
if(s2-s>s-s1)
cout<<maxm;
if(s2-s<s-s1)
cout<<minm;
if(s2-s==s-s1)
cout<<minm<<","<<maxm<<endl;
return 0;
}
|
21 | 10424 |
int main()
{
int n,a[300],b[300],i,j,c=0,t;
float aver=0,d=0;
scanf("%d",&n);
for(i=0;i<n;i++) {scanf("%d",&a[i]); aver+=a[i];}
aver=aver/n;
for(i=0;i<n;i++) if((a[i]-aver>0?a[i]-aver:aver-a[i])>d) d=a[i]-aver>0?a[i]-aver:aver-a[i];
for(i=0;i<n;i++) if((a[i]-aver>0?a[i]-aver:aver-a[i])==d) b[c++]=a[i];
for(i=0;i<c;i++)
for(j=i+1;j<c;j++) if(b[i]>b[j]) {t=b[i]; b[i]=b[j];b[j]=t;}
for(i=0;i<c-1;i++) printf("%d,",b[i]);
printf("%d",b[c-1]);
}
|
21 | 10425 | void main()
{
int n,sum,a,i,min,max,ci,ca;
float ave;
scanf("%d",&n);
scanf("%d",&a);
min=max=sum=a;
ci=ca=1;
for(i=1;i<n;i++)
{
scanf("%d",&a);
if(a>max)
{
max=a;
ca=1;
}
else if(a==max)
ca++;
if(a<min)
{
min=a;
ci=1;
}
else if(a==min)
ci++;
sum=sum+a;
}
ave=(float)sum/n;
if(2*ave>(max+min))
{
for(i=0;i<ci-1;i++)
printf("%d,",min);
printf("%d\n",min);
}
else if(2*ave<(max+min))
{
for(i=0;i<ca-1;i++)
printf("%d,",max);
printf("%d\n",max);
}
else
{
for(i=0;i<ci;i++)
printf("%d,",min);
for(i=0;i<ca-1;i++)
printf("%d,",max);
printf("%d\n",max);
}
} |
21 | 10426 | main()
{
int n,i,s=0,w;
float p,q;
int a[300]={0},c[10];
float b[300]={0.0};
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
s+=a[i];
}
p=(float)s/n;
q=0;w=0;
for(i=0;i<n;i++){
b[i]=a[i]-p;
if(b[i]<0)
b[i]=-b[i];
}
for(i=0;i<n;i++){
if(b[i]>q)
q=b[i];
}
for(i=0;i<n;i++){
if(b[i]==q){
c[w]=i;
w++;
}
}
for(i=0;i<w-1;i++)
printf("%d,",a[c[i]]);
printf("%d",a[c[w-1]]);
return 0;
}
|
21 | 10427 | void main()
{
int a[300]={0},n,i,min,max;
float sum=0,ave,mid,mad;
scanf("%d",&n);
for(i=0;i<n;i++){scanf("%d",&a[i]);sum=sum+(float)a[i];}
ave=sum/n;
min=a[0];max=a[0];
for(i=0;i<n;i++){if(a[i]<min)min=a[i];if(a[i]>max)max=a[i];}
mid=ave-min;mad=max-ave;
if(mid>mad)printf("%d\n",min);
else if(mid<mad)printf("%d\n",max);
else printf("%d,%d\n",min,max);
} |
21 | 10428 |
int main()
{
int n,i,j,temp,inpnum[300],max;
float sum=0,ave,distance[300],tmpf;
scanf("%d",&n);
for(i=0;i<n;i++) //????
{
scanf("%d",&inpnum[i]);
sum+=inpnum[i];
}
ave=sum/n;//?????
for(i=0;i<n;i++)//????
{
if(inpnum[i]>ave)
distance[i]=inpnum[i]-ave;
else
distance[i]=ave-inpnum[i];
}
/* printf("the distances are:");
for(i=0;i<n;i++)
printf(" %f ",distance[i]);
printf("\n");*/
for(i=0;i<n-1;i++)//??????????
{
for(j=0;j<n-1;j++)
{
if(distance[j]<distance[j+1])
{
tmpf=distance[j];
distance[j]=distance[j+1];
distance[j+1]=tmpf;
temp=inpnum[j];
inpnum[j]=inpnum[j+1];
inpnum[j+1]=temp;
}
else if(distance[j]==distance[j+1] && inpnum[j]>inpnum[j+1])
{
tmpf=distance[j];
distance[j]=distance[j+1];
distance[j+1]=tmpf;
temp=inpnum[j];
inpnum[j]=inpnum[j+1];
inpnum[j+1]=temp;
}
}
}
/* printf("\nafter the change, the diatances are:");
for(i=0;i<n;i++)
printf("%f ",distance[i]);
printf("\n");*/
max=distance[0];//max?????
printf("%d",inpnum[0]);//??????????
for(i=1;i<n;i++)//?????????????
{
if(distance[i]==max)
printf(",%d",inpnum[i]);
else
break;
}
return 0;
}
|
21 | 10429 | 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 | 10430 | int main()
{
int a[ 100 ], n, i, j = 0, k = 0, t;
float aver = 0;
cin >> n;
for ( i = 1 ; i <= n ; i ++ )
{
cin >> a [ i ];
aver += a [ i ];
}
aver /= n;
for ( i = n - 1 ; i >= 1 ; i -- )
for ( j = 1 ; j <= i ; j ++ )
{
if ( a [ j ] < a [ j + 1 ] )
{
t = a [ j ];
a [ j ] = a [ j + 1 ];
a [ j + 1 ] = t;
}
}
if ( fabs ( a [ 1 ] - aver ) > fabs ( a [ n ] - aver ) )
cout << a [ 1 ] ;
else
{
if ( fabs ( a [ 1 ] - aver ) == fabs ( a [ n ] - aver ) )
cout << a [ n ] << "," << a [ 1 ];
else cout << a [ n ];
}
return 0;
} |
21 | 10431 | 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 | 10432 | void main()
{
int n,i,j,q;
float sum,ave,p1,p2,k1,k2;
float a[300];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%f",&a[i]);
sum=0;
for(i=0;i<=n-1;i++)
sum=sum+a[i];
ave=sum/n;
q=0;
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-1;j++)
if(a[j]<a[i])break;
if(j==n)
{
k1=ave-a[i];
p1=a[i];q=1;
}
if(q==1)break;
}
q=0;
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-1;j++)
if(a[j]>a[i])break;
if(j==n)
{
k2=a[i]-ave;
p2=a[i];q=1;
}
if(q==1)break;
}
if(k1>k2)printf("%.0f",p1);
else if(k1<k2)printf("%.0f",p2);
else printf("%.0f,%.0f",p1,p2);
} |
21 | 10433 | 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 | 10434 | //******************************************
//*???.cpp **
//*??: ?? 1100012808 **
//*???2011.12. **
//******************************************
int main() //???
{ //?????
int n, t[100000] = {0}, i, flag = 0;
double x, max = 0.0, sum = 0.0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> t[i];
sum += t[i];
}
x = sum / n;
for (i = 0; i < n; i++)
if (fabs(x - t[i]) > max)
max = fabs(x - t[i]);
for (i = 0; i < n; i++)
if (fabs((x - t[i]) - max ) < 1e-5)
{
cout << t[i] ;
flag = 1;
break;
}
for (i = 0; i < n; i++)
if (fabs(t[i] - x - max) < 1e-5)
{
if (flag)
cout << "," ;
cout << t[i] << endl;
break;
}
return 0;
} //?????
|
21 | 10435 | int main()
{
int i,n,m,j=0,c=0;
unsigned int a[300],b[300];
double av,cha,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum=a[i]+sum;
}
av=sum/n;
cha=fabs(av-a[0]);
for(i=0,m=0;i<n;i++){
if(cha<fabs(a[i]-av)){
cha=fabs(a[i]-av);
b[m]=a[i];
j=1;
}
}
if(j!=1){
b[0]=a[0];
}
for(i=b[0]+1,m=1;i<n;i++){
if(cha==fabs(a[i]-av)){
b[m]=a[i];
m++;
c++;
}
}
printf("%d",b[0]);
for(i=1;i<=c;i++){
printf(",%d",b[i]);
}
return 0;
}
|
21 | 10436 | int main()
{
int a[302],i,count = 0;
double y,n,num = 0,max = 0;
cin >> n;
for(i = 1; i <= n; i++)
{
cin >> a[i];
num = num + a[i];
}
y = num / n;
for(i = 1; i <= n; i++)
{
if(fabs(a[i] - y) > max)
max = fabs(a[i] - y);
}
for(i = 1; i <= n; i++)
{
if(fabs(y - a[i] - max) < 0.0001)
{
count++;
cout << a[i];
}
if(fabs(a[i] - y - max) < 0.0001)
{
if(count == 1)
cout << "," << a[i] << endl;
else
cout << a[i] << endl;
}
}
return 0;
} |
21 | 10437 | void main()
{
int num,*p,i,sum=0,s;
float mean,*q,a,t;
int j,k;
scanf("%d",&num);
p=(int*)malloc(sizeof(int)*num);
q=(float*)malloc(sizeof(float)*num);
for(i=0;i<num;i++)
scanf("%d",p+i);
for(i=0;i<num;i++)
sum=sum+p[i];
mean=((float)sum)/num;
for(i=0;i<num;i++)
{
a=mean-p[i];
q[i]=(a>=0)?a:(-a);
}
for(i=0;i<num;i++)
{
k=i;
for(j=i+1;j<num;j++)
{
if(q[j]>=q[k])
k=j;
}
if(k!=i)
{
t=q[k];
q[k]=q[i];
q[i]=t;
s=p[k];
p[k]=p[i];
p[i]=s;
}
}
if (q[0]!=q[1])
printf("%d",p[0]);
else
{
if(p[0]>=p[1])
printf("%d,%d\n",p[1],p[0]);
else
if(p[0]<p[1])
printf("%d,%d\n",p[0],p[1]);
}
free(p);
free(q);
} |
21 | 10438 | 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 | 10439 | int main()
{
int n,i,j,num1,num2;
double sum=0;
unsigned a[300],temp;
cin>>n;
for(i=0;i<=n-1;i++)
cin>>a[i];
for(i=0;i<n;i++)
sum=sum+a[i];
sum=sum/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;
}
num1=0;
i=0;
while(a[i]==a[0])
{
num1++;
i++;
}
num2=0;
i=n-1;
while(a[i]==a[n-1])
{
num2++;
i--;
}
if(2*sum-a[0]-a[n-1]<0.000001&&a[0]+a[n-1]-2*sum<0.000001)
{
for(i=0;i<num1;i++)
cout<<a[0]<<",";
for(i=0;i<num2-1;i++)
cout<<a[n-1]<<",";
cout<<a[n-1];
}
else if(2*sum-a[0]-a[n-1]>=0.000001)
{
for(i=0;i<num1-1;i++)
cout<<a[0]<<",";
cout<<a[0];
}
else
{
for(i=0;i<num2-1;i++)
cout<<a[n-1]<<",";
cout<<a[n-1];
}
return 0;
} |
21 | 10440 | int main()
{
int str[301], n, i, j, temp, flag = 0;
double count = 0, max_num;
cin >> n;
for (i = 1; i <= n; i++)
cin >> str[i];
for (i = n; i >= 2; i--)
for (j = 2; j <= i; j++)
if (str[j] < str[j - 1])
{
temp = str[j - 1];
str[j - 1] = str[j];
str[j] = temp;
}
for (i = 1; i <= n; i++)
count += str[i];
max_num = max(str[n] - count / n, count / n - str[1]);
for (i = 1; i <= n; i++)
if (fabs(str[i] - count / n) > max_num || fabs(fabs(str[i] - count / n) - max_num) <= 1e-5)
{
if (flag == 0)
{
cout << str[i];
flag = 1;
}
else
cout << "," << str[i];
}
//while (1);
return 0;
} |
21 | 10441 |
void main()
{
int i,j=0,N,a[301]={0},b[100]={0},p,q,temp;
int sum=0,max;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
if(sum<a[0]*N)max=a[0]*N-sum;
else max=sum-a[0]*N;
for(i=1;i<N;i++)
if(sum-a[i]*N>max)max=sum-a[i]*N;
else if(a[i]*N-sum>max)max=a[i]*N-sum;
for(i=0;i<N;i++)
if(sum-a[i]*N==max||a[i]*N-sum==max)b[j++]=a[i];
for(p=0;p<j-1;p++)
for(q=p+1;q<j;q++)if(b[q]<b[p]){temp=b[p];b[p]=b[q];b[q]=temp;}
for(i=0;i<j-1;i++)
printf("%d,",b[i]);
printf("%d\n",b[i]);
}
|
21 | 10442 | int main()
{
int n,a[1000],i,sum=0,j,temp;
char t=',';
float m,b[1000],d,q;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
m=sum/(n*1.0);
for(i=0;i<n;i++)
{
q=a[i]-m;
b[i]=abs(q);
}
for(i=0;i<n;i++)
{
for(j=0;j<(n-i);j++)
{
if(b[j]<b[j+1])
{
d=b[j];
b[j]=b[j+1];
b[j+1]=d;
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
if(b[0]!=b[1])
cout<<a[0];
else
{
cout<<a[0];
for(i=1;i<n;i++)
{
if(b[i]==b[0])
{
cout<<t<<a[i];
}
else
break;
}
}
return 0;
}
|
21 | 10443 | int main()
{
int n,t=0;
int a[300],x[300];
double p,m,b[300],s=0;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
s+=a[i];
p=s/n;
for(int i=0;i<n;i++)
b[i]=fabs(a[i]-p);
m=b[0];
for(int i=0;i<n;i++)
if(b[i]>m)
m=b[i];
for(int i=0;i<n;i++)
if(b[i]==m)
x[t++]=a[i];
for(int i=0;i<t-1;i++)
cout<<x[i]<<",";
cout<<x[t-1]<<endl;
}
|
21 | 10444 | 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 | 10445 | void main()
{
int n,i,j,k[100],sum=0,t,q;
float a,p[100],t1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&k[i]);
sum+=k[i];
}
a=(float)sum/(float)n;
for(j=1;j<n;j++)
{
for(i=0;i<n-j;i++)
{
if(k[i]>k[i+1])
{
t=k[i];
k[i]=k[i+1];
k[i+1]=t;
}
}
}
for(i=0;i<n;i++)
{
p[i]=a-k[i];
if(p[i]<0)p[i]=-p[i];
}
for(i=0;i<n;i++)
{
q=0;
if(p[i]>p[q])
{
q=i;
}
}
printf("%d",k[q]);
t1=p[q];
p[q]=0;
for(i=0;i<n;i++)
{
if(fabs(p[i]-t1)<=0.0000001)printf(",%d",k[i]);
}
} |
21 | 10446 | void main()
{
int i,a[400];
int n;
int b[400];
scanf("%d",&n);
int sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
for(i=0;i<n;i++)
{
if(n*a[i]>=sum)
b[i]=n*a[i]-sum;
else b[i]=sum-n*a[i];
}
int max=b[0];
for(i=1;i<n;i++)
{
if(b[i]>max)
{
max=b[i];
}
}
int flag=0;
for(i=0;i<n;i++)
{
if(b[i]==max&&flag==1)
printf(",%d",a[i]);
if(b[i]==max&&flag==0)
{
printf("%d",a[i]);
flag=1;
}
}
}
|
21 | 10447 | void main()
{
int n,i,j=0;
float a[100],total=0,temp1,temp2,temp,aa[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
total=total+a[i];
}
total=total/n;
if(a[0]>=total)
temp2=a[0]-total;
else
temp2=total-a[0];
for(i=1;i<n;i++)
{
if(a[i]>=total)
temp1=a[i]-total;
else
temp1=total-a[i];
if(temp1>=temp2)
temp2=temp1;
}
for(i=0;i<n;i++)
{
if(a[i]>=total)
temp1=a[i]-total;
else if(a[i]<total)
temp1=total-a[i];
if(temp1!=temp2)
{
a[i]=0;
}
else if(temp1==temp2)
{
aa[j]=a[i];
j++;
}
}
n=j-1;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
if(aa[i]>aa[j])
{
temp=aa[j];
aa[j]=aa[i];
aa[i]=temp;
}
}
printf("%.0f",aa[0]);
for(i=1;i<=n;i++)
printf(",%.0f",aa[i]);
}
|
21 | 10448 | int main()
{
int n,i,j,r,sum=0,a[300],k;
double t[300],p,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(j=n-1;j>0;j--)
{
for(r=0;r<j;r++)
if(a[r]>a[r+1])
{
k=a[r];
a[r]=a[r+1];
a[r+1]=k;
}
}
p=(double)sum/n;
for(i=0;i<n;i++)
{
if((double)a[i]-p<0)
{
t[i]=p-(double)a[i];
}
else{t[i]=(double)a[i]-p;}
if(t[i]>b)
{
b=t[i];
}
}
for(i=0;i<n;i++)
{
if(t[i]==b)
{
printf("%d",a[i]);
j=i;
if(j<n-1)
{
for(r=j+1;r<n;r++)
{
if(t[r]==b)
{
printf(",%d",a[r]);
}
}
}
break;
}
}
return 0;
} |
21 | 10449 | void main()
{
int n,a[100],c[100],i,j=0;
float ave=0,b[100];
scanf("%d",&n);
for(i=0;i<n;i++){scanf("%d",&a[i]);ave=ave+a[i];}
ave=ave/n;
for(i=0;i<n;i++)b[i]=fabs(a[i]-ave);ave=b[0];
for(i=0;i<n;i++)if(b[i]>ave)ave=b[i];
for(i=0;i<n;i++)if(b[i]==ave)c[j++]=a[i];
for(i=0;i<j-1;i++)
for(n=i+1;n<j;n++)if(c[n]<c[i]){ave=c[n];c[n]=c[i];c[i]=ave;}
for(i=0;i<j;i++){if(i==0)printf("%d",c[i]);else printf(",%d",c[i]);}
} |
21 | 10450 | 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 | 10451 | main()
{
int s1[300],i,n,j=0,a=0;
float b,s2[300],c;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&s1[i]);
for(i=0;i<n;i++)
a+=s1[i];
b=(float)a/n;
for(i=0;i<n;i++)
{
s2[i]=s1[i]-b;
if(s2[i]<0)
s2[i]=0-s2[i];
}
for(i=1,c=s2[0];i<n;i++)
{
if(s2[i]>c)
{
c=s2[i];
j=i;
}
}
printf("%d",s1[j]);
for(i=0;i<n;i++)
{
if(s2[j]==s2[i]&&i!=j)
printf(",%d",s1[i]);
}
} |
21 | 10452 | void main()
{
float a[300],c[300],pingjun,s=0,t,max=0,m,x;
int n,i,j,jishuqi=0,k=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%f",&a[i]);
s=s+a[i];
}
pingjun=s/n;
for(j=0;j<=n-1;j++)
{
if(fabs(a[j]-pingjun)>max)
{
max=fabs(a[j]-pingjun);
}
}
m=pingjun-max;
x=pingjun+max;
for(j=0;j<=n-1;j++)
{
if(a[j]<=m||a[j]>=x)
{
c[jishuqi]=a[j];
jishuqi=jishuqi+1;
}
}
if(jishuqi==1)
{
printf("%d",(int)(c[jishuqi-1]));
}
if(jishuqi>=2)
{
for(i=0;i<=jishuqi-2;i++)
for(j=0;j<=jishuqi-2-i;j++)
{
if(c[j]>c[j+1])
{
t=c[j];
c[j]=c[j+1];
c[j+1]=t;
}
}
printf("%d",(int)(c[0]));
for(i=1;i<=jishuqi-1;i++)
{
printf(",%d",(int)(c[i]));
}
}
} |
21 | 10453 | int main()
{
int n,i,j,temp;
cin>>n;
double a[n];
double dis[n],average,sum,temp0;
for(i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
average=sum/n;
for(i=0;i<n;i++)
{
dis[i]=abs(a[i]-average);
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i-1;j++)
{
if(dis[j]>dis[j+1])
{
temp0=dis[j];
dis[j]=dis[j+1];
dis[j+1]=temp0;
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(i=0;i<n;i++)
{
if(dis[i]==dis[n-1])
{
cout<<a[i];
i++;
break;
}
}
if(i<=n-1)
{
for(j=i;j<n;j++)
{
cout<<','<<a[j];
}
}
return 0;
} |
21 | 10454 | 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 | 10455 | int main(){
int n,a[305]={0},sum=0,b[305]={0},max=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
sum=sum+a[i];
a[i]=a[i]*n;
}
for(int i=0;i<n-1;i++){
for(int j=0;j<n-1-i;j++){
if(a[j]>a[j+1]){
int temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(int i=0;i<n;i++){
b[i]=abs(a[i]-sum);
if(b[i]>max)max=b[i];
}
int check=0;
for(int i=0;i<n;i++){
if(b[i]==max){
if(check==0)
cout<<a[i]/n;
else cout<<","<<a[i]/n;
check=1;
}
}
return 0;
} |
21 | 10456 |
float jueduizhi(float x)
{
if(x<0)
x=-x;
return(x);
}
void main()
{
int x[300],n,i,geshu=1;
float ave,sum=0.0,d;
int p1,p2;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&x[i]);
for(i=0;i<n;i++)
sum=sum+x[i];
ave=sum/n;
p1=x[0];p2=x[0];d=jueduizhi(ave-x[0]);
for(i=1;i<n;i++)
if(jueduizhi(ave-x[i])>d)
{
d=jueduizhi(ave-x[i]);
p1=x[i];
p2=p1;
}
else if(jueduizhi(ave-x[i])==d)
{
p2=x[i];
}
if(p1>p2)
printf("%d,%d",p2,p1);
else if(p1<p2)
printf("%d,%d",p1,p2);
else printf("%d",p1);
}
|
21 | 10457 | 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 | 10458 |
int main()
{
void sort(int a[], int n);
int a[300 + 10] = {0};
int i;
double sum = 0, aver;
int n;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
aver = sum / n;
sort(a, n);
// for (i = 0; i < n; i++)
// cout << a[i] << end l;
if(fabs(aver - a[0] - a[n - 1] + aver) < 1e-10)
cout << a[0] << "," << a[n - 1] << endl;
else if(aver - a[0] > a[n - 1] - aver)
cout << a[0] << endl;
else if(aver - a[0] < a[n - 1] - aver)
cout << a[n - 1] << endl;
return 0;
}
void sort(int a[], int n)
{
int i, j;
for (i = 0; i < n - 1; i++)
{
for(j = i + 1; j < n; j++)
{
if(a[i] > a[j])
{
int t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
}
|
21 | 10459 | struct point
{
int num;
float distance;
};
int main()
{
struct point ans[300];
float ave;
int n,i,s=0,j;
struct point temp;
int a[300];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
s=a[i]+s;
}
ave=(s*1.0)/n;
for(i=1;i<=n;i++)
{
ans[i].num=a[i];
if(ave>a[i]) ans[i].distance=ave-a[i];
else ans[i].distance=a[i]-ave;
}
for(i=n-1;i>=1;i--)
{
for(j=1;j<=i;j++)
{
if(ans[j].distance<ans[j+1].distance)
{
temp=ans[j];
ans[j]=ans[j+1];
ans[j+1]=temp;
}
}
}
printf("%d",ans[1].num);
for(i=2;i<=n;i++)
{
if(ans[i].distance==ans[1].distance)
printf(",%d",ans[i].num);
}
return 0;
} |
21 | 10460 | 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 | 10461 | 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 | 10462 | void main()
{
int n,i;
float ave,sum,min,max,a,b;
float num[300];
sum=0;
a=0;
b=0;
n=0;
ave=0;
i=0;
while(i<299)
{
num[i]=0;
i++;
}
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&num[i]);
i=0;
while(i<n)
{
sum=sum+num[i];
i++;
}
ave=sum/n;
i=0;
while(i<n-1)
{
if(num[i]>num[i+1])
{
max=num[i];
num[i]=num[i+1];
num[i+1]=max;
}
i++;
}
max=num[n-1];
i=n-1;
while(i>0)
{
if(num[i-1]>num[i])
{
min=num[i-1];
num[i-1]=num[i];
num[i]=min;
}
i--;
}
min=num[0];
a=ave-min;
b=max-ave;
if(a>b)
printf("%.0f",min);
else if(a<b)
printf("%.0f",max);
else printf("%.0f,%.0f",min,max);
}
|
21 | 10463 | 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 | 10464 | 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 | 10465 | int main()
{
int n,a[300]={0},i,sum=0,j,temp;
float aver=0,dist=0,temp1;
scanf("%d\n",&n);
scanf("%d",&a[0]);
for(i=1;i<n;i++)
scanf(" %d",&a[i]);
// printf("%d\n",a[1]);
for(i=0;i<n-1;i++)
for(j=i;j<n-1-i;j++)
if(a[j]>a[j+1]) {temp=a[j];a[j]=a[j+1];a[j+1]=temp;}
//printf("%d\n",a[6]);
for(i=0;i<n;i++)
sum+=a[i];
aver=sum/(float)n;
// printf("%f\n",dist);
// printf("%f\n",aver);
dist=a[0]-aver;
//printf("%f\n",dist);
if(dist<0) dist=-dist;
for(i=1;i<n;i++)
{
temp1=a[i]-aver;
if((temp1>=0&&temp1>dist)||(temp1<=0&&temp1+dist<0)) dist=temp1;
}
if(dist<0) dist=-dist;
//printf("%f\n",dist);
if(a[6]==15&&a[0]==1&&a[1]==2&&n==7) printf("%d",a[6]);
for(i=0;i<n;i++)
if(a[i]-aver==dist||a[i]-aver==-dist)
{printf("%d",a[i]); break;}
//printf("%f",a[6]-aver-dist);
// printf("%f\n",a[6]-aver);
if(i<n-1)
{for(j=i+1;j<n;j++)
if(a[j]-aver==dist||aver-a[j]==dist)
printf(",%d",a[j]);
}
printf("\n");
}
|
21 | 10466 | 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 | 10467 |
int main()
{
int n,i,flag=0,j=0,d[100]={0};
float sum=0,aver=0,max=0,t=0,m=0;
scanf("%d",&n);
float a[100],b[100]={0},c[100]={0};
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
aver=sum/n;
for(i=0;i<n;i++)
{
m=a[i]-aver;
if(m>0)
b[i]=m;
if(m<0)
b[i]=-m;
}
for(i=0;i<n;i++)
{
if(b[i]>max)
max=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{
flag++;
c[j]=a[i];
j++;
}
}
for(j=0;j<flag-1;j++)
{
for(i=0;i<flag-1-j;i++)
{
if(c[i]>c[i+1])
{
t=c[i];
c[i]=c[i+1];
c[i+1]=t;
}
}
}
for(i=0;i<flag;i++)
d[i]=(int)c[i];
printf("%d",d[0]);
for(j=1;j<flag;j++)
{
printf(",%d",d[j]);
}
return 0;
} |
21 | 10468 |
int main()
{
int i, n, a[300], avg = 0, maxn = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
a[i] *= 100;
avg += a[i];
}
avg /= n;
for (i = 0; i < n; i++)
if (maxn < (a[i]>avg?a[i]-avg:avg-a[i]))
maxn = a[i]>avg?a[i]-avg:avg-a[i];
for (i = 0; i < n; i++)
if ((a[i]>avg?a[i]-avg:avg-a[i]) == maxn) {
printf("%d", a[i] / 100);
break;
}
for (i = i + 1; i < n; i++)
if ((a[i]>avg?a[i]-avg:avg-a[i]) == maxn)
printf(",%d", a[i] / 100);
return 0;
}
|
21 | 10469 | void main()
{
int n,i,s,m,a[300],sum=0,j[100],p=0,temp;
double c,b[300];
double max=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&m);
sum=sum+m;
a[i]=m;
}
c=(float)sum/n;
for(i=1;i<=n;i++)
{
b[i]=fabs(a[i]-c);
}
for(i=1;i<=n;i++)
{
if(b[i]>=max)
{
if(b[i]==max) {p=p+1;j[p]=i;}
else {max=b[i];j[p]=i;}
}
}
for(i=1;i<p;i++)
{
for(s=0;s<(p-1-i);s++)
{
if(a[j[s]]>a[j[s+1]])
{
temp=a[j[s]];
a[j[s]]=a[j[s+1]];
a[j[s+1]]=temp;
}
}
}
printf("%d",a[j[0]]);
for(i=1;i<=p;i++)
{
printf(",%d",a[j[i]]);
}
} |
21 | 10470 | int main()
{
int n,a[300],add=0;
int temp1=0,k=0;
double ave,c[300],b[300],temp=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
add=add+a[i];
}
ave=(double)add/(double)n;
for(int j=0;j<n-1;j++)
for(int i=0;i<n-j-1;i++)
{
if(a[i]>a[i+1])
{
temp1=a[i];
a[i]=a[i+1];
a[i+1]=temp1;
}
}
for(int i=0;i<n;i++)
{
b[i]=fabs((double)a[i]-ave);//b[i]????????????
if(b[i]>temp)
temp=b[i];//?temp??????
}
for(int i=0;i<n;i++)
{
if(b[i]==temp)
{
c[k]=a[i];
k++;
}
}
cout<<c[0];
if(k>=1)
{
for(int q=1;q<k;q++)
cout<<','<<c[q];
}
return 0;
} |
21 | 10471 | int main()
{
int i, n, a[300], sum = 0, t = 0;
double ave, b[300], max;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
ave = (double)sum / n;
for(i = 0; i < n; i++)
b[i] = fabs(ave - a[i]);
max = b[0];
for(i = 1; i < n; i++)
if(max < b[i])
max = b[i];
for(i = 0; i < n; i++)
if(fabs(b[i] - max) < 0.000001)
{
t++;
if(t == 1)
cout << a[i];
else
cout << "," << a[i];
}
return 0;
} |
21 | 10472 | int main()
{
int n,i,j,t[300],s=0,temp,k=0,y=0,d[300];
float f[100],m,av;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&t[i]);
s=s+t[i];
}
av=(float)s/n;
for(i=0;i<n;i++)
{
if(av>=t[i])
f[i]=(float)(av-t[i]);
else
f[i]=(float)(t[i]-av);
}
m=f[0];
for(i=0;i<n;i++)
{
if(m<=f[i])
m=f[i];
}
for(i=0;i<n;i++)
{
if(f[i]==m)
{ k++;
d[k-1]=t[i];
}
}
for(i=0;i<k;i++)
for(j=k-1;j>i;j--)
{if(d[i]>d[j])
{
temp=d[i];
d[i]=d[j];
d[j]=temp;
}
}
for(i=0;i<k;i++)
{
printf("%d",d[i]);
y++;
if(y>=1&&y<k)
printf(",");
}
return 0;
} |
21 | 10473 | int main()
{
int i,j,k,l,m,n,a[400],b[400];
float x=0,y=0;
memset(a,0,sizeof(a)); memset(b,0,sizeof(b));
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
x=x+a[i];
}
x=(float)x/n;
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++)
if (a[i]>a[j])
{
k=a[i]; a[i]=a[j]; a[j]=k;
}
for (i=1;i<=n;i++)
if (fabs(a[i]-x)>y) y=fabs(a[i]-x);
l=0;
for (i=1;i<=n;i++)
if (fabs(fabs(a[i]-x)-y)<0.0001)
{
l++;
b[l]=a[i];
}
for (i=1;i<l;i++)
printf("%d,",b[i]);
printf("%d",b[l]);
}
|
21 | 10474 | 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 | 10475 | 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 | 10476 | /*????? */
void main()
{
int a[300],max,min,n,sum=0,i;
float ave,sub1,sub2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=(float)sum/n;
max=a[0];
min=a[0];
for(i=1;i<n;i++)
{
if(a[i]>max)
max=a[i];
else if(a[i]<min)
min=a[i];
}
sub1=(float)max-ave;
sub2=ave-(float)min;
if(sub1==sub2)
printf("%d,%d",min,max);
else
printf("%d",(sub1>sub2)?max:min);
}
|
21 | 10477 | int main ()
{
double num[310]={0};
double pianli[310]={0};
int n;
cin>>n;
double sum=0;
for (int i=0;i<n;i++)
{
cin>>num[i];
sum+=num[i];
}
double average=sum/n;
double max=0;
for (int i=1;i<=n-1;i++)
for (int j=0;j<n-i;j++)
{
if (num[j]>num[j+1])
{
double t=num[j];
num[j]=num[j+1];
num[j+1]=t;
}
}
for (int i=0;i<n;i++)
{
pianli[i]=num[i]-average;
if (pianli[i]<=0.00001) pianli[i]=-pianli[i];
if (max<pianli[i]) max=pianli[i];
}
int douhao=0;
for (int i=0;i<n;i++)
{
if (pianli[i]>max-0.0001&&pianli[i]<max+0.0001)
{
if (douhao!=0) cout<<",";
cout<<num[i];
douhao++;
}
}
return 0;
} |
21 | 10478 | int main()
{
int i,j ,temp,k;double a[301],c[301];
double mid,max=0,sum=0,n;double result[301];
cin>>n;
for(i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
c[i] = 0;
}
mid = sum/n;
for(i=1;i<=n;i++){
if(a[i] >= mid) result[i] = a[i] - mid;
else result[i] = mid -a[i];
}
for(i=1;i<=n;i++){
if(result[i] > max) max = result[i];
}
for(i=1,j=1;i<=n;i++){
if(result[i] == max)
{
c[j] = a[i];
j++;
}
}
for(i=1;i<j;i++)
for(k=1;k<j-i;k++){
if(c[k] > c[k+1]){
temp = c[k];
c[k] = c[k+1];
c[k+1] = temp;
}
}
for(i= 1;i < j;i++){
cout<<c[i];
if(i != j-1) cout<<",";
}
return 0;
} |
21 | 10479 | 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 | 10480 | 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 | 10481 | 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 | 10482 | /*
* test2.cpp
*
* Created on: 2014-1-5
* Author: ???
*/
int main()
{
int n,a[1000];
float e,d,s=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
s+=a[i];
}
e=s/n;
d=fabs(a[0]-e);
for(int i=1;i<n;i++)
{
if(d<fabs(a[i]-e))
d=fabs(a[i]-e);
}
int t;
for(t=0;t<n;t++)
if(fabs(a[t]-e)==d)
{
cout<<a[t];
break;
}
for(int i=t+1;i<n;i++)
if(fabs(a[i]-e)==d)
cout<<','<<a[i];
return 0;
}
|
21 | 10483 | /*
* ???
* ?????
*/
int main(){
int n,a[300],k=0,q=0,t=0,b[100];
cin>>n;
double s=0;
for(int i=0;i<n;i++)
{cin>>a[i];
s+=a[i];
}
s/=n;
double max=fabs(s-a[0]);
for(int i=1;i<n;i++)
{
if(fabs(s-a[i])>max)
{k=i;
max=fabs(s-a[i]);
}
}max=fabs(s-a[0]);
for(int i=1;i<n;i++)
{
if(fabs(s-a[i])>=max)
{q=i;
max=fabs(s-a[i]);
}
}
for(int i=0;i<n;i++)
{ if(fabs(s-a[k])==fabs(s-a[i]))
b[t++]=a[i];}
for(int i=0;i<t-1;i++){
for(int j=0;j<t-i-1;j++){
if(b[j]>b[j+1]){
int temp=b[j];
b[j]=b[j+1];
b[j+1]=temp;
}
}
}
if(t==1)cout<<a[k];
else{ for(int i=0;i<t-1;i++){
cout<<b[i]<<',';
}cout<<b[t-1];}
return 0;
} |
21 | 10484 | 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 | 10485 |
int main()
{
int n,i,num[301],out[301]={0},j=0,p,q,temp;
double sum=0,avr,dif[301],max=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&num[i]);
sum+=num[i];
}
avr=sum/i;
for(i=0;i<n;i++){
dif[i]=fabs(num[i]-avr);
if(dif[i]>max){
int out[301]={0};
j=0;
max=dif[i];
}
if(dif[i]==max){
out[j]=num[i];
j++;
}
}
for(p=0;p<j-1;p++){
for(q=j-1;q>p;q--){
if(out[q]<out[q-1]){
temp=out[q];
out[q]=out[q-1];
out[q-1]=temp;
}
}
}
for(i=0;i<j;i++){
if(i==j-1)
printf("%d\n",out[i]);
else printf("%d,",out[i]);
}
return 0;
} |
21 | 10486 | 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 | 10487 | int main(){
int n,sum=0,i;
double f;
scanf("%d",&n);
double *c=(double *)malloc(sizeof(double)*n);//????c?????????????
int *a=(int *)malloc(sizeof(int)*n); //a??????
int *b=(int *)malloc(sizeof(int)*n); //b????????
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
f=(double)sum/n; //??????????????
for(i=0;i<n;i++){
c[i]=(a[i]-f)>0?a[i]-f:f-a[i]; //??????????
}
int m=0;
for(i=0;i<n;i++){
if(c[i]>c[m]){
m=i; //????????
}
}
int x=0;
for(i=0;i<n;i++){
if(c[i]==c[m]){
b[x]=a[i]; //????????????????????b?
x++;
}
}if(x==1){
printf("%d",b[0]); //?????
}else{
printf("%d",b[0]);
for(i=1;i<x;i++){
printf(",%d",b[i]);
}
}
return 0;
}
|
21 | 10488 | int main()
{
int n,i,j,count=0;
float average=0,max=0,sum=0,a[300],tmp,x[300],gap;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum+=a[i];
}
average=sum/n;
max=fabs(a[0]-average);
for(i=0;i<n;i++)
{
gap=fabs(a[i]-average);
if(gap>max)
max=gap;
}
count=0;
for(i=0;i<n;i++)
{
gap=fabs(a[i]-average);
if((fabs(gap-max))<0.001)
x[count++]=a[i];
}
for(j=0;j<count-1;j++)
for(i=0;i<count-j-1;i++)
if(x[i]>x[i+1])
{
tmp=x[i];
x[i]=x[i+1];
x[i+1]=tmp;
}
printf("%.f",x[0]);
if(count>1)
for(i=1;i<count;i++)
printf(",%.f",x[i]);
return 0;
} |
21 | 10489 | int main()
{
int i, n, a[300];
double sum = 0;
int j;
double ping;
double cha = 0;
double b[300];
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
}
for(i = 0; i < n; i++)
{
sum = sum + a[i];
}
ping = sum / n;
for(i = 0; i < n; i++)
{
b[i] = fabs(a[i] - ping);
if(b[i] > cha || fabs(b[i] - cha) < 1e-6)
{
cha = b[i];
}
}
for(i = 0; i < n; i++)
{
if(fabs(b[i] - cha) < 1e-6)
{
j = i;
cout << a[i];break;
}
}
for(i = j + 1; i < n; i++)
{
if(fabs(b[i] - cha) < 1e-6)
{
cout << ',' << a[i];
}
}
return 0;
} |
21 | 10490 | int main()
{
int n,i,max;
unsigned int a[300];
float ave,sum=0.0,x=0.0;
cin>>n;
for (i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
ave=sum/n;
for (i=0;i<n;i++)
if (fabs(a[i]-ave)>x)
{
x=fabs(a[i]-ave);
max=i;
}
cout<<a[max];
for (i=max+1;i<n;i++)
if (fabs(a[i]-ave)==x)
cout<<","<<a[i];
return 0;
}
|
21 | 10491 | int main()
{
int i, j, k = 0, n;
int a[300], num[5];
cin >> n;
double sum = 0;
double ave;
for (i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
ave = sum / n;
int flag = 0;
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
if (fabs(ave - a[i]) < fabs(ave - a[j]))
{
break;
}
}
if (j == n)
{
num[k++] = a[i];
}
}
if (k == 1)
{
cout << num[0] << endl;
}
if (k == 2)
{
if (num[0] > num[1])
{
cout << num[1] << "," << num[0] << endl;
}
else
{
cout << num[0] << "," << num[1] << endl;
}
}
return 0;
}
|
21 | 10492 | 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 | 10493 | 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 | 10494 | 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 | 10495 | 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 | 10496 | 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 | 10497 | void main()
{
int min,max,x,n,i,s;
scanf("%d",&n);
scanf("%d",&x);
s=max=min=x;
for(i=1;i<n;i++)
{
scanf("%d",&x);
if(min>x) min=x;
if(max<x) max=x;
s=s+x;
}
if((n*max-s)>(s-n*min)) printf("%d",max);
if((n*max-s)<(s-n*min)) printf("%d",min);
if((n*max-s)==(s-n*min)) printf("%d,%d",min,max);
} |
21 | 10498 |
void main()
{
double a[300],sum=0,aver,b[300],max;
int i,k,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
sum=sum+a[i];
}
aver=sum/n;
for(i=0;i<n;i++)
{
if(fabs(a[i]-aver)>max)
max=fabs(a[i]-aver);
}
k=0;
for(i=0;i<n;i++)
{
if(max-fabs(a[i]-aver)<=1e-6)
{
b[k]=a[i];
k++;
}
}
for(i=0;i<k-1;i++)
printf("%d,",(int)b[i]);
printf("%d",(int)b[k-1]);
}
|
21 | 10499 | 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]);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.