id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
10,200 | int main ()
{
int n, i, j, flag[300],t, m;
float ave, sum = 0.0, max = 0.0, c[300];
int a[300];
cin >> n;
for (i=0; i<n;i++)
{
cin >> a[i];
sum = sum +a[i];
}
ave = sum / n;
for ( i = 0;i < n; i++)
{
c[i] = fabs(a[i] - ave);
if ((c[i] - max) > 1e-6)
{
max = c[i];
flag[0] = i;
}
}
j = 0;
for ( i = 0; i< n; i++)
{
if (fabs(c[i] - max) < 1e-6)
{
flag[j] = i;
j++;
}
}
for ( i = 0; i< j-1;i++)
for ( m = 0; m < j-1-i;m++)
if ( flag[m] >flag[m+1])
{
t = flag[m];
flag[m] = flag[m+1];
flag[m+1] = t;
}
for ( i = 0;i< j - 1;i++)
cout << a[flag[i]] << ",";
cout << a[flag[j-1]] << endl;
return 0;
} | 21 |
10,201 | int main()
{
int n,i,j,m,t;
int a[350];
int avg=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
avg+=a[i];
a[i]*=n;
}
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
if(avg-a[0]>a[n-1]-avg)
m=avg-a[0];
else
m=a[n-1]-avg;
for(i=t=0;i<n;i++)
if(avg-a[i]==m || a[i]-avg==m)
{
if(t)
printf(",");
printf("%d",a[i]/n);
t=1;
}
printf("\n");
return 0;
}
| 21 |
10,202 | 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 |
10,203 | int main()
{
double s[310],av=0,n=0,max=0,sum=0,p[310],temp=0;//s???????????av?????p???????????????max???????? n??????
int i=0,j=0,ge=1;
cin>>n;
for(i=1;i<=n;i++)//??
{
cin>>s[i];
}
for(i=1;i<=n;i++)
{
sum+=s[i];
}
av=sum/n;
for(i=1;i<=n;i++)
{
if((s[i]>av)&&(s[i]-av>max))
{max=s[i]-av;continue;}
if((av>s[i])&&(av-s[i]>max))
{max=av-s[i];continue;}
}
ge=1;
for(i=1;i<=n;i++)
{
if(abs(abs(s[i]-av)-max)<0.00001)
{p[ge]=s[i];ge++;continue;}
}
ge--;
for(i=1;i<=ge;i++)
{
for(j=1;j<=ge-i;j++)
{
if(p[j]>p[j+1])
{
temp=p[j];
p[j]=p[j+1];
p[j+1]=temp;
}
}
}
cout<<p[1];
for(i=2;i<=ge;i++)
cout<<","<<p[i];
return 0;
} | 21 |
10,204 | int main(){
int n,i,j;
double num[300],e,c=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%lf",&num[i]);
c+=num[i];
}
for(i=1;i<=n;i++){
for(j=0;j<n-i;j++){
if(num[j]>num[j+1]){
e=num[j];
num[j]=num[j+1];
num[j+1]=e;
}
}
}
if((c/n-num[0])==(num[n-1]-c/n))
printf("%.0lf,%.0lf\n",num[0],num[n-1]);
else if((c/n-num[0])>(num[n-1]-c/n))
printf("%.0lf\n",num[0]);
else if((c/n-num[0])<(num[n-1]-c/n))
printf("%.0lf\n",num[n-1]);
return 0;
}
| 21 |
10,205 | 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 |
10,206 |
int main ()
{
int n;
int a[310]={0};
cin>>n;
int sum = 0;
for (int i=0;i<n;i++){
cin>>a[i];
sum += a[i];
}
double average = (double)sum/(double)n;
for (int i=0;i<n-1;i++)
for (int j=0;j<n-1-i;j++)
if (a[j]>a[j+1]){
int t;
t = a[j]; a[j] = a[j+1]; a[j+1] = t;
}
int maxp[310]={0},num = 0;
double dmax = 0;
for (int i=0;i<n;i++){
double d = fabs((double)a[i]-average);
if (d > dmax)
dmax = d;
}
for (int i=0;i<n;i++){
double d = fabs((double)a[i]-average);
if (fabs(d-dmax)<1e-8)
maxp[num++] = i;
}
for (int i=0;i<num-1;i++)
cout<<a[maxp[i]]<<",";
cout<<a[maxp[num-1]];
return 0;
} | 21 |
10,207 |
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 |
10,208 | int main()
{
int n,i,j,a[300],temp,count1=0,count2=0;
double aver=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
aver+=a[i];
}
aver=aver/n;
for(i=n-1;i>0;i--)
for(j=0;j<i;j++)
{
if(a[j]>a[j+1])
{
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}
}
for(i=0;i<n;i++)
{
if(a[i]==a[0])
{
count1++;
}
if(a[i]==a[n-1])
{
count2++;
}
}
if((aver-a[0])>(a[n-1]-aver))
{
for(i=0;i<count1-1;i++)
{
printf("%d,",a[i]);
}
printf("%d",a[count1-1]);
}
if((aver-a[0])<(a[n-1]-aver))
{
for(i=n-count2;i<n-1;i++)
{
printf("%d,",a[i]);
}
printf("%d",a[n-1]);
}
if((aver-a[0])==(a[n-1]-aver))
{
for(i=0;i<count1;i++)
{
printf("%d,",a[i]);
}
for(i=n-count2;i<n-1;i++)
{
printf("%d,",a[i]);
}
printf("%d",a[n-1]);
}
return 0;
} | 21 |
10,209 | 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 |
10,210 | /*
* 1.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main()
{
int n, i, max, min;
double sum, k;
int a[305];
cin>>n;
cin>>a[0];
max=min=a[0];
sum=a[0];
for(i=1; i<n; i++)
{
cin>>a[i];
sum=sum+a[i];
if(a[i]>max) max=a[i];
if(a[i]<min) min=a[i];
}
k=(double)sum/n;
if((max-k)>(k-min)) cout<<max;
else if((max-k)<(k-min)) cout<<min;
else cout<<min<<","<<max;
return 0;
}
| 21 |
10,211 | void main()
{
int a,b[300]={0},c,d,e,f=0,h,i;
float g;
scanf("%d",&a);
for(c=0;c<a;c++)
scanf("%d",&b[c]);
for(c=0;c<a;c++)
{
for(d=0;d<a-c;d++)
{
if(b[d]>b[d+1])
{
e=b[d];
b[d]=b[d+1];
b[d+1]=e;
}
}
}
for(i=0;i<=a;i++)
f=f+b[i];
g=(float)f/a;
if(fabs(b[1]-g)==fabs(b[a]-g))
printf("%d,%d",b[1],b[a]);
else if(fabs(b[1]-g)>fabs(b[a]-g))
printf("%d",b[1]);
else
printf("%d",b[a]);
} | 21 |
10,212 | struct cha
{
int a;
float c;
}d[300];
int main()
{
int n,i,j,o=0,h;
float k,s=0,z=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&d[i].a);
}
for(i=0;i<n;i++)
{
z=z+d[i].a;
}
s=z/n;
for(i=0;i<n;i++)
{
d[i].c=s-d[i].a;
if(d[i].c<0)
{
d[i].c=(-1)*d[i].c;
}
}
for(i=0;i<n;i++)
{
for(j=1;j<n-i;j++)
{
if(d[i].c<d[i+j].c)
{
k=d[i].c;
d[i].c=d[i+j].c;
d[i+j].c=k;
h=d[i].a;
d[i].a=d[i+j].a;
d[i+j].a=h;
}
}
}
for(i=1;i<n;i++)
{
if(d[0].c==d[i].c)
{
o++;
}
}
for(i=0;i<o;i++)
{
for(j=1;j<n-i;j++)
{
if(d[i].a>=d[i+j].a)
{
k=d[i].c;
d[i].c=d[i+j].c;
d[i+j].c=k;
h=d[i].a;
d[i].a=d[i+j].a;
d[i+j].a=h;
}
}
}
for(i=0;i<o;i++)
{
printf("%d,",d[i].a);
}
printf("%d\n",d[i].a);
return 0;
} | 21 |
10,213 | 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 |
10,214 |
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 |
10,215 |
int main()
{
double a[305], b = 0;
int i, n, j, c;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
b += a[i];
}
b = b / n;
for (i = 0; i < n - 1; i++)
for (j = 0; j < n - i - 1; j++)
if (a[j] > a[j + 1])
{
c = a[j];
a[j] = a[j + 1];
a[j + 1] = c;
}
if (b - a[0] > a[n - 1] - b)
cout << a[0] << endl;
else if (b - a[0] < a[n - 1] - b)
cout << a[n - 1] << endl;
else
cout << a[0] << ","<< a[n - 1] << endl;
return 0;
} | 21 |
10,216 | /*
* integratedexercise1.4.cpp
*
* Created on: 2013-12-13
* Author: st
*/
int main()
{
int n;
cin>>n;
int a[301];
int i;
for(i=0;i<n;i++)
cin>>a[i];
double sum=0,ave,distance=0;
for(i=0;i<n;i++)
sum+=a[i];
ave=sum/n;
int count=0;
for(i=0;i<n;i++)
if(fabs(ave-a[i])>distance)
distance=fabs(ave-a[i]);
for(i=0;i<n;i++){
if((distance-fabs(ave-a[i])<1e-10)){
count++;
if(count==1)
cout<<a[i];
else cout<<","<<a[i];}
}
}
| 21 |
10,217 | 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 |
10,218 | 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 |
10,219 | int main()
{
float b[301],sum=0,aver;int a[301],k=0,i,n,c[2]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=sum/n;
for(i=0;i<n;i++)
b[i]=fabs(a[i]-aver);
sum=0;
for(i=0;i<n;i++)
{
if(b[i]>sum)sum=b[i];
}
for(i=0;i<n;i++)
{if(b[i]==sum)c[k]=i,k++;}
if(c[1]==0)printf("%d",a[c[0]]);
else printf("%d,%d",a[c[0]],a[c[1]]);scanf("%d",&n);
}
| 21 |
10,220 | /*
* 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 |
10,221 |
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 |
10,222 | int main()
{
int n,a[300],i,max=0,min=0;
float ave=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
cin.get();
ave=ave+a[i];
}
ave=ave/n;
max=a[0];
min=a[0];
for(i=0;i<n;i++)
{
if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
if((max-ave)>(ave-min))
cout<<max;
if((max-ave)<(ave-min))
cout<<min;
if((max-ave)==ave-min)
cout<<min<<","<<max;
return 0;
}
| 21 |
10,223 | 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 |
10,224 | 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 |
10,225 | void main()
{
int a[300]={0};
int c,n,max,min,sum;
scanf("%d",&n);
scanf("%d",&a[0]);
max=a[0];
min=a[0];
sum=a[0];
if(n>1)
{
for(c=1;c<n;c++)
scanf("%d",&a[c]);
for(c=1;c<n;c++)
{
sum=sum+a[c];
if(max<a[c])
max=a[c];
if(min>a[c])
min=a[c];
}
if(max*n-sum>sum-min*n)
printf("%d\n",max);
else
{
if(max*n-sum<sum-min*n)
printf("%d\n",min);
else
printf("%d,%d\n",min,max);
}
}
else
NULL;
} | 21 |
10,226 | void main()
{
float a[300],b[2],aver,max,e=0.001;
int i,j=0,n;
scanf("%d",&n);
scanf("%f",&a[0]);
aver=a[0];
for(i=1;i<n;i++)
{
scanf(" %f",&a[i]);
aver=aver+a[i];
}
aver=aver/n;
max=fabs(aver-a[0]);
for(i=1;i<n;i++)
{
if(fabs(aver-a[i])>max)
max=fabs(aver-a[i]);
}
for(i=0;i<n;i++)
{
if(fabs(a[i]-aver)>max-e&&fabs(a[i]-aver)<max+e)
{b[j]=a[i];j++;}
}
if(j==1)
printf("%.0f",b[0]);
else
{
if(b[0]<b[1])
printf("%.0f,%.0f",b[0],b[1]);
else
printf("%.0f,%.0f",b[1],b[0]);
}
} | 21 |
10,227 | 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 |
10,228 | 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 |
10,229 | struct prin
{
double b;
int a,flag;
};
int main()
{
double n,ar=0;
struct prin p[10000];
int i,j;
double k;
scanf("%lf",&n);
for(i=0;i<n;i++)
{
scanf("%d",&p[i].a);
}
for(i=0;i<n;i++)
{
ar=ar+p[i].a/n;
}
for(i=0;i<n;i++)
{
p[i].b=(double)fabs(p[i].a-ar);
p[i].flag=0;
}
k=p[0].b;
for(i=0;i<n;i++)
{
if(p[i].b>k)
k=p[i].b;
}
for(i=0;i<n;i++)
{
if(p[i].b==k)
{
p[i].flag=1;
}
}
for(i=0;i<n;i++)
{
if(p[i].flag==1){
printf("%d",p[i].a);
break;
}
}
for(j=i+1;j<n;j++)
{
if(p[j].flag==1)
printf(",%d",p[j].a);
}
return 0;
}
| 21 |
10,230 | 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 |
10,231 | int main()
{
double shu[300];
double ping;
int n;
cin>>n;
for (int i=0;i<n;i++)
cin>>shu[i];
double sum=0;
for (int i=0;i<n;i++)
sum=sum+shu[i];
ping=sum/n;
double temp;
for (int i=0;i<n-1;i++)
{
for (int j=i+1;j<n;j++)
{
if (shu[i]>shu[j])
{
temp=shu[i];
shu[i]=shu[j];
shu[j]=temp;
}
}
}
double cha[300];
for (int i=0;i<n;i++)
cha[i]=abs(ping-shu[i]);
double max=0;
for (int i=0;i<n;i++)
{
if (max<=cha[i]) max=cha[i];
}
int count=0;
int flag;
for (int i=0;i<n;i++)
{
if (max==cha[i]) {count++;flag=i;}
}
if (count==1) cout<<shu[flag];
else
{
for (int i=0;i<n;i++)
{
if (max==cha[i]) {cout<<shu[i];flag=i;break;}
}
for (int i=flag+1;i<n;i++)
{
if (max==cha[i]) cout<<','<<shu[i];
}
}
return 0;
} | 21 |
10,232 | int main()
{
int n,array[1000];
float sum=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&array[i]);
}
for(int i=0;i<n;i++)
{
sum+=array[i];
}
sum=sum/n;
sort(array,array+n);
if(sum-array[0]*1.0>array[n-1]*1.0-sum){printf("%d",array[0]);}
if(sum-array[0]*1.0==array[n-1]*1.0-sum){printf("%d,%d",array[0],array[n-1]);}
if(sum-array[0]*1.0<array[n-1]*1.0-sum){printf("%d",array[n-1]);}
return 0;
} | 21 |
10,233 | 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 |
10,234 | int main()
{
int n,min=1000, max=0;
float average=0.0, sum=0;
cin>>n;
int array[N];
for(int i=0; i<n; i++)
{
cin>>array[i];
sum+=array[i];
if(array[i]>max) max=array[i];
if(array[i]<min) min=array[i];
}
average=sum/n;
float cha=0;
if(fabs(max-average)>fabs(min-average))
cout<<max<<endl;
else if(fabs(max-average)<fabs(min-average))
cout<<min<<endl;
else
cout<<min<<","<<max<<endl;
return 0;
} | 21 |
10,235 | void main()
{
int i,n,num[300],sum=0,real=0;
double aver,cha=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
sum=sum+num[i];
}
aver=(double)sum/n;
for(i=0;i<n;i++)
cha=(fabs(num[i]-aver)>cha)?fabs(num[i]-aver):cha;
for(i=0;i<n;i++)
{
if((fabs(fabs(num[i]-aver)-cha)<=0.00001)&&(real==0))
{printf("%d",num[i]);
real=1;}
else if(fabs(fabs(num[i]-aver)-cha)<=0.00001)
printf(",%d",num[i]);
}
} | 21 |
10,236 |
int main()
{
int n , i , c=0 , t=0 ;
double num[300] , averg=0 , maxd=0 ;
cin>>n;
for( i=0 ; i<n ; i++ )
{
cin>>num[i];
averg+=num[i];
}
averg/=n;
// cout<<averg;
for( i=0 ; i<n ; i++ )
if( fabs( num[i]-averg ) > maxd ) maxd=fabs( num[i]-averg );
// cout<<maxd;
for( i=0 ; i<n ; i++ )
if( fabs ( fabs( num[i]-averg )-maxd )< 0.000001 ) c++ ;
for( i=0 ; i<n ; i++ )
if( averg-num[i]>0 && fabs ( (averg-num[i]) - maxd ) <0.000001 )
if( t<c-1 ) { cout<<num[i]<<","; t++ ; }
else cout<<num[i];
for( i=0 ; i<n ; i++ )
if( num[i]-averg>0 && fabs( (num[i]-averg) - maxd ) <0.000001 )
if( t<c-1 ) { cout<<num[i]<<","; t++ ; }
else cout<<num[i];
} | 21 |
10,237 | 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 |
10,238 |
void main()
{
int n;
int i,j;
int *num;
int tem;
float mean,sum;
scanf("%d",&n);
num=(int*) malloc(sizeof(int)*n);
for(i=0;i<n;i++)
scanf("%d",&num[i]);
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(num[j]>num[j+1])
{
tem=num[j];
num[j]=num[j+1];
num[j+1]=tem;
}
}
}
sum=0;
for(i=0;i<n;i++)
sum+=num[i];
mean=sum/n;
if(fabs(mean-num[0])-fabs(mean-num[n-1])>0)
printf("%d",num[0]);
else if(fabs(mean-num[0])-fabs(mean-num[n-1])<0)
printf("%d",num[n-1]);
else printf("%d,%d",num[0],num[n-1]);
} | 21 |
10,239 | 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 |
10,240 | int main()
{
int n;
scanf("%d",&n);
int i,j,k,s,y,x,z,w;
unsigned int *p=0;
p=(unsigned int*)malloc(sizeof(unsigned int)*n);
double total=0;
double *deviation;
deviation=(double*)malloc(sizeof(double)*n);
double mean;
for(i=0;i<n;i++)
{
scanf("%d",&p[i]);
total=total+p[i];
}
mean=total/n;
for(j=0;j<n;j++)
{
deviation[j]=fabs(p[j]-mean);
}
double b=deviation[0];
int num=0;
for(k=0;k<n;k++)
{
if(b<deviation[k+1])
b=deviation[k+1];
}
unsigned int *fit;
fit=(unsigned int*)malloc(sizeof(unsigned int)*n);
*fit=0;
for(s=0;s<n;s++)
{
if(deviation[s]==b)
{
fit[s]=p[s];
num=num+1;
}
else fit[s]=0;
}
if(num==1)
{
for(x=0;x<n;x++)
{
if(deviation[x]==b)
{
fit[x]=p[x];
printf("%u",fit[x]);
}
}
}
else
{
unsigned int tmp;
for(y=0;y<n;y++)
{
for(z=0;z<n-y;z++)
{
if(fit[z]>fit[z+1])
{
tmp=fit[z];
fit[z]=fit[z+1];
fit[z+1]=tmp;
}
}
}
if(num==2)
printf("%u,%u",fit[n-2],fit[n-1]);
else
{
printf("%u",fit[n-num]);
for(w=n-num+1;w<n,fit[w]!=0;w++)
{
printf(",%u",fit[w]);
}
}
}
printf("\n");
return 0;
}
| 21 |
10,241 | int main()
{
int n,k[50],i,l=0,s=0;
float m=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d,",&k[i]);
for(i=0;i<n;i++)
m=m+k[i];
m=m/n;
for(i=0;i<n;i++)
{
if(k[i]>l)
l=k[i];
}
s=l;
for(i=0;i<n;i++)
{
if(k[i]<s)
s=k[i];
}
if((l-m)>(m-s))
printf("%d",l);
else if((l-m)<(m-s))
printf("%d",s);
else
printf("%d,%d",s,l);
return 0;
} | 21 |
10,242 |
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 |
10,243 | void main()
{
int n,a[300],i,m,j;
double aver,b[300],max=0,former;
scanf("%d",&n);
aver=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
aver=aver+a[i];
}
aver=aver/n;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1;j++)
if(a[j]>a[j+1])
{
m=a[j];
a[j]=a[j+1];
a[j+1]=m;
}
}
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-aver);
}
for(i=0;i<n;i++)
{
if(b[i]>max)
max=b[i];
}
j=0;
for(i=0;i<n;i++)
{
if(b[i]==max)
{
j++;
if(j==1)
{
printf("%d",a[i]);
former=a[i];
}
else
{
if(a[i]!=former)
{
printf(",%d",a[i]);
former=a[i];
}
}
}
}
printf("\n");
} | 21 |
10,244 |
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 |
10,245 | 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 |
10,246 | void main()
{
double num[300]={0},a[300]={0};
int i;
int c=0;
double max=0;
double t,ping=0;
scanf("%lf",&t);
for(i=0;i<t;i++)
scanf("%lf",&num[i]);
for(i=0;i<t;i++)
ping=ping+num[i];
ping=ping/t;
for(i=0;i<t;i++)
a[i]=fabs(num[i]-ping);
for(i=0;i<t;i++)
if(max<a[i])
max=a[i];
for(i=0;i<t;i++)
{
if(a[i]==max)
{
c++;
if(c==1)
printf("%.0f",num[i]);
else
printf(",%.0f",num[i]);
}
}
} | 21 |
10,247 | void main()
{int n,i,j;
float a[300],b[300],averge,sum=0,max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%f",&a[i]);
sum=sum+a[i];}
averge=sum/n;
for(i=0;i<n;i++)
{if(fabs(a[i]-averge)>max)
{max=fabs(a[i]-averge);
j=1;
b[j]=a[i];
continue;}
if(fabs(a[i]-averge)==max)
{j++;
b[j]=a[i];}
}
if(j==1) printf("%.0f",b[1]);
else {for(i=1;i<j;i++) printf("%.0f,",b[i]);
printf("%.0f",b[j]);}
}
| 21 |
10,248 |
int main()
{
int n, i ,j=0,num[300];
double ping=0,cha[300];
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%d",&num[i]);
ping +=(double) num[i]/n;
}
for(i=0;i<n;i++){
cha[i]=num[i]-ping;
}
for (i=n-1;i>0;i--){
for (j=0;j<i;j++){
if (cha[j]>cha[j+1]){
double tmp;
tmp=cha[j+1];
cha[j+1]=cha[j];
cha[j]=tmp;
}
}
}
if(cha[0]+cha[n-1]>0){
printf("%.0lf",cha[n-1]+ping);
}
else if(cha[0]+cha[n-1]==0){
printf("%.0lf,%.0lf",ping+cha[0],ping+cha[n-1]);
}
else{
printf("%.0lf",ping+cha[0]);
}
return 0;
}
| 21 |
10,249 | 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 |
10,250 | int main()
{
int n,i,l=0,k,m,f[300];
float s=0,a[301]={0},c,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
s=s+a[i];
}
s=s/n;
c=0;b=0;
for(i=0;i<n;i++)
{
c=fabs((float)a[i]-s);
if(c>b)
b=c;
}
for(i=0;i<n;i++)
{
c=fabs((float)a[i]-s);
if((b-c)<1e-6)
{
f[l]=a[i];l++;
}
}
n=l;
for(i=0;i<n;i++)
{
for(k=0;k<n-1;k++)
{
if(f[k]>f[k+1])
{
m=f[k];f[k]=f[k+1];f[k+1]=m;
}
}
}
printf("%d",f[0]);
for(i=1;i<n;i++)
printf(",%d",f[i]);
return 0;
}
| 21 |
10,251 | int main()
{
int n,i;
float a[300],s=0,max=0,l;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];s+=a[i];
}
s/=n;
for(i=0;i<n;i++)
{
if(fabs(a[i]-s)>=max)
{
max=fabs(a[i]-s);
l=a[i];
}
}
for(i=0;i<n;i++)
{
if(fabs(a[i]-s)==max&&l!=a[i])
cout<<a[i]<<",";
if(fabs(a[i]-s)==max&&l==a[i])
cout<<a[i];
}
return 0;
} | 21 |
10,252 | 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 |
10,253 | 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 |
10,254 | 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 |
10,255 | 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 |
10,256 | float juedui(float x)
{
if(x>=0)
{
return x;
}
else
{
return (-1*x);
}
}
int main()
{
int x[100];
int n;
int i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&x[i-1]);
}
float aver=0;
for(i=1;i<=n;i++)
{
aver+=x[i-1];
}
aver/=n;
float max=x[0]-aver;
for(i=1;i<=n;i++)
{
if(max<juedui(x[i-1]-aver))
{
max=juedui(x[i-1]-aver);
}
else
{}
}
int count=0;
for(i=1;i<=n;i++)
{
if(juedui(x[i-1]-aver)==max)
{
if(count==0)
{
printf("%d",x[i-1]);
}
else
{
printf(",%d",x[i-1]);
}
count++;
}
else
{}
}
return 0;
} | 21 |
10,257 | 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 |
10,258 | int main ()
{
int a[301], i, j, num = 1, res[301], temp;
double n, ave, c[301], sum = 0.0, max = 0;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a[i];
sum += a[i];
}
ave = sum / n;
for (i = 1; i <= n; i++)
{
c[i] = fabs (a[i] - ave);
if (c[i] > max)
max = c[i];
}
for (i = 1; i <= n; i++)
{
if (c[i] == max)
{
res[num] = a[i];
num++;
}
}
num--;
for (j = 1; j <= num - 1; j++)
{
for (i = 1; i <= num - j; i++)
{
if (res[i] > res[i+1])
{
temp = res[i];
res[i] = res[i+1];
res[i+1] = temp;
}
}
}
for (i = 1; i < num; i++)
{
cout << res[i] << ',';
}
cout << res[num];
return 0;
} | 21 |
10,259 | 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 |
10,260 | 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 |
10,261 | 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 |
10,262 | int num[310];
int main()
{
int n,sum=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>num[i];
sum=sum+num[i];
}
double ave=sum/(n*1.0);
double away[310];
int use;
for(int i=1;i<=n;i++)
away[i]=abs(num[i]*1.0-ave);
double use2;
for(int i=1;i<=n-1;i++)
for(int j=1;j<=n-i;j++)
if(away[j]<away[j+1])
{ use2=away[j];away[j]=away[j+1];away[j+1]=use2;
use=num[j];num[j]=num[j+1];num[j+1]=use;
}
int m;
for(int i=1;i<=n;i++)
if(away[i+1]!=away[i])
{m=i;break;}
for(int i=1;i<=m-1;i++)
for(int j=1;j<=m-i;j++)
if(num[j]>num[j+1])
{ use=num[j];num[j]=num[j+1];num[j+1]=use; }
for(int i=1;i<=m-1;i++)
cout<<num[i]<<",";
cout<<num[m];
return 0;
}
| 21 |
10,263 | int main()
{
double n,a[300],b[300]={0},c[300]={0},sum=0,ave=0,max=0,temp=0;int i,j,num=0;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
sum=sum+a[i];
ave=sum/n;
for(i=0;i<n;i++)
b[i]=fabs(a[i]-ave);
for(i=0;i<n;i++)
if(b[i]>max)
max=b[i];
//cout<<max<<endl;
for(i=0;i<n;i++)
if(b[i]==max)
c[num++]=a[i];
if(num==1)
cout<<c[0];
else{
for(i=0;i<num-1;i++)
for(j=0;j<num-i;j++)
if(c[j]>c[j+1])
{ temp=c[j+1];c[j+1]=c[j];c[j]=temp;}
for(i=0;i<num-1;i++)
cout<<c[i]<<",";
cout<<c[num];
}
} | 21 |
10,264 | void main()
{
int n,a[300],sum=0;
int i,j,k,t,x,temp,emo,b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(j=0;j<n;j++)
{
b[j]=n*a[j]-sum;
}
for(k=0;k<n;k++)
for(t=0;t<n-k-1;t++)
{
if(abs(b[t])<abs(b[t+1]))
{
emo=b[t];
b[t]=b[t+1];
b[t+1]=emo;
temp=a[t];
a[t]=a[t+1];
a[t+1]=temp;
}
}
printf("%d",a[0]);
for(x=1;x<n;x++)
{
if(abs(b[x])==abs(b[0])) printf(",%d",a[x]);
}
}
| 21 |
10,265 | void main()
{
int n,i,j,t,sum=0;
float aver,k1,k2;
int a[300];
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
printf("\n");
for (j=0;j<n-1;j++)
for (i=0;i<n-1-j;i++)
if (a[i]>a[i+1])
{t=a[i];a[i]=a[i+1];a[i+1]=t;}
for(i=0;i<n;i++)
sum=sum+a[i];
aver=(float)sum/(float)n;
k1=aver-a[0];
k2=a[n-1]-aver;
if (k1<k2)
{printf("%d",a[n-1]);}
if (k1>k2)
{printf("%d",a[0]);}
if (k1==k2)
{printf("%d,%d",a[0],a[n-1]);}
} | 21 |
10,266 | /*
* 1.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main()
{
int n,i,num[300],t=0,k=0;
double average,sum=0;
cin>>n;
for(i=0;i<n;i++){
cin>>num[i];
sum=sum+num[i];
}
average=sum/n;
for(i=0;i<n;i++)
if((average-num[i])>(average-num[t])) t=i;
for(i=0;i<n;i++)
if((num[i]-average)>(num[k]-average)) k=i;
if((num[k]-average)==(average-num[t])) cout<<num[t]<<','<<num[k]<<endl;
else if((num[k]-average)>(average-num[t])) cout<<num[k]<<endl;
else cout<<num[t];
return 0;
}
| 21 |
10,267 |
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 |
10,268 | int main()
{
int a[300],q,K;
int n,i,sum=0,j,k;
double aver,p,b[300];
cin>>n;
for(i=0;i<n;i++)
{cin>>a[i];
sum=sum+a[i];}
aver=(double)sum/n;
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-aver);
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-j;i++)
{
if(b[i]<b[i+1])
{
p=b[i];
q=a[i];
b[i]=b[i+1];
a[i]=a[i+1];
b[i+1]=p;
a[i+1]=q;
}
}
}
for(i=1;i<n;i++)
{
if(b[i-1]>b[i])
{
K=i-1;
break;
}
}
for(k=0;k<K;k++)
{
cout<<a[k]<<',';
}
cout<<a[K]<<endl;
return 0;
}
| 21 |
10,269 | void main()
{
int n,i,max,min,p;
float av,sum=0,a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
av=sum/n;
max=min=a[0];
for(i=1;i<n;i++)
{
max=a[i]>max?a[i]:max;
min=a[i]>min?min:a[i];
}
p=max+min;
if(2*av==p)
printf("%d,%d\n",min,max);
else if(2*av>p)
printf("%d\n",min);
else if(2*av<p)
printf("%d\n",max);
} | 21 |
10,270 |
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 |
10,271 | int main()//?????????????????? = = ??????????????????blahblah????????
{
int n,i,j,t,k=0,c[300]={0},a[300];
long double sum=0,b[300],aver=0,max=0;//???????????????????????? = =
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);//??
sum=sum+a[i];//????????
}
aver=sum/n;//????
for(i=0;i<n;i++)
{
b[i]=a[i]-aver;//?????????
if(b[i]<0)b[i]=-b[i];
if(b[i]>max)max=b[i];//??????
}
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]-aver)==max||(a[i]-aver)==-max)//???????????????????????? = =
{
c[k]=a[i];//???c????????
k++;
}
}
for(i=0;i<k-1;i++)printf("%d,",c[i]);
printf("%d",c[k-1]);//?????????????????????..
return 0;
} | 21 |
10,272 | int main()
{
int n,i,a[1000],j,t;
float aver,x,y,sum=0.0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=sum/n;
for(i=2;i<=n;i++)
{
for(j=i-1;j>=1;j--)
{
if(a[j+1]<a[j])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
x=aver-a[1];
y=a[n]-aver;
if(x==y) printf("%d,%d",a[1],a[n]);
if(x>y) printf("%d",a[1]);
if(x<y) printf("%d",a[n]);
return 0;
} | 21 |
10,273 | 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 |
10,274 |
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 |
10,275 | int main()
{
const int N = 300;
int a[N];
int i, n, j;
double sum = 0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
sum = sum + a[i];
}
double ave;
ave = sum / n;
double b[N], temp1;
int temp2;
for (i = 0; i < n; i++)
b[i] = fabs(a[i] - ave);
for (i = 0; i < n - 1; i++)
for (j = 0; j < n - 1 - i; j++)
if (b[j] < b[j + 1] || fabs (b[j] - b[j + 1]) < 0.000001)
{
temp1 = b[j];
b[j] = b[j + 1];
b[j + 1] = temp1;
temp2 = a[j];
a[j] = a[j + 1];
a[j + 1] = temp2;
}
int c[N];
c[0] = a[0];
for (i = 1; i < n; i++)
{
if (fabs(b[i] - b[0]) < 0.000001)
c[i] = a[i];
else
break;
}
for (j = 0; j < i; j++)
for (int k = 0; k < i - 1; k++)
if (c[k] > c[k + 1])
{
temp2 = c[j];
c[j] = c[j + 1];
c[j + 1] = temp2;
}
cout << c[0];
for (j = 1; j < i; j++)
cout << "," << c[j];
cout << endl;
return 0;
}
| 21 |
10,276 | int main()
{
int n; cin>>n;
int a[n],c[n];
int i,j,k=0,t=0,sum=0,temp;
for (i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
double aver=(sum+0.1)/n-0.1/n; double b[n];
double max=0;
for (i=0;i<n;i++)
{
b[i]=a[i]-aver;
b[i]=(b[i]>0 ? b[i]: -b[i]);
if (b[i]>max) max=b[i];
}
for (j=0;j<n;j++)
if (b[j]==max)
{
c[k++]=a[j]; t=t+1;
}
if (t==1) cout<<c[0]<<endl;
else
{
for (k=1;k<t;k++)
for (j=0;j<t-1;j++)
if (c[j]>c[j+1])
{temp=c[j+1]; c[j+1]=c[j]; c[j]=temp;}
for (k=0;k<t-1;k++)
cout<<c[k]<<',';
cout<<c[k]<<endl;
}
return 0;
}
| 21 |
10,277 | void main()
{
int n,a[50],i=0,j,s=0,t;
float av,c1,c2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s+=a[i];
}
av=(float)s/n;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if(a[j]>a[i])
{
t=a[j];
a[j]=a[i];
a[i]=t;
}
}
c1=av-a[n-1];
c2=a[0]-av;
if(c1>c2)
printf("%d\n",a[n-1]);
else if(c2>c1)
printf("%d\n",a[0]);
else
printf("%d,%d\n",a[n-1],a[0]);
}
| 21 |
10,278 | /*
* exam.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main()
{
int n;
cin>>n;
int a[500];
int i;
for(i=0;i<n;i++)
cin>>a[i];
int sum=0;
for(i=0;i<n;i++)
sum=sum+a[i];
double average=(double)sum/n;
double b[500];
int c[500];
for(i=0;i<n;i++)
b[i]=abs(average-a[i]);
double max=0;
int k=0;
for(i=0;i<n;i++)
if(max<b[i])
{
max=b[i];
}
for(i=0;i<n;i++)
if(max==b[i])
c[k++]=a[i];
int j;
for(i=0;i<k-1;i++)
for(j=0;j<k-i-1;j++)
if(c[j]>c[j+1])
{
int temp=c[j];
c[j]=c[j+1];
c[j+1]=temp;
}
for(i=0;i<k-1;i++)
cout<<c[i]<<",";
cout<<c[i]<<endl;
return 0;
}
| 21 |
10,279 | void main()
{
int i,n,k=0,j,sum=0,max=0;
int a[300],c[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{ sum+=a[i];}
for(i=0;i<n;i++)
{if(n*a[i]-sum>=max)
max=n*a[i]-sum;
else if(sum-n*a[i]>=max)
max=sum-n*a[i];
}
for(i=0;i<n;i++)
if(n*a[i]-sum-max==0||sum-n*a[i]-max==0)
{ c[k]=a[i];k++;}
for(j=0;j<k;j++)
printf("%d%c",c[j],(j!=k-1)?',':'\n');
}
| 21 |
10,280 | /*????? */
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 |
10,281 | 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 |
10,282 | 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 |
10,283 | void main()
{
int a[300],n,i,total=0,min,max;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d,",&a[i]);
max=a[0];min=a[0];
for(i=0;i<=n-1;i++)
{
total=total+a[i];
if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
if((total-min*n)==(max*n-total))
printf("%d,%d\n",min,max);
else if((max*n-total)>(total-min*n))
printf("%d",max);
else
printf("%d",min);
}
| 21 |
10,284 | int main()
{
int n,i,count=0;
cin>>n;
int a[n];
float av=0,b[n],max=0;
for(i=0;i<n;i++){
cin>>a[i];
av=av+a[i];
}
av=av/n;
for(i=0;i<n;i++)
{
if(av>a[i])b[i]=av-a[i];
else b[i]=a[i]-av;
if(max<b[i])max=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==max)count++;
}
for(i=0;i<n;i++)
{
if(b[i]==max){
if(count==1){
cout<<a[i];
break;
}
else {
cout<<a[i]<<",";
count--;
}
}
}
return 0;
} | 21 |
10,285 | 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 |
10,286 |
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 |
10,287 | 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 |
10,288 | int main()
{
double a[350],b[20],temp,sum=0;
int i,j,k=0,n;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
for(i=0;i<n-1;i++)
for(j=i;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
if(a[0]*n+a[n-1]*n>sum*2)
{
for(i=0;i<n;i++)
{
if(a[i]==a[n-1])
{
b[k]=a[i];
k++;
}
}
}
if(a[0]*n+a[n-1]*n==sum*2)
{
for(i=0;i<n;i++)
{
if(a[i]==a[0]||a[i]==a[n-1])
{
b[k]=a[i];
k++;
}
}
}
if(a[0]*n+a[n-1]*n<sum*2)
{
for(i=0;i<n;i++)
{
if(a[i]==a[0])
{
b[k]=a[i];
k++;
}
}
}
for(i=0;i<k-1;i++)
cout<<b[i]<<",";
cout<<b[k-1];
return 0;
} | 21 |
10,289 | int main()
{
int n,i,j,a[300],t=0;
float s=0,aver,max,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
s=s+a[i];
}
aver=s/n;
for(i=0;i<n-2;i++)
{
for(j=0;j<n-i-1;j++)
{
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
max=aver-a[0];
for(i=0;i<n;i++)
{
if(a[i]<aver) temp=aver-a[i];
else temp=a[i]-aver;
if(temp>max)
max=temp;
}
for(i=0;i<n;i++)
{
if(a[i]<aver) temp=aver-a[i];
else temp=a[i]-aver;
if(temp==max)
{
t=t+1;
if(t==1)
printf("%d",a[i]);
else
printf(",%d",a[i]);
}
}
return 0;
} | 21 |
10,290 | void main()
{
int m,j,i=0,p[300],n,y=0;
float k[300],b,a=0;
scanf("%d",&n);
for(m=0;m<n;m++)
{scanf("%d",&p[m]);
a=a+p[m];}
b=a/n;
for(m=0;m<n;m++)
{if(p[m]-b>=0)
{k[m]=p[m]-b;}
else
k[m]=b-p[m];}
for(j=1;j<n;j++)
{if(k[j]>k[i])
i=j;}
for(m=0;m<n;m++)
{if(k[m]==k[i]&&p[m]<=b)
{printf("%d",p[m]);
y=1;}}
for(m=0;m<n;m++)
{if(k[m]==k[i]&&p[m]>b)
{if(y==1)
printf(",%d",p[m]);
else
printf("%d",p[m]);}
}
} | 21 |
10,291 | void main()
{
int a[310],max,min,n,i;
float sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(i==0)
{
max=a[i];min=a[i];sum=a[i];
}
else
{
sum+=a[i];
max=(a[i]>max)? a[i]:max;
min=(a[i]<min)? a[i]:min;
}
}
sum=sum/n;
if((max-sum)>(sum-min))
printf("%d",max);
else if((max-sum)<(sum-min))
printf("%d",min);
else printf("%d,%d",min,max);
}
| 21 |
10,292 | 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 |
10,293 | int bubble_sort(float a[300][2], float b[300][2], int n)
{
int i, j=0, count;
float temp1, temp2;
for (j=1; j<n; j++)
{
for(i=0; i<n-j; i++)
{
if (a[i][1]<a[i+1][1])
{
temp1=a[i][0];
temp2=a[i][1];
a[i][0]=a[i+1][0];
a[i][1]=a[i+1][1];
a[i+1][0]=temp1;
a[i+1][1]=temp2;
}
}
}
j=0;
for(i=0; i<n; i++)
{
if(a[0][1] == a[i][1])
{
b[j][0]=a[i][0];
b[j][1]=a[i][1];
j++;
}
if(a[0][1] != a[i][1])
break;
}
count=i;
for(j=1; j<count; j++)
if(b[0][1]==0)
break;
else
{
for(i=0; i<count-j; i++)
if(b[i][0]>b[i+1][0] && b[i+1][0]!=0)
{
temp1=b[i][0];
temp2=b[i][1];
b[i][0]=b[i+1][0];
b[i][1]=b[i+1][1];
b[i+1][0]=temp1;
b[i+1][1]=temp2;
}
}
return(count);
}
int main()
{
float a[300][2], sum=0;
float b[300][2]={0};
int n, i, count;
float average;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%f", &a[i][0]);
sum=sum+a[i][0];
}
average=(float)sum/n;
for(i=0; i<n; i++)
{
if(a[i][0]-average>0)
a[i][1]=a[i][0]-average;
else
a[i][1]=average-a[i][0];
}
count = bubble_sort(a, b, n);
for(i=0; i<count; i++)
{
if(i==0)
printf("%.0f", b[i][0]);
else
printf(",%.0f", b[i][0]);
}
printf("\n");
return 0;
}
| 21 |
10,294 | 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 |
10,295 | int main()
{
int a[300],i,j,k,n,t,b[300];
double aver,c,max,sum=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{scanf("%d",&a[i]);
sum=sum+a[i];}
aver=sum/n;
max=fabs(a[0]-aver);
for(i=0;i<=n-1;i++){
c=fabs(a[i]-aver);
if(c>max)
max=c;}
for(i=0,j=0;i<=n-1;i++){
c=fabs(a[i]-aver);
if((max-c)<1e-6){
b[j]=a[i];
j++;
}
}
for(k=0;k<j;k++){
for(i=0;i<j-k-1;i++){
if(b[i]>b[i+1])
{t=b[i];b[i]=b[i+1];b[i+1]=t;}
}
}
printf("%d",b[0]);
for(i=1;i<j;i++)
printf(",%d",b[i]);
return 0;
} | 21 |
10,296 | 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 |
10,297 |
int main()
{
int n , i , j , p = 0 ;
double num[ 11111 ] , s = 0 , max = 0 , t ;
cin >> n ;
for( i = 1 ; i <= n ; i ++ )
{
cin >> num[ i ] ;
s = s + num[ i ] ;
}
s = s / n ;
for( j = 1 ; j <= n ; j ++ )
for( i = j ; i <= n - j ; i ++ )
if( num[ i ] > num[ i + 1 ] )
{
t = num[ i ] ;
num[ i ] = num[ i + 1 ] ;
num[ i + 1 ] = t ;
}
for( i = 1 ; i <= n ; i ++ )
if( max <= fabs( num[ i ] - s ) )
max = fabs( num[ i ] - s ) ;
for( i = 1 ; i <= n ; i ++ )
if( max - fabs( num[ i ] - s ) < 0.0001 )
{
if( p == 0 )
{
cout << num[ i ] ;
p = 1 ;
}
else
cout << "," << num[ i ] ;
}
return 0 ;
}
| 21 |
10,298 | void main()
{
int i,j,n,sum=0,temp,a[300];
float a1,a2,average;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
average=(float)sum/(float)n;
for (i=0;i<n;i++)
for (j=0;j<n-i-1;j++)
{
if (a[i]>a[i+1])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
}
}
a1=fabs(average-(float)a[0]);
a2=fabs(average-(float)a[n-1]);
if (a1==a2)
printf("%d,%d",a[0],a[n-1]);
else
if (a1>a2)
printf("%d",a[0]);
else
printf("%d",a[n-1]);
} | 21 |
10,299 |
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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.