label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
21 | 10200 |
struct number
{
unsigned int shuzi;
float pianli;
};
int main()
{
int i,j,n;
float average,sum=0;
scanf("%d",&n);
struct number num[301],t;
for(i=0;i<n;i++)
scanf("%d",&num[i].shuzi);
for(i=0;i<n;i++)
sum=sum+num[i].shuzi;
average=sum/(float)n;
for(i=0;i<n;i++)
num[i].pianli=fabs(num[i].shuzi-average);
for(j=0;j<n;j++)
for(i=0;i<n-j-1;i++)
{if(num[i].pianli>num[i+1].pianli)
{
t=num[i];
num[i]=num[i+1];
num[i+1]=t;
}
else
{
if(num[i].pianli==num[i+1].pianli)
{ if(num[i].shuzi>num[i+1].shuzi)
{ t=num[i];
num[i]=num[i+1];
num[i+1]=t;}
}
}
}
for(i=0;i<n-1;i++)
{
if(num[i].pianli==num[n-1].pianli)
{printf("%d,", num[i].shuzi);}
}
printf("%d", num[n-1].shuzi);
return 1;
} |
21 | 10201 | int main()
{
int n,i,max,sum=0,b1=0,b2=0;
float ave;
unsigned int a[300];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
ave=(float)sum/n;
max=0;
for(i=0;i<n;i++){
if(fabs(a[i]-ave)>=max){
if(a[i]<ave){
max=fabs(a[i]-ave);
b1=i;
}
else{
max=fabs(a[i]-ave);
b2=i;
}
}
}
if((a[b2]-ave)>(ave-a[b1])) printf("%d",a[b2]);
else if((a[b2]-ave)<(ave-a[b1])) printf("%d",a[b1]);
else printf("%d,%d",a[b1],a[b2]);
return 0;
} |
21 | 10202 |
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 | 10203 | float abss(float m)
{
if(m<0)
return(-m);
else return(m);
}
void main()
{
int n,i,j,m;
float ave=0,max=0,num[301],t[300],te;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%f",&num[i]);
ave+=num[i];
}
ave/=n;
for(i=1;i<=n;i++)
{
if(abss(num[i]-ave)>max)
max=abss(num[i]-ave);
}
for(i=1,j=0;i<=n;i++)
{
if(abss(num[i]-ave)==max)
{
j++;
t[j]=num[i];
}
}
m=j;
for(i=1;i<m;i++)
for(j=1;j<m-i;j++)
if(t[j]>t[j+1])
{
te=t[j];
t[j]=t[j+1];
t[j+1]=te;
}
for(i=1;i<=m;i++)
printf((i==1)?"%.0f":",%.0f",t[i]);
} |
21 | 10204 | //============================================================================
// Name : ex5.4.cpp
// Author : Zhang Yu
// Version :
// Copyright : Your copyright notice
// Description : ?????
//============================================================================
int main() {
int n;
cin >>n;
double num[n];
double sum=0;
for (int i=0;i<=n-1;++i)
{
cin >>num[i];
sum+=num[i];
}
double average=sum/n;
double men[n];
for (int i=0;i<=n-1;++i)
men[i]=-1;
double deltamax=0;
for (int i=0;i<=n-1;++i)
{
if (deltamax<abs(average-num[i]))
deltamax=abs(average-num[i]);
}
int k=0;
for (int i=0;i<=n-1;++i)
{
if (deltamax==abs(average-num[i]))
men[k++]=num[i];
}
sort(men,men+k);
for (int i=0;i<=k-1;++i)
{
if (i==0)
cout <<men[i];
else
cout <<","<<men[i];
}
return 0;
}
|
21 | 10205 | void main()
{
int n,i,all=0;
float ave,cha=0,a[300],sum=0,chan[300];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%f",&a[i]);
sum+=a[i];
}
ave=sum/n;
//printf("%f",ave);
for(i=0;i<=n-1;i++)
{
chan[i]=fabs(ave-a[i]);
//printf("%f",chan[i]);
if(chan[i]>cha)
{
cha=chan[i];
}
}
for(i=0;i<=n-1;i++)
if(chan[i]==cha)
all++;
for(i=0;i<=n-1;i++)
{if(chan[i]==cha&&all!=1)
{
printf("%.0f,",a[i]);
all--;
}
else if(chan[i]==cha&&all==1)
printf("%.0f",a[i]);}
getchar();
getchar();
}
|
21 | 10206 | 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 | 10207 | void main()
{
int i,n,x[300],max,min,s=0;
float aver;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&x[i]);
for(i=0;i<n;i++)
{
s=s+x[i];
}
aver=s*1.0/n;
max=x[0];min=x[0];
for(i=1;i<n;i++)
{
if(x[i]>max)
max=x[i];
else if(x[i]<min)
min=x[i];
}
if(max==min)printf("%d",min);
else if((max-aver)>(aver-min))
printf("%d",max);
else if((max-aver)<(aver-min))
printf("%d",min);
else
printf("%d,%d",min,max);
} |
21 | 10208 | /*
* 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 | 10209 | 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 | 10210 | 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 | 10211 | /*
* ???????.cpp
*
* Created on: 2011-12-21
* Author:???
*/
int main(){
int n,a[300],i;
cin>>n;
cin>>a[1];
int min=a[1],max=a[1];//?????????
double sum=a[1]+0.0; //???
for(i=1;i<n;i++){ //???????????????
cin>>a[i];
sum+=a[i];
if(a[i]<min)min=a[i];
else if(a[i]>max)max=a[i];
}
if(2*sum/n>max+min)cout<<min<<endl;//????????????????????
else if(2*sum/n<max+min)cout<<max<<endl;
else cout<<min<<","<<max;
return 0;
}
|
21 | 10212 | int main()
{
int n, count=1, sum=0, i, j, temp,k;
double aver,temp2;
double dis[300];
int a[300];
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%d", &a[i]);
}
for(i=0;i<n;i++)
{
sum=sum+a[i];
}
aver=(double)sum/n;
for(i=0;i<n;i++)
{
if(a[i]>aver)
dis[i]=a[i]-aver;
else
dis[i]=aver-a[i];
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i-1;j++)
{
if(dis[i]>dis[i+1])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
temp2=dis[i];
dis[i]=dis[i+1];
dis[i+1]=temp2;
}
}
}
for(i=n-2;i>0;i--)
{
if(dis[i]==dis[n-1])
count++;
}
k=0;
for(i=n-1;i>n-count;i--,k++)
{
for(j=n-1;j>n-count+k;j--)
{
if(a[i]>a[i-1])
temp=a[i];
a[i]=a[i-1];
a[i-1]=temp;
}
}
if(count>=2)
{
for(i=n-1;i>=n-count+1;i--)
{
printf("%d,", a[i]);
}
printf("%d", a[n-count]);
}
else
printf("%d", a[n-count]);
} |
21 | 10213 | void main()
{
int n;
int a[300]={0};
int i,j;
int sum=0;
double max=0;
double aver;
double b[300]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=(double)sum/n;
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-aver);
if(b[i]>max)
max=b[i];
}
for(i=0;i<n;i++)
if(b[i]==max)
{
j=i;
printf("%d",a[i]);
break;
}
for(i=j+1;i<n;i++)
if(b[i]==max)
printf(",%d",a[i]);
} |
21 | 10214 |
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 | 10215 | 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 | 10216 | 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 | 10217 | int main()
{
int n,i=0,j=0,k=0;
float a[310];
float sum=0,aver;
float b[310],c[310],max,tem;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%f",&a[i]);
}
for(i=1;i<=n;i++)
{
sum=sum+a[i];
}
aver=sum/n;
for(i=1;i<=n;i++)
{
b[i]=a[i]-aver;
if(b[i]<0)
{
b[i]=-b[i];
}
}
max=b[1];
for(i=1;i<=n;i++)
{
if(b[i]>max)
max=b[i];
}
for(i=1;i<=n;i++)
{
if(b[i]==max)
{
j=j+1;
c[j]=a[i];
}
}
if(j==1)
{
printf("%.f",c[1]);
}
else
{
for(i=j;i>1;i--)
{
for(k=1;k<i;k++)
{
if(c[k]>c[k+1])
{
tem=c[k];
c[k]=c[k+1];
c[k+1]=tem;
}
}
}
printf("%.f",c[1]);
for(i=2;i<=j;i++)
{
printf(",%.f",c[j]);
}
}
return 0;
} |
21 | 10218 | int main()
{
int n,a[300],t;
double sum=0,average;
cin>>n;
for (int i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
average=sum/n;
for (int j=0;j<n-1;j++)
{
for (int k=n-1;k>j;k--)
{
if (a[k]<a[k-1])
{
t=a[k];a[k]=a[k-1];a[k-1]=t;
}
}
}
if ( (average-a[0])>(a[n-1]-average) )
cout<<a[0]<<endl;
else if ( (average-a[0])<(a[n-1]-average) )
cout<<a[n-1]<<endl;
else if ( (average-a[0])==(a[n-1]-average) )
cout<<a[0]<<","<<a[n-1]<<endl;
return 0;
}
|
21 | 10219 | 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 | 10220 | 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 | 10221 | /* Note:Your choice is C IDE */
void main()
{
int a[100],n,i,j,t,sum=0;
float x,y,z;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=1;i<n;i++)
{
for(j=0;j<n-i;j++)
if(a[j]>a[j+1])
{t=a[j];
a[j]=a[j+1];
a[j+1]=t;}
}
for(i=0;i<n;i++)
{sum+=a[i];}
x=(float)sum/n;
y=a[n-1]-x;
z=x-a[0];
if(y>z)
{printf("%d",a[n-1]);
for(i=1;i<n-1;i++)
if(a[i]-x==y)
printf(",%d",a[i]);
}
else
{printf("%d",a[0]);
for(i=1;i<=n-1;i++)
if(a[i]-x==z||x-a[i]==z)
printf(",%d",a[i]);
}
}
|
21 | 10222 |
int main()
{
int n, i, s, k, j, p;
int a[300];
cin >> n;
float ave, max;
s=0;
max = 0;
k=0;
for (i=0;i<n;i++)
{
cin >> a[i];
s=s+a[i];
}
ave = s / 1.0 / n;
for (i=0;i<n;i++)
if (fabs(ave - a[i]) >= max)
max = fabs(ave - a[i]);
for (i=0;i<n;i++)
if (max-fabs(ave - a[i])<0.001)
{
a[k]=a[i];
k++;
}
if (k == 1)
cout << a[0] << endl;
else
{
for (i=0;i<k-1;i++)
for (j=0;j<k-1-i;j++)
if (a[j]>a[j+1])
{
p=a[j];
a[j]= a[j+1];
a[j+1]=p;
}
cout << a[0] ;
for (i=1;i<k;i++)
cout << "," << a[i];
cout << endl;
}
return 0;
} |
21 | 10223 | void main()
{
double a[300],s=0,b[300];
double n;
scanf("%lf",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
s=s+a[i];
}
double mv=s/n;
i=0;
for(i=0;i<n;i++)
{
if(a[i]-mv>=0) b[i]=a[i]-mv;
else b[i]=mv-a[i];
}
int j;
double t,r;
i=0;
for(i=0;i<n;i++)
for(j=0;j<n-i;j++)
{
if(b[j]<b[j+1])
{
t=b[j];
b[j]=b[j+1];
b[j+1]=t;
r=a[j];
a[j]=a[j+1];
a[j+1]=r;
}
}
i=1;
printf("%d",(int)a[0]);
while(b[i]==b[0])
{
printf(",%d",(int)a[i]);
i++;
}
} |
21 | 10224 | int main()
{
int n,a[310],i,temp;
double b[310],max=-100,ave,s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
ave=s/n;
for(i=0;i<n;i++)
{
b[i]=fabs(ave-a[i]);
if(b[i]>max)max=b[i];
}
for(i=0;i<n;i++)
if(fabs(b[i]-max)<0.0001){
printf("%d",a[i]);
temp=i;
break;
}
for(i=temp+1;i<n;i++)
if(b[i]==max)
printf(",%d",a[i]);
return 0;
}
|
21 | 10225 | int main()
{
int n,a[300]={0},j,i,sum=0,temp;
float b,c[300]={0},min;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
b=(float)sum/n;
//printf("%f\n",b);??
for(i=0;i<n;i++)
{
if(a[i]>b)
c[i]=a[i]-b;
else
c[i]=b-a[i];
// printf("%f\n",c[i]);
}
for(i=1;i<n;i++)
{
for(j=n-1;j>=i;j--)
{
if(c[j-1]>c[j])
{
min=c[j];
c[j]=c[j-1];
c[j-1]=min;
temp=a[j];
a[j]=a[j-1];
a[j-1]=temp;
}
}
}
if(c[n-1]==c[n-2])
{
if(a[n-2]>a[n-1])
{
temp=a[n-1];
a[n-1]=a[n-2];
a[n-2]=temp;
}
printf("%d,%d",a[n-2],a[n-1]);
}
else
printf("%d",a[n-1]);
return 0;
}
|
21 | 10226 | int a(int k)
{
if(k>0)
return k;
return -k;
}
int main()
{
int num[300];
int n,i,flag=1;
int sum=0,max=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&num[i]);
sum+=num[i];
}
for(i=1;i<=n;i++)
{
if(max<a(num[i]*n-sum))
max=a(num[i]*n-sum);
}
for(i=1;i<=n;i++)
{
if(max==sum-num[i]*n)
{
if(flag==0)
printf(",");
flag=0;
printf("%d",num[i]);
}
}
for(i=1;i<=n;i++)
{
if(max==-sum+num[i]*n)
{ if(flag==0)
printf(",");
flag=0;
printf("%d",num[i]);
}
}
return 0;
}
|
21 | 10227 |
int main()
{
int n,i;
double sum;
int a[300];
cin >>n;
sum=0;
for (i=0;i<n;i++)
{
cin >>a[i];
sum+=a[i];
}
double junzhi=sum/n;
double b[300];
double max=0;
for (i=0;i<n;i++)
{
if (a[i]<junzhi)
b[i]=junzhi-a[i];
else
b[i]=a[i]-junzhi;
if (b[i]>max) max=b[i];
}
int c[300];
int m=-1;
for (i=0;i<n;i++)
if (max==b[i])
{
m++;c[m]=a[i];
}
m++;int j;
for (i=0;i<m;i++)
for (j=i+1;j<m;j++)
if (c[i]>c[j])
{
sum=c[i];c[i]=c[j];c[j]=sum;
}
cout << c[0];
for (i=1;i<m;i++)
cout <<',' <<c[i];
return 0;
} |
21 | 10228 | int main()
{
int n;
cin>>n;
float sum;
int a[300];
for(int i=0;i<=n-1;i++)
{
cin>>a[i];
sum=sum+a[i];
}
int k;
for(int i=0;i<n-1;i++)
{
for(int s=0;s<n-1-i;s++)
{
if(a[s]>a[s+1])
{
k=a[s];
a[s]=a[s+1];
a[s+1]=k;
}
}
}
float pingjun=sum/n;
float h=pingjun-a[0],t=a[n-1]-pingjun;
if(h==t)
{
cout<<a[0]<<","<<a[n-1]<<endl;
}
else if(h>t)
{
cout<<a[0];
}
else if(h<t)
{
cout<<a[n-1];
}
return 0;
}
|
21 | 10229 | void main()
{
int i,n,r;
float a,c;
c=0;
a=0;
r=0;
int k[201],m[201];
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&k[i]);
for(i=1;i<=n;i++)
c=(c+k[i]);
c=c/n;
for(i=1;i<=n;i++)
{if ((k[i]>c?(k[i]-c):(c-k[i]))>a) {a=(k[i]>c?(k[i]-c):(c-k[i]));r=1;m[1]=k[i];}
else if((k[i]>c?(k[i]-c):(c-k[i]))==a) {r=r+1;m[r]=k[i];}}
for(i=1;i<=r;i++)
{printf("%d",m[i]);
if(i!=r) printf(",");}
printf("\n");
}
|
21 | 10230 | void main()
{ float h,p,q,sum=0.0;
long int i,n,a[300],max,min;
scanf("%ld",&n);
scanf("\n");
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
for(i=0;i<n;i++)
{sum=sum+a[i];}
h=sum/n;
max=a[0];
min=a[0];
for(i=0;i<n;i++)
{if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
p=max-h;
q=h-min;
if(p>q)
printf("%ld",max);
if(p<q)
printf("%ld",min);
if(p==q)
printf("%ld,%ld",min,max);
} |
21 | 10231 | 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 | 10232 | int main()
{
int i,n,m;
double sum=0,ave=0,max=0,g[1000],s[1000];
cin>>n;
for(i=0;i<n;i++)
cin>>g[i];
for(i=0;i<n;i++)
sum=sum+g[i];
ave=sum/n;
for(i=0;i<n;i++)
{
if((g[i]-ave)>0)
s[i]=g[i]-ave;
if((g[i]-ave)<0)
s[i]=ave-g[i];
}
for(i=0;i<n;i++)
{
if(s[i]>=max)
{
max=s[i];
m=i;
}
}
for(i=0;i<n;i++)
{
if(s[i]==max&&i<m)
cout<<g[i]<<",";
if(s[i]==max&&i==m)
cout<<g[i];
}
return 0;
}
|
21 | 10233 | int main()
{
int n,i,j,out[100]={0},k=0,t;
double average,a[300]={0},s=0,max=0;
cin>>n;//??n
for(i=0;i<n;i++)
{
cin>>a[i];//??????
s=s+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;
}
}//????
average=s/n;//?????
for(i=0;i<n;i++)
{
if(fabs(a[i]-average)>max)
{
k=0;
max=fabs(a[i]-average);
out[k++]=a[i];
}
else if(fabs(a[i]-average)==max)
{
out[k++]=a[i];
}
}//??????????out???
for(i=0;i<k;i++)
{
if(i==0)cout<<out[i];
else cout<<','<<out[i];
}//??
return 0;
} |
21 | 10234 | int main()
{
int n,i,j;
int a[100];
double max,s,p;
scanf("%d",&n);
max=0;
s=0;
j=0;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
p=s/n;
for(i=1;i<=n;i++)
if (fabs(p-a[i])>max)
{
max=fabs(p-a[i]);
j=i;
}
if (j!=0)
printf("%d",a[j]);
for(i=1;i<=n;i++)
if (fabs(p-a[i])==max && i!=j)
printf(",%d",a[i]);
return 0;
}
|
21 | 10235 | /* 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 | 10236 | int main()
{
unsigned int n,a[300],i,j=0,sum=0,b[300];
double average,ch,max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
average=(double)sum/n;
for(i=0;i<n;i++)
{
if(a[i]==average)
continue;
if(a[i]>average)
ch=a[i]-average;
if(a[i]<average)
ch=average-a[i];
if(ch==max)
{
j++;
b[j]=a[i];
}
if(ch>max)
{
j=0;
max=ch;
b[j]=a[i];
}
}
for(i=1;i<j;i++)
{
int k,t;
for(k=i;k>0;k--)
{
if(b[k]<b[k-1])
{
t=b[k];
b[k]=b[k-1];
b[k-1]=t;
}
}
}
printf("%d",b[0]);
for(i=1;i<=j;i++)
printf(",%d",b[i]);
return 0;
} |
21 | 10237 | int main() {
int n, i, sum = 0, j = 0;
cin >> n;
int a[n], c[n];
for (i = 0; i < n; i++) {
cin >> a[i];
sum = sum + a[i];
}
double b[n], average = 0, max;
average = 1.0 * sum / n;
for (i = 0; i < n; i++) {
b[i] = fabs(a[i] - average);
}
max = b[1];
for (i = 0; i < n; i++) {
if (b[i] > max) {
max = b[i];
}
}
for (i = 0; i < n; i++) {
if (fabs(b[i] - max) < 1e-6) {
c[j] = a[i];
j++;
}
}
if (j == 1) {
cout << c[0] << endl;
} else {
for (i = 0; i < j - 1; i++) {
cout << c[i] << ",";
}
cout << c[j - 1];
}
return 0;
}
|
21 | 10238 |
int main()
{
int n=0;//??????n
int a[300],sum=0,t;//????a??????,sum???,t????
double ave,dis[300],max=0.0;//???????ave?????,??dis??????,max?????????
cin>>n;
int i=0,j=0;//??????ij
int p=0;//p?????
for(i=0;i<n;i++)//????,??
{
cin>>a[i];
sum+=a[i];
}
ave=(double)sum/(double)n;//???
for(i=0;i<n-1;i++)//?????????
for(j=i+1;j<n;j++)
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
for(i=0;i<n;i++)//?????
dis[i]=(a[i]-ave)*(a[i]-ave);
max=dis[0];
for(i=0;i<n;i++)//??????
if(dis[i]>=max)
{
max=dis[i];
p++;
}
if(p==1)//?????????????
{
for(i=0;i<n;i++)
if(dis[i]==max)
cout<<a[i];
}
else
if(p>1)
{
for(i=0;i<n;i++)
if(dis[i]==max)
{
j=i;
cout<<a[j];
break;
}
for(i=j+1;i<n;i++)
if(dis[i]==max)
cout<<","<<a[i];
}
return 0;
} |
21 | 10239 | void main()
{
int n, i, j, temp, num=0, *a;
float ave=0, *depart, max=0;
scanf("%d",&n);
a=(int *)malloc(n*sizeof(int));
depart=(float *)malloc(n*sizeof(float));
for(i=0; i<n; i++)
{
scanf("%d",a+i);
}
for(i=n-1; i>0; i--)
{
for(j=0; j<i; j++)
{
if(*(a+j)>*(a+j+1))
{
temp=*(a+j);
*(a+j)=*(a+j+1);
*(a+j+1)=temp;
}
}
}
//for(i=0; i<n; i++) printf("%d\n",*(a+i));
for(i=0; i<n; i++)
{
ave=ave+(float)*(a+i)/n;
}
for(i=0; i<n; i++)
{
*(depart+i)=ave-*(a+i);
if(*(depart+i)<0) *(depart+i)=-*(depart+i);
if(*(depart+i)>max) max=*(depart+i);
}
for(i=0; i<n; i++)
{
if(fabs(*(depart+i)-max)<1.0e-3) num=num+1;
}
//for(i=0; i<n; i++) printf("%f\n",*(depart+i));
//printf("!!!%f\n",max);
//printf("%d\n",num);
for(i=0; i<n; i++)
{
if(fabs(*(depart+i)-max)<1.0e-3)
{
printf("%d",*(a+i));
break;
}
}
i=i+1;
for(; i<n; i++)
{
if(fabs(*(depart+i)-max)<1.0e-3)
{
printf(",%d",*(a+i));
}
}
} |
21 | 10240 | /*
* 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 | 10241 | int main()
{
int a[310], n, i, j, temp, count=0;
double s = 0, b[310] = {0}, m;
cin >> n;
for(i=0;i<n;i++)
{
cin >> a[i];
s+=a[i];
}
for(i=0;i<n-1;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;
}
}
s = s/n;
for(i=0;i<n;i++)
{
if(a[i]>s)
b[i] = a[i] - s;
else
b[i] = s - a[i];
if(b[i]>m)
m = b[i];
}
for(i=0;i<n;i++)
{
if(b[i]>=m)
count++;
}
for(i=0;i<n;i++)
{
if(b[i]>=m)
{
count--;
if(count)
cout << a[i] << ",";
else
cout << a[i] << endl;
}
}
return 0;
} |
21 | 10242 | 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 | 10243 | int main()
{
int n,c=0;
int i,j;
int a[300];
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-1;j++){
if (a[j]>a[j+1]){
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
double tot=0;
for (i=0;i<n;i++){
tot+=a[i];
}
tot=tot/n;
double cha=0,tt;
for (i=0;i<n;i++){
tt=a[i]-tot;
if (tt<0){
tt=-tt;
}
if (tt>cha){
cha=tt;
}
}
for (i=0;i<n;i++){
tt=a[i]-tot;
if (tt<0){
tt=-tt;
}
if (cha==tt){
if (c>0){
printf(",");
}
printf("%d",a[i]);
c++;
}
}
printf("\n");
return 0;
} |
21 | 10244 | void main()
{int n,a[20],s,h=0,i,w=0,max,min;
float p,q;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
q=(float)n;
for(i=0,s=0;i<n;i++)
s=s+a[i];
p=s/q;
min=a[0];
for(i=0;i<n;i++)
if(a[i]<min)
{ min=a[i];h=i;}
max=a[0];
for(i=0;i<n;i++)
if(a[i]>max)
{ max=a[i];w=i;}
if(fabs(fabs((float)a[h]-p)-fabs((float)a[w]-p))<1e-5)
printf("%d,%d",a[h],a[w]);
else if(fabs((float)a[h]-p)>fabs((float)a[w]-p))
printf("%d",a[h]);
else if(fabs((float)a[h]-p)<fabs((float)a[w]-p))
printf("%d",a[w]);
} |
21 | 10245 | int main()
{
int n,i;
scanf("%d",&n);
int an[300]={0},sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&an[i]);
sum+=an[i];
}
float average;
average=sum*1.0/n;
float away[300]={0};
for(i=0;i<n;i++)
{
if(an[i]-average>=0)
{
away[i]=an[i]-average;
}
else
{
away[i]=average-an[i];
}
}
float f=away[0];
for(i=1;i<n;i++)
{
if(away[i]>=f)
{
f=away[i];
}
}
int max[10]={0},j,num=0;
for(i=0;i<n;i++)
{
if(away[i]==f)
{
num++;
max[num]=an[i];
}
}
if(num==1)
printf("%d",max[1]);
else
{
for(int m=num-1;m>0;m--)
{
for(int n=0;n<m;n++)
if(max[n]>max[n+1])
{
int ntmp=max[n];
max[n]=max[n+1];
max[n+1]=ntmp;
}
}
for(int p=1;p<=num;p++)
{
printf("%d",max[p]);
if(p<=num-1)
printf(",");
}
}
return 0;
} |
21 | 10246 |
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 | 10247 | 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 | 10248 | void main()
{ int n,i,num[300],s=0,u=0,m;
float aver,t[300],max,sum=0,min;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d,",&num[i]);
for(i=0;i<n;i++)
sum=sum+(float)(num[i]);
aver=sum/(float)(n);
for(i=0;i<n;i++)
t[i]=aver-(float)(num[i]);
min=t[0];
for(i=0;i<n;i++)
{if(t[i]>min)
{min=t[i];
s=i;
}
max=t[0];
for(m=0;m<n;m++)
{if(t[m]<max)
{max=t[m];
u=m;
}
}
}if(t[s]+t[u]<0)
printf("%d",num[u]);
else if(t[s]+t[u]>0)
printf("%d",num[s]);
else
printf("%d,%d",num[s],num[u]);
} |
21 | 10249 | main()
{
int n,i;
float min,max,a[300],sum,aver;
scanf("%d",&n);
scanf("%f",&a[0]);
min=max=sum=a[0];
for(i=1;i<n;i++)
{
scanf("%f",&a[i]);
sum=sum+a[i];
if(max<a[i]) max=a[i];
else if(min>a[i]) min=a[i];
}
aver=sum/n;
if(max-aver>aver-min) printf("%.0f",max);
else if(max-aver<aver-min) printf("%.0f",min);
else printf("%.0f,%.0f",min,max);
return 0;
} |
21 | 10250 | float abs(float x);
main()
{
int input[300],i,flag=-1,num,xiabiao=0;
float average,sum=0.,fst;
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%d",&input[i]);
sum+=input[i];
}
average=sum/num;
fst=abs(input[0]-average);
for(i=1;i<num;i++)
{
if(abs(input[i]-average)>fst){fst=abs(input[i]-average);xiabiao=i;}
}
for(i=0;i<num;i++)
if(abs(input[i]-average)==fst)flag++;
if(flag==0)printf("%d",input[xiabiao]);
else
{
if(input[xiabiao]<average)
printf("%d,%d",input[xiabiao],(2*(int)average-input[xiabiao]));
else
printf("%d,%d",(2*(int)average-input[xiabiao]),input[xiabiao]);
}
}
float abs(float x)
{
if(x<0)return(-x);
else return(x);
} |
21 | 10251 | int main()
{
int n, i, j, sum = 0, num[300], flag = 0;
double temp, average;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> num[i];
sum += num[i];
}
average = (double) sum / n;
for (i = 0; i < n; i++)
for (j = 0; j < n - i - 1; j++)
{
if (num[j] > num[j+1])
{
temp = num[j];
num[j] = num[j+1];
num[j+1] = temp;
}
}
temp = fabs (average - num[0]);
for (i = 1; i < n; i++)
{
if (temp < fabs(average - num[i]))
temp = fabs(average - num[i]);
}
for (i = 0; i < n; i++)
{
if (fabs((fabs(num[i] - average) - temp)) < 1e-5)
if (flag == 0)
{
cout << num[i];
flag = 1;
}
else
cout << "," << num[i];
}
cout << endl;
return 0;
} |
21 | 10252 | int a[300];
int n;
float sum=0;
float ave;
int main()
{
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
ave=(float)sum/n;
void sort();
sort();
int flag=0;
if(ave-a[0]==a[n-1]-ave)
{
for(i=0;i<n;i++)
{
if(a[i]==a[0]||a[i]==a[n-1])
{
if(i!=0)
printf(",");
printf("%d",a[i]);
}
}
}
else if(ave-a[0]>a[n-1]-ave)
{
for(i=0;i<n;i++)
{
if(a[i]==a[0])
{
if(i!=0&&a[i+1]==a[i])
printf(",");
printf("%d",a[i]);
}
}
}
else
{
for(i=0;a[i];i++)
{
if(a[i]==a[n-1])
{
if(flag!=0)
printf(",");
printf("%d",a[i]);
flag=1;
}
}
}
return 0;
}
void sort()
{
int i,j;
for(i=0;i<n-1;i++)
{
for(j=i;j<n;j++)
{
if(a[i]>a[j])
{
int t;
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
} |
21 | 10253 | void main()
{
int n,i,j;
int a[300];
float k=0.0,temp,tempo;
float b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
k=k+a[i];
}
k=k/n;
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-k);
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(b[i]<b[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
tempo=b[i];
b[i]=b[j];
b[j]=tempo;
}
}
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
if(b[i]==b[0])
printf(",%d",a[i]);
}
}
|
21 | 10254 | void main()
{
int m,n,i,a[301],sum,max,min;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sum=0;max=a[0];min=a[0];
for (i=0;i<n;i++)
{
sum+=a[i];
if (a[i]>max) max=a[i];
if (a[i]<min) min=a[i];
}
max*=n;min*=n;
if ((max-sum)>(sum-min)) printf("%d",max/n);
if ((max-sum)<(sum-min)) printf("%d",min/n);
if ((max-sum)==(sum-min)) printf("%d,%d",min/n,max/n);
} |
21 | 10255 | float gap(int x,float y){
float z;
if(x>y)z=x-y;
else z=y-x;
return z;
}
void main(){
int num[300];
float g;
int n,i,j=0;
float ave=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&num[i]);
ave+=num[i];
}
ave=ave/n;
for(i=0;i<n-1;i++){
if (gap(num[i],ave)<gap(num[i+1],ave) && gap(num[i+1],ave)>g)g=gap(num[i+1],ave);
if (gap(num[i],ave)>gap(num[i+1],ave) && gap(num[i],ave)>g)g=gap(num[i],ave);
}
for(i=0;i<n;i++){
if(gap(num[i],ave)==g){
printf("%d",num[i]);
j=i+1;
break;}
}
for(i=j;i<n;i++)if(gap(num[i],ave)==g)printf(",%d",num[i]);
}
|
21 | 10256 | void main()
{
int n,a[300],b[300],i,s=0,k=0,j,t;
double x,y;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
s=s+a[i];
}
x=(double)s/(double)n;
y=fabs(a[0]-x);
for(i=1;i<n;i++)
if(fabs(a[i]-x)>y)
y=fabs(a[i]-x);
for(i=0;i<n;i++)
if(fabs(a[i]-x)==y)
{
b[k]=a[i];
k++;
}
if(k==1)
printf("%d",b[0]);
else if(k==2)
{
if(b[0]>b[1])
printf("%d,%d",b[1],b[0]);
else printf("%d,%d",b[0],b[1]);
}
else
{
for(j=0;j<k-1;j++)
for(i=0;i<k-1-j;i++)
if(b[i]>b[i+1])
{
t=b[i];
b[i]=b[i+1];
b[i+1]=t;
}
printf("%d",b[0]);
for(i=1;i<k;i++)
printf(",%d",b[i]);
}
} |
21 | 10257 | int main()
{
int n,i,j;
double sum=0,ave=0;
double a[300];
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
ave=sum/n;
double dis[300];
for(i=0;i<n;i++)
{
dis[i]=fabs(a[i]-ave);
}
double max=0;
for(i=0;i<n;i++)
{
if(dis[i]>max)
max=dis[i];
}
double b[300]={0};
int k=0,temp=0;
for(i=0;i<n;i++)
{
if(fabs(dis[i]-max)<0.01)
{
b[k]=a[i];
k++;
}
}
if(k==1){cout<<b[0];}
else{
for(i=0;i<k;i++)
{
for(j=i+1;j<k;j++)
{
if(b[i]>b[j])
{
temp=b[i];
b[i]=b[j];
b[j]=temp;
}
}
}
cout<<b[0];
for(i=1;i<k;i++)
cout<<","<<b[i];}
return 0;
}
|
21 | 10258 |
float k( float i)
{
if(i>=0)
return i;
else return -i;
}
void main()
{
int n,a[400],s=0,max=0,min,count=0,i;
float aver;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
aver=((float)s)/n;
for(i=0,min=a[0];i<n;i++)
{
if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
if(((float)max-aver)>(-(float)min+aver))
printf("%d",max);
if(((float)max-aver)<(-(float)min+aver))
printf("%d",min);
if(((float)max-aver)==(-(float)min+aver))
printf("%d,%d",min,max);
} |
21 | 10259 | int main()
{
int n;
float pj=0,max=0,b[300],a[300],sum=0;
int c[300]={0};
int i=0,j=0,k=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
pj=sum/n;
for(i=0;i<n;i++)
{
if((pj-a[i])>0) b[i]=pj-a[i];
else b[i]=a[i]-pj;
}
for(i=0;i<n;i++)
{
if(b[i]>max) max=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{
c[k]=i;
k++;
}
}
for(i=0;i<(k-1);i++)
for(j=0;j<(k-i-1);j++)
if(a[c[j]]>a[c[j+1]]) swap(a[c[j]],a[c[j+1]]);
for(i=0;i<k-1;i++)
cout<<a[c[i]]<<",";
cout<<a[c[k-1]];
return 0;
}
|
21 | 10260 |
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 | 10261 | int main()
{
int num[301],change[301];
int n=0,i=0,sum=0,count=0;
double ave=0,max=0;
memset(num,0,sizeof(num));
memset(change,0,sizeof(change));
cin>>n;
for(i=0;i<n;i++)
cin>>num[i];
for(i=0;i<n;i++)
sum=sum+num[i];
ave=(double)sum/n;
for(i=0;i<n;i++)
if(fabs(num[i]-ave)>max)
max=fabs(num[i]-ave);
for(i=0;i<n;i++)
if(fabs(fabs(num[i]-ave)-max)<0.00001)
{
change[count]=num[i];
count++;
}
if(count==2)
{
if(change[1]>change[0])
cout<<change[0]<<","<<change[1];
else
cout<<change[1]<<","<<change[0];
}
else
cout<<change[0];
return 0;
} |
21 | 10262 | main()
{
int n,i,sum=0,c,d=0,x=0;
struct s
{
int n;
int c;
}t[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&t[i].n);
sum+=t[i].n;
}
for(i=0;i<n;i++)
{
t[i].c=sum-t[i].n*n;
if(t[i].c<0)
t[i].c=-t[i].c;
if(t[i].c>c)
c=t[i].c;
}
for(i=0;i<n;i++)
{
if(t[i].c==c)
{
if(t[i].n*n<=sum)
{
x++;
}
else
d++;
}
}
if(d!=0)
{
for(i=0;i<x;i++)
{
printf("%d,",(sum-c)/n);
}
for(i=0;i<d;i++)
{
printf("%d",(sum+c)/n);
if(i<d-1)
printf(",");
}
}
else
for(i=0;i<x;i++)
{
printf("%d",(sum-c)/n);
if(i<x-1)
printf(",");
}
} |
21 | 10263 | int main()
{
int n,i,j,t;
cin>>n;
int x[n+1];
double dif[n+1], ave,sum=0,max=0;
for(i=1;i<n+1;i++)
{
cin>>x[i];
sum=sum+x[i];
}
ave=sum/n;
for(i=1;i<n+1;i++)
{
for(j=i;j<n+1;j++)
{
if(x[j]<x[i])
{
t=x[i];
x[i]=x[j];
x[j]=t;
}
}
}
for(i=1;i<n+1;i++)
{
dif[i]=x[i]-ave;
if(dif[i]<0) dif[i]=-dif[i];
if(dif[i]>max) max=dif[i];
}
int flag=0;
for(i=1;i<n+1;i++)
{
if(dif[i]==max)
{
if(flag==0)
{
cout<<x[i];
flag++;
}
else cout<<","<<x[i];
}
}
return 0;
} |
21 | 10264 | int main()
{
int n,a[400],i,j,b[400],count=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
double sum=0,ave,max=0;
for(i=1;i<=n;i++)
{
sum+=a[i];
}
ave=sum/n;
for(i=1;i<=n;i++)
{
if(fabs(ave-(double)a[i])>max)
{
max=fabs(ave-(double)a[i]);
}
}
for(i=1;i<=n;i++)
{
if(max-fabs(ave-(double)a[i])<0.0001)
{
count++;
b[count]=a[i];
}
}
if(count==1)
{
cout<<b[1];
}
else
{
for(i=count;i>0;i--)
{
for(j=1;j<i;j++)
{
if(b[j]>b[j+1])
{
swap(b[j],b[j+1]);
}
}
}
for(i=1;i<count;i++)
cout<<b[i]<<',';
cout<<b[count];
}
return 0;
}
|
21 | 10265 | int main()
{
int n,i, k,j=0,p;
float average,a[100],sum=0,c[100],d[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
}
for(i=0;i<n-1;i++)
{
for(k=0;k<n-i-1;k++)
{
if(a[i]>a[i+1])
{
float t=0;
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
}
for(i=0;i<n;i++)
{
sum+=a[i];
}
average=sum/n;
for(i=0;i<n;i++)
{
c[i]=average-a[i];
if(c[i]<0)
{
c[i]=a[i]-average;
}
}
float max=0;
for(i=0;i<n;i++)
{
if(c[i]>max)
{
max=c[i];
}
}
for(i=0;i<n;i++)
{
if(c[i]==max)
{
d[j]=a[i];
j++;
}
}
if(j==1)
{
printf("%.0f", d[j-1]);
}
else if(j>1)
{
for(p=0;p<j-1;p++)
{
printf("%.0f,", d[p]);
}
printf("%.0f",d[j-1]);
}
return 0;
}
|
21 | 10266 |
int main( int argc, char* argv[] ){
int count, sentry = 0;
int * values;
int i, sum = 0;
double ave, temp, distance = 0;
int * mid;
scanf ( " %d ", &count );
values = ( int * )malloc( count * sizeof(int) );
mid = ( int * )malloc( count * sizeof(int) );
for ( i = 0; i < count; i++ ){
scanf ( "%d", (values + i) );
sum += *( values + i );
}
ave = 1.0 * sum / count;
for ( i = 0; i < count; i++ ){
temp = fabs( 1.0 * values[i] - ave );
if ( temp > distance ){
distance = temp;
mid[0] = values[i];
sentry = 0;
}
else if ( temp == distance ){
sentry++;
mid[sentry] = values[i];
}
}
printf( "%d", mid[0] );
for ( i = 1; i <= sentry; i++ ){
printf( ",%d", mid[i]);
}
return 0;
}
|
21 | 10267 |
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 | 10268 | int main(){
int n;
scanf("%d",&n);
int sz[LEN];
int sum=0;
for(int i=0;i<n;i++){
scanf("%d",&sz[i]);
sum+=sz[i];
}
double junzhi;
junzhi=1.0*sum/n;
int min=sz[0];
int max=sz[0];
for(int r=0;r<n;r++){
if(sz[r]>max){
max=sz[r];
}
if(sz[r]<min){
min=sz[r];
}
}
if(1.0*(max+min)/2==junzhi){
printf("%d,%d",min,max);
}else if(junzhi-min>max-junzhi){
printf("%d",min);
}else{
printf("%d",max);
}
return 0;
} |
21 | 10269 | int main(int argc, char* argv[])
{
int n,i,sum=0;
scanf("%d",&n);
int *a;
a = (int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
double aver=sum*1.0/(n*1.0);
double *c;
c = (double *)malloc(sizeof(double)*n);
for(i=0;i<n;i++){
c[i]=fabs(a[i]*1.0-aver);
}
int d=0;
double max=c[0];
for(i=0;i<n;i++){
if(max<c[i]){
max=c[i];
d=i;
}
}
int b=0;
for(i=0;i<n;i++){
if(c[i]==max)
b++;
}
printf("%d",a[d]);
if(b!=1){
for(i=d+1;i<n;i++){
if(c[i]==max)
printf(",%d",a[i]);
}
}
return 0;
}
|
21 | 10270 | int main()
{
int n,i,k=0;
scanf("%d",&n);
float x,nu[300];
float d=0;
float z=0;
float nn[300];
for(i=0;i<n;i++)
{
scanf("%f",&nu[i]);
z=z+nu[i];
}
x=z/(float)n;
for(i=0;i<n;i++)
{
if(x-nu[i]>d)
{ d=x-nu[i];}
if(nu[i]-x>d)
{ d=nu[i]-x;}
}
for(i=0;i<n;i++)
{
if(x-nu[i]-d<=0.01&&x-nu[i]-d>=-0.01)
{
nn[k]=nu[i];
k++;
}
else
if(nu[i]-x-d<=0.01&&nu[i]-x-d>=-0.01)
{ nn[k]=nu[i];
k++;}
}
printf("%.0f",nn[0]);
for(i=1;i<k;i++)
{
printf(",%.0f",nn[i]);
}
return 0;
} |
21 | 10271 | void main()
{
int i,n,a[300],*p[300],j=0,j1,j2,*temp;
double aver=0,max=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
aver=aver+a[i];
}
aver/=n;
for (i=0;i<n;i++)
max=fabs(aver-a[i])>max?fabs(aver-a[i]):max;
for (i=0;i<n;i++)
if (fabs(fabs(aver-a[i])-max)<1e-6)
{
p[j]=&a[i];
j++;
}
for (j1=0;j1<j-1;j1++)
for (j2=0;j2<j-1-j1;j2++)
if (*p[j2]>*p[j2+1])
{
p[j2]=temp;
p[j2]=p[j2+1];
p[j2+1]=temp;
}
printf("%d",*p[0]);
for (j1=1;j1<j;j1++)
printf(",%d",*p[j1]);
}
|
21 | 10272 | int main()
{
int a[300];
double b[300];
int n;
int i,j;
double zong=0;
double max=0;
double ping;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
zong=zong+a[i];
}
ping=zong/n;
for(i=0;i<=n-1;i++)
{
if(ping-a[i]>=0)
b[i]=ping-a[i];
else
b[i]=a[i]-ping;
}
for(i=0;i<=n-1;i++)
{
if(b[i]>max)
{
max=b[i];
}
}
for(i=0,j=0;i<=n-1;i++)
{
if(b[i]==max)
{
j++;
if(j==1)
printf("%d",a[i]);
else
printf(",%d",a[i]);
}
}
printf("\n");
return 0;
} |
21 | 10273 | int main()
{
int n,i,j,temp,a[300],sum=0;
double t,b[300],max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
t=1.0*sum/n;
for(i=0;i<n-1;i++)
{
for(j=n-1;j>i;j--)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for(j=0;j<n;j++)
{
if(a[j]>=t)
{
b[j]=a[j]-t;
}
else
{
b[j]=t-a[j];
}
max=b[0];
if(b[j]>=max)
{
max=b[j];
}
else if(b[j]<max)
{
max=b[0];
}
}
int mm = 0;
for(j=0;j<n;j++)
{
if (max == b[j])
{
if ( mm == 0)
{
printf("%d",a[j]);
}
else
{
printf(",%d",a[j]);
}
mm++;
}
}
return 0;
}
|
21 | 10274 | int main()
{
int n, a[300], flag = 0, i;
double ave, sum = 0, max = 0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
ave = sum / n;
for (i = 0; i < n; i++)
if (fabs(a[i] - ave) - max > 1e-5)
max = fabs(a[i] - ave);
for (i = 0; i < n; i++)
if (fabs(fabs(a[i] - ave) - max) < 1e-5 && flag == 0)
{
cout << a[i];
flag = 1;
}
else if (fabs(fabs(a[i] - ave) - max) < 1e-5 && flag == 1)
cout << ',' << a[i];
return 0;
}
|
21 | 10275 | void main()
{
int n;
int sum;
int a[300],i;
float b[300],ave;
float c,d;
sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
c=sum;d=n;
ave=c/d;
for(i=0;i<n;i++)
{
if(a[i]>ave)
b[i]=a[i]-ave;
else b[i]=ave-a[i];
}
int flag;
flag=0;
for(i=0;i<n;i++)
{
if(b[i]>b[flag])
flag=i;
}
int flags;
flags=(-1);
for(i=0;i<n;i++)
{
if(b[i]==b[flag]&&i!=flag)
flags=i;
}
if(flags==(-1))
printf("%d",a[flag]);
else
{
if(a[flag]>a[flags])
printf("%d,%d",a[flags],a[flag]);
else printf("%d,%d",a[flag],a[flags]);
}
}
|
21 | 10276 |
struct A
{
double data;
double differences;
}a[300+10],temp;
int n;
double getaverage(int n)
{
double sum=0;
for(int i=0;i<=n-1;i++)
sum+=a[i].data;
return sum/n;
}
int main()
{
cin>>n;
for(int i=0;i<=n-1;i++)
cin>>a[i].data;
double average=getaverage(n);
for(int i=0;i<=n-1;i++)
{
a[i].differences=a[i].data-average;
if(a[i].differences<0)
{
a[i].differences=-a[i].differences;
}
}
for(int i=0;i<=n-1;i++)
for(int j=n-1;j>i;j--)
{
if(a[i].differences<a[j].differences)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
double output[300+10];
output[0]=a[0].data;
int k=0;
for(int i=1;i<=n-1;i++)
{
if(a[i].differences==a[0].differences)
output[++k]=a[i].data;
}
for(int i=0;i<=k;i++)
for(int j=k;j>=i;j--)
{
if(output[i]>output[j])
{
double temp1=output[i];
output[i]=output[j];
output[j]=temp1;
}
}
for(int i=0;i<=k-1;i++)
cout<<output[i]<<",";
cout<<output[k]<<endl;
return 0;
}
|
21 | 10277 | /*
* 1.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main(){
int n,i,sum=0,num=1;
int a[500];
double aver,c;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
aver=1.0*sum/n;
c=abs(aver-a[0]);
for(i=1;i<n;i++){
if(abs(aver-a[i])==c)
num++;
if(abs(aver-a[i])>c){
c=abs(aver-a[i]);
num=1;
}
}
if(num==1)
for(i=0;i<n;i++)
if(c==abs(aver-a[i]))
cout<<a[i];
if(num>1){
int g=0,h=0;
for(i=0;i<n;i++)
if(c==(aver-a[i])){
g=1;
cout<<a[i];
break;
}
i++;
for(;i<n;i++)
if(c==(aver-a[i]))
cout<<","<<a[i];
if(g!=1){
for(i=0;i<n;i++)
if(c==(a[i]-aver)){
h=1;
cout<<a[i];
break;
}
}
if(h==1)i++;
if(g==1)i=0;
for(;i<n;i++)
if(c==(a[i]-aver))
cout<<","<<a[i];
}
return 0;
}
|
21 | 10278 |
int main()
{
int n,i,t,num[300],sum=0,k,m;
float a,c[300],mc=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&t);
num[i]=t;
sum+=num[i];
}
a=(float)sum/(float)n;
for(i=0;i<n;i++){
if(num[i]>a)
c[i]=(float)num[i]-a;
else
c[i]=a-(float)num[i];
}
for(i=0;i<n;i++){
if(c[i]>mc){
mc=c[i];
k=i;
}
}
for(i=0;i<n;i++){
if(c[i]>=mc){
mc=c[i];
m=i;
}
}
if(m==k)
printf("%d",num[k]);
else if(num[k]>num[m])
printf("%d,%d",num[m],num[k]);
else
printf("%d,%d",num[k],num[m]);
return 0;
} |
21 | 10279 | int n,i;
long int rec[301];
long int min,max;
float sum;
main()
{
scanf("%d\n",&n);
sum=0;
min=100000;
max=0;
for(i=1;i<=n;i++)
{
scanf("%d",&rec[i]);
sum=sum+rec[i];
if (rec[i]<min) min= rec[i];
if (rec[i]>max) max=rec[i];
}
sum=sum/n;
if (max-sum==sum-min) printf("%d,%d\n",min,max);
else if (max-sum>sum-min) printf("%d\n",max);
else printf("%d\n",min);
} |
21 | 10280 |
int main()
{
int n, i, k;
double t;
double b[300] = {0};
double a[300];
cin >> n;
double num, sum = 0;
for (i = 0; i < n; i++)
{
cin >> a[i];
sum = sum + a[i];
}
num = sum / n;
double max = 0;
for (i = 0; i < n; i++)
{
if (fabs(num - a[i]) > max)
{
max = fabs(num - a[i]);
}
}
int j = 0;
for (i = 0; i < n; i++)
{
double cha = fabs(num - a[i]);
if (cha - max == 0 )
{
b[j] = a[i];
j++;
}
}
for (i = 0; i < j - 1; i++)
for (k = 0; k < j-i-1; k++)
{
if (b[k] > b[k+1])
{
t= b[k];
b[k] = b[k+1];
b[k+1] = t;
}
}
for (i = 0; i < j-1; i++)
cout << b[i]<<",";
cout << b[j-1];
return 0;
} |
21 | 10281 |
int main()
{
int n;
cin >> n;
int iin[100];
int counter = 0;
for(int i = 0; i < n; i++){
cin >> iin[i];
counter = counter + iin[i];
}
//cout << counter << endl;
int buffer = 0;
for(int i = 0; i < n; i++){
if(abs((iin[i]*n-counter))>buffer)
buffer = abs(iin[i]*n-counter);
}
//cout << buffer << endl;
for(int i = 0; i < n-1; i++){
for(int j = i; j < n; j++){
if(buffer==abs(iin[i]*n-counter)&&buffer==abs(iin[i]*n-counter)&&(iin[i]>iin[j]))
swap(iin[i],iin[j]);
}
}
int buffer2 = 0;
for(int i = 0; i < n; i++){
if(buffer==abs(iin[i]*n-counter))
buffer2++;
}
for(int i = 0; i < n; i++){
if(buffer==abs(iin[i]*n-counter)&&buffer2!=1){
buffer2--;
cout << iin[i] << ',';
continue;
}
if(buffer==abs(iin[i]*n-counter)&&buffer2==1){
cout << iin[i];
}
}
return 0;
}
|
21 | 10282 | float absd(float a)
{
if (a<0)
a=-a;
return(a);
}
void main()
{
float ave,num,s;
int m,j,k,i,a[300]={0};
scanf("%d",&m);
s=0;
for(i=0;i<m;i++)
scanf("%d",&a[i]);
for(i=0;i<m;i++)
s=s+a[i];
ave=s/m;
num=absd(a[0]-ave);
k=a[0];j=0;
for (i=1;i<m;i++)
{
if (absd(ave-a[i])>num)
{
num=absd(ave-a[i]);
k=a[i];
}
else
if(absd(ave-a[i])==num)
j=a[i];
}
if(j==0)
printf("%d",k);
else
if(k>j)
printf("%d,%d",j,k);
else
printf("%d,%d",k,j);
} |
21 | 10283 | float f(float a[],int n)
{
float s=0;
int i;
for(i=0;i<=n-1;i++)
{
s=s+a[i];
}
return s/n;
}
float g(float a)
{
if(a>0)
return a;
else
return -a;
}
void main()
{
float a[100],b[100],c=0,d,t,m[100];
int n,i,j,k=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%f",&a[i]);
for(i=0;i<=n-1;i++)
{
for(j=n-2;j>=i;j--)
{
if(a[j+1]<a[j])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
d=f(a,n);
for(i=0;i<=n-1;i++)
{
b[i]=g((d-a[i]));
if(b[i]>c)
c=b[i];
}
for(i=0;i<=n-1;i++)
{
if(b[i]==c)
{
m[k]=a[i];
k++;
}
}
if(k==1)
printf("%.0f",m[0]);
else
{
for(i=0;i<=k-2;i++)
printf("%.0f,",m[i]);
printf("%.0f",m[k-1]);
}
} |
21 | 10284 | //********************************
//* ??? ?????
//* ????? *
//********************************
int main()
{
int n;
cin>>n;
int a[301]={0};
int i,j,temp=0;
double t=0;
for(i=0;i<n;i++)
{
cin>>a[i];
t+=a[i];
}
double avrage=t/n;
double b[301]={0};
for(i=0;i<n;i++)
b[i]=fabs(a[i]-avrage);
t=0;
double c[301]={0};
int k=0;
for(i=0;i<n;i++)
if(b[i]>t)
t=b[i];
for(i=0;i<n;i++)
if(b[i]==t)
{
c[k]=a[i];
k++;
}
for(i=1;i<=k-2;i++)
for(j=0;j<=k-1-i;j++)
{
if(c[j]>c[j+1])
{
t=c[j];
c[j]=c[j+1];
c[j+1]=t;
}
}
for(i=0;i<k;i++)
{
if(i==0)
cout<<c[i];
else
cout<<","<<c[i];
}
return 0;
} |
21 | 10285 | void sort(int min[],int n);
void main()
{
int a[300],n,i,j=0,sum=0,min[300],m;
float av,b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
av=(float)sum/(float)n;
for(i=0;i<n;i++)
{
if(a[i]>av)
b[i]=a[i]-av;
else
b[i]=av-a[i];
}
m=0;
for(i=0;i<n;i++)
if(b[m]<b[i])
m=i;
for(i=0;i<n;i++)
if(b[i]==b[m])
min[j++]=a[i];
{
int i,x,t;
for(i=0;i<j-1;i++)
for(x=0;x<j-i-1;x++)
if(min[x]>min[x+1])
{
t=min[x];
min[x]=min[x+1];
min[x+1]=t;
}
}
for(i=0;i<j;i++)
{
printf("%d",min[i]);
if(i!=j-1)
printf(",");
}
}
|
21 | 10286 | int main()
{
int b[max]={0},x;
int n,i,j,a[max]={0},sum=0,r=0,tem;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(i=0;i<n;i++)
for(j=0;j<n-1-i;j++)
{
if(a[j]>a[j+1])
{
tem=a[j];
a[j]=a[j+1];
a[j+1]=tem;
}
}
for(i=0;i<n;i++)
b[i]=fabs(a[i]*n-sum);
x=b[0];
for(i=0;i<n;i++)
if(b[i]>x)
x=b[i];
for(i=0;i<n;i++)
{
if(b[i]==x)
{
if(r==0)
printf("%d",a[i]);
else
printf(",%d",a[i]);
r++;
}
}
return 0;
}
|
21 | 10287 | int a[305];
int n;
double s;
double ave;
int minn, maxn;
int ans[305], num;
int main()
{
cin >> n;
s = 0;
num = 0;
cin >> a[0];
s += a[0];
minn = a[0]; maxn = a[0];
for( int i = 1;i < n; i++ )
{
cin >> a[i];
s += a[i];
if(minn > a[i]) minn = a[i];
if(maxn < a[i]) maxn = a[i];
}
ave = s / n;
double t1, t2;
t1 = ave - minn;
t2 = maxn - ave;
if(t1 > t2)
cout << minn <<endl;
else if(t1 < t2)
cout << maxn <<endl;
else
cout << minn <<","<< maxn <<endl;
return 0;
} |
21 | 10288 | int main()
{
int n,i,j,m;
cin>>n;
float s,b[350],p,a[350],c[350];
s=0;
for(i=0;i<n;i++)
{
cin>>a[i];
s=s+a[i];
}
s=s/n;
for(i=0;i<n;i++)
{
b[i]=a[i]-s;
b[i]=abs(b[i]);
}
p=b[0];
for(i=0;i<n;i++)
{
if(p<b[i])
p=b[i];
}
j=0;
for(i=0;i<n;i++)
{
if(p==b[i])
{
c[j]=a[i];
j=j+1;
}
}
for(i=0;i<j;i++)
for(m=0;m<j-i-1;m++)
{
if(c[m]>c[m+1])
{
p=c[m];
c[m]=c[m+1];
c[m+1]=p;
}
}
cout<<c[0];
for(i=1;i<j;i++)
cout<<","<<c[i];
return 0;
} |
21 | 10289 | 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 | 10290 | int main()
{int i,j,k,temp=0,n,x[301],y[301];
float ave=0,max=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{scanf("%d",&x[i]);
ave=x[i]+ave;}
ave=ave/n;
for (i=0;i<n;i++)
if(fabs(ave-x[i])>max)
max=fabs(ave-x[i]);
for (i=0,j=0;i<n;i++)
if (fabs(ave-x[i])>max-0.01)
{y[j]=x[i];j++;}
k=j-1;
for (i=1;i<=n;i++)
for(j=0;j<k;j++)
{if(y[j]>y[j+1])
{temp=y[j];
y[j]=y[j+1];
y[j+1]=temp;
}}
printf("%d",y[0]);
for (i=1;i<=k;i++)
printf(",%d",y[i]);
return 0;
}
|
21 | 10291 | int main()
{
int n;
float m,max=0,min=1000000,sum=0,ave;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>m;
sum+=m;
if(max<m)
max=m;
if(min>m)
min=m;
}
ave=sum/n;
if(2*ave<max+min)
cout<<max<<endl;
else if(2*ave>max+min)
cout<<min<<endl;
else
cout<<min<<","<<max<<endl;
return 0;
} |
21 | 10292 | int main()
{ void pai(double a[],int n,double c[]);
double a[100]={0},sum=0,ave=0,b[100]={0};
int i=0,n=0,c[100]={0},k=1;
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%lf",&a[i]);
sum=sum+a[i];
}
ave=sum/n;
for(i=0;i<n;i++)
{ b[i]=fabs(a[i]-ave);
}
pai(b,n,a);
for(i=0;i<n;i++)
{ if(b[i]==b[i+1])
k=k+1;
else break;
}
pai(a,k,b);
for(i=k-1;i>=0;i--)
{ printf("%d",(int)a[i]);
if(i>0)
printf(",");
}
return(0);
}
void pai(double a[],int n,double c[])
{ double t=0;
int i=0,t1=0,j=0;
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;
t=c[j];
c[j]=c[j+1];
c[j+1]=t;
}
}
}
} |
21 | 10293 | void main()
{
int n,i,a[300],sum=0,k[300],m=0,j;
double ave,c[300],d;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){sum=sum+a[i];}
ave=1.0*sum/n;
for(i=0;i<n;i++){
if(a[i]*1.0-ave>=0){c[i]=a[i]*1.0-ave;}
else{c[i]=ave-a[i]*1.0;}
}
d=c[0];
for(i=1;i<n;i++){
if(d<c[i]){d=c[i];}
}
for(i=0;i<n;i++){
if(c[i] == d){
k[m] = a[i];
m++;
}
/* if(a[i]*1.0-ave>=0){
if(d==a[i]*1.0-ave)
{
k[m]=a[i];m=m+1;
}
}
else {
if(d==ave-a[i]*1.0)
{
k[m]=a[i];m=m+1;
}
}*/
}
if(m==1){printf("%d",k[0]);}
else if(m>1){
for(j=0;j<m-1;j++){printf("%d,",k[j]);}
printf("%d",k[m-1]);
}
}
|
21 | 10294 |
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 | 10295 | void main()
{
int n,i,a[305],count=0,max,min;
double ave=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if(i==1)
{
max=a[1];
min=a[1];
}
if(max<a[i])
{
max=a[i];
}
if(min>a[i])
{
min=a[i];
}
ave+=a[i];
}
ave/=n;
if(ave-min>max-ave)
{
printf("%d",min);
}
else if(ave-min<max-ave)
{
printf("%d",max);
}
else
{
printf("%d,%d",min,max);
}
} |
21 | 10296 | 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 | 10297 |
int main()
{
int a[300],n,s=0,i,j;
double x,t=0;
scanf("%d",&n);
for(i=0; i<n; i++)
{
scanf("%d",&a[i]);
s+=a[i];
}
x=(double)s/n;
for(i=0; i<n; i++)
{
for(j=n-1; j>i; j--)
{
if(a[j]<a[j-1])
{
int tem=a[j];
a[j]=a[j-1];
a[j-1]=tem;
}
}
}
if((a[n-1]-x)==(x-a[0]))
printf("%d,%d",a[0],a[n-1]);
else if((a[n-1]-x)<(x-a[0]))
printf("%d",a[0]);
else if((a[n-1]-x)>(x-a[0]))
printf("%d",a[n-1]);
else
printf("ghjk");
return 0;
}
|
21 | 10298 | // ??????.cpp : Defines the entry point for the console application.
//
int main()
{
int n,a[1000],i,sa=0,m=0,j,s[1000];
double max=0,cha[1000],t,sum;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sa+=a[i];
}
sum=(double)sa/(double)n;
for(i=0;i<n;i++)
{
cha[i]=fabs((double)a[i]-sum);
if(fabs((double)a[i]-sum)>=max)
max=fabs((double)a[i]-sum);
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
s[m]=a[i];
m++;
}
}
for(i=0;i<m-1;i++)
for(j=0;j<m-1-i;j++)
{
if(s[j]>s[j+1])
{
t=s[j];s[j]=s[j+1];s[j+1]=t;
}
}
cout<<s[0];
for(i=1;i<m;i++)
cout<<","<<s[i];
return 0;
}
|
21 | 10299 | int main()
{
float a[300];
int i,n;
float max,min;
float aver;
float sum=0;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
max=a[0];
for(i=0;i<n;i++)
{
if(a[i]>max)
max=a[i];
}
min=a[0];
for(i=0;i<n;i++)
{
if(a[i]<min)
min=a[i];
}
for(i=0;i<n;i++)
sum=sum+a[i];
aver=sum/n;
if((max+min)/2==aver)
cout<<min<<","<<max;
if((max-aver)>(aver-min))
cout<<max;
if((max-aver)<(aver-min))
cout<<min;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.