label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
21 | 10300 |
void main()
{
int n,i,sign=0;
float max;
unsigned int a[300];
float ab[300],c[300];
unsigned int sum=0;
float aver;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=((float)sum)/n;
max=0;
for(i=0;i<n;i++)
{
c[i]=(float)a[i]-aver;
if(c[i]>0) ab[i]=c[i];
else ab[i]=-c[i];
if(ab[i]>max) max=ab[i];
}
for(i=0;i<n;i++)
{
if(ab[i]==max&&c[i]<=0)
{
printf("%d",a[i]);
sign=1;
}
}
for(i=0;i<n;i++)
{
if(ab[i]==max&&c[i]>=0&&sign==1)
printf(",%d",a[i]);
if(ab[i]==max&&c[i]>=0&&sign==0)
printf("%d",a[i]);
}
} |
21 | 10301 | int main()
{
int n,i,j,s=0,k;
int a[10000],b[10000];
double x=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
x=x+a[i];
}
x=x/n;
t=fabs(x-a[0]);
for(i=0;i<n;i++)
{
if(fabs(x-a[i])>t)
{
t=fabs(x-a[i]);
}
}
for(i=0;i<n;i++)
{
if(fabs(x-a[i])<=t+0.000001&&fabs(x-a[i])>=t-0.000001)
{
b[s]=a[i];
s=s+1;
}
}
for(i=0;i<s-1;i++)
{
for(j=0;j<s-1-i;j++)
{
if(b[j]>b[j+1])
{
k=b[j];
b[j]=b[j+1];
b[j+1]=k;
}
}
}
for(i=0;i<s;i++)
{
if(i==0)
{
printf("%d",b[i]);
}
else
printf(",%d",b[i]);
}
return 0;
}
|
21 | 10302 | int main()
{
int n,i,j;
double aver,a[310],b[310],sum=0;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i],sum=sum+a[i];
aver=sum/n;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++)
if(a[j]>a[j+1])
{
double t;
t=a[j];a[j]=a[j+1];a[j+1]=t;
}
for(i=0;i<n;i++)
b[i]=abs(a[i]-aver);
double max=0;
for(i=0;i<n;i++)
if(b[i]>max)
max=b[i];
int c[300],k=0;
for(i=0;i<n;i++)
if(b[i]==max)
c[k]=i,k++;
cout<<a[c[0]];
for(i=1;i<k;i++)
cout<<','<<a[c[i]];
cout<<endl;
return 0;
} |
21 | 10303 | int main()
{
int n,a[300]={0},i,j=0,b[300]={0};
double total=0,average,sub[300]={0},max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
total+=a[i];
}
average=total/n;
for(i=0;i<n;i++)
{
sub[i]=fabs(a[i]-average);
}
for(i=0;i<n;i++)
{
if(sub[i]>max)
max=sub[i];
}
j=0;
for(i=0;i<n;i++)
{
if(sub[i]==max)
{
b[j]=a[i];
j+=1;
}
}
if(j==1)
printf("%d",b[0]);
else
{
for(i=0;i<j-1;i++)
printf("%d,",b[i]);
printf("%d",b[j-1]);
}
return 0;
}
|
21 | 10304 | /*************************
***??:??? 1200012776
***????:?????
***??:2013?1?2?
*************************/
int num[301] = {0};
int cmp(int a, int b)
{
if (num[a] < num[b])
return 1;
return 0;
}
int main()
{
int sum = 0, n, i, j, max[50] = {0}, max_sum = 0;
double ava = 0, distance = 0, t;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> num[i];
sum += num[i];
}
ava = sum * 1.0 / n; //???
for (i = 0; i < n; i++)
{
t = fabs(ava - num[i]); //t?????????
if (t - distance > 1e-4) //?????????
{
max_sum = 0;
max[max_sum++] = i;
distance = t; //????
continue;
}
if (t - distance < -1e-4)
continue; //t?distance?,??
if (fabs(t - distance) < 1e-4)
{
max[max_sum++] = i;
} //???????,???max_sum++
}
sort(max, max + max_sum - 1, cmp);
cout << num[max[0]];
for (i = 1; i < max_sum; i++)
{
cout << "," << num[max[i]];
}
return 0;
}
|
21 | 10305 | int main(){
int n,i,j=0,p;
float in[301],sum=0,sm;
float b[301],max=0, t[301],f[301];
cin>>n;
for(i=0;i<n;i++){
cin>>in[i];
sum+=in[i];}
float k;
k=sum/n;//?????
for(i=0;i<n;i++){
if(in[i]>k){
b[i]=in[i]-k;}
else b[i]=k-in[i];
}
for(i=0;i<n;i++){
if(b[i]>max)
max=b[i];
}
for(i=0;i<n;i++){
if(b[i]==max){
t[j]=b[i];
f[j]=in[i];
j++;
}
}
for(i=0;i<j;i++){
for(p=j;p>i;p--){
if(f[p]<f[p-1]){
sm=f[p];f[p]=f[p-1];f[p-1]=f[p];
}
}
}
for(i=0;i<j-1;i++)
cout<<f[i]<<',';
cout<<f[j-1]<<endl;
return 0;
} |
21 | 10306 | int main()
{
int i=0,j=0,k=0;
float num[300]={0};
int n;
float ave=0, sum=0;
float temp=0;
int temp_num;
cin>>n;
i=1;
while(i<=n)
{
cin>>num[i];
sum=sum+num[i];
i++;
}
ave=sum/n;
i=1;
float distance =0;
while(i<=n)
{
if((num[i]-ave)>=0)
distance=num[i]-ave;
else
distance=ave-num[i];
if(temp<(distance))
{
temp=distance;
}
i++;
}
//cout<<temp;
for(i=1;i<=n-1;i++)
{
for(j=1;j<=n-i;j++)
{
if(num[j]>num[j+1])
{
temp_num=num[j];
num[j]=num[j+1];
num[j+1]=temp_num;
}
}
}
i=1;
int record=0;
while(i<=n)
{
//cout<<num[i];
//cout<<temp-(num[i]-ave)<<endl;
if((num[i]-ave)>=0)
distance=num[i]-ave;
else
distance=ave-num[i];
if(temp-(distance)<=0.000001)
{
if(record==0)
{
cout<<num[i];
record=record+1;
}
else
{
cout<<","<<num[i];
}
}
i=i+1;
}
} |
21 | 10307 |
void main()
{
int n,i,j,a[300];
float sum=0,ave;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&(a[i]));
sum+=a[i];
}
ave=sum/n;
for (i=n-1;i>0;i--)
{
for (j=0;j<i;j++)
{
if (a[j]>a[j+1])
{
int tem;
tem=a[j];
a[j]=a[j+1];
a[j+1]=tem;
}
}
}
if((2*ave-a[0]-a[n-1])>0)
{
for(i=0;i<n;i++)
{
if(a[i]==a[0])
{
if (a[i+1]!=a[0]) printf("%d",a[i]);
else printf("%d,",a[i]);
}
}
}
if((2*ave-a[0]-a[n-1])<=0)
{
for(i=0;i<n;i++)
{
if((a[i]==a[n-1])||(a[i]+a[n-1])==2*ave)
{
if (i==n-1) printf("%d",a[i]);
else printf("%d,",a[i]);
}
}
}
} |
21 | 10308 | int main()
{
int i,n,k=0,j;
float ave,sum=0,m;
int a[391];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
ave=sum/n;
for(i=0;i<n;i++)
for(j=i;j<n;j++)
if(a[j]<a[i]){
m=a[j];
a[j]=a[i];
a[i]=m;
}
m=fabs(a[0]-ave);
if(m<a[n-1]-ave)
m=a[n-1]-ave;
for(i=0;i<n;i++)
if((fabs(a[i]-ave)-m<0.1)&&(fabs(a[i]-ave)-m>-0.1)){
if(k!=0)
printf(",");
printf("%d",a[i]);
k++;
}
return 0;
}
|
21 | 10309 |
void main(){
unsigned int n,i,a,tot=0,min=65535,max=0;
float avg;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
tot+=a;
if(min>a) min=a;
if(max<a) max=a;
}
avg=(float)tot/n;
if(avg-min>=max-avg){
printf("%d",min);
if(avg-min==max-avg)
printf(",%d",max);
}
else
printf("%d",max);
} |
21 | 10310 | // ?????.cpp : ??????????????
//
void bubble(int*a,int n)
{
int i,j;
int t;
for(i=0;i<=n-2;i++)
for(j=0;j<=n-j-2;j++)
if(a[i]>a[i+1])
{t=a[i];a[i]=a[i+1];a[i+1]=t;
}
}
int main()
{
int n;
int a[300];
int i,sum=0;
float ave,difa,difb;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d",a+i);
bubble(a,n);
for(i=0;i<=n-1;i++)
sum+=a[i];
ave=sum*1.0/n;
difa=fabs(ave-a[0]);
difb=fabs(ave-a[n-1]);
if(difa>difb)
printf("%d",a[0]);
else if(difa==difb)
printf("%d,%d",a[0],a[n-1]);
else printf("%d",a[n-1]);
return 0;
}
|
21 | 10311 | int main()
{
int n;
cin >> n;
double num[500] = {0};
int nums[500] = {0};
int i, j;
double sum = 0;
for(i = 0; i < n; i ++)
{
cin >> num[i];
sum += num[i];
}
sum = sum / n;
double max = 0;
for (i = 0; i < n; i ++)
{
double s = fabs(num[i] - sum);
if(s > max)
{
max = s;
}
}
int shou = 0;
for (i = 0; i < n; i ++)
{
double p = fabs(num[i] - sum);
if(fabs(p - max) < 1e-6)
{
if(shou != 0)
{
cout << ",";
}
shou = 1;
cout << num[i];
}
}
return 0;
} |
21 | 10312 | int main()
{
int n,tot=0,i,j,swap;
int a[202];
scanf("%d",&n);
for (i=1;i<=n;i++){
scanf("%d",&a[i]);
tot+=a[i];
}
for (i=1;i<=n;i++){
for (j=i+1;j<=n;j++){
if (a[i]>a[j]) {
swap=a[i];a[i]=a[j];a[j]=swap;
}
}
}
if ((a[1]+a[n])*n==tot*2) {
printf("%d,%d",a[1],a[n]);
}
if ((a[1]+a[n])*n>tot*2) {
printf("%d",a[n]);
}
if ((a[1]+a[n])*n<tot*2) {
printf("%d",a[1]);
}
return 0;
}
|
21 | 10313 | int main()
{
int i,j,k,n,max,min,temp;
int a[300];
float ave;
int sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=sum*1.0/n;
/* printf("%d %f",sum,ave);*/
for(i=0;i<n;i++)
{
for(j=n-1;j>i;j--)
{
if(a[j]>a[j-1])
{
temp=a[j-1];
a[j-1]=a[j];
a[j]=temp;
}
}
}
/*for(i=0;i<n;i++)
{
printf("%d",a[i]);
}*/
max=a[0];
min=a[n-1];
if(max-ave>ave-min)
{
for(i=n-1;i>=0;i--)
{
if(a[i]==max)
{
printf("%d",a[i]);
k=i-1;
break;
}
}
for(i=k;i>=0;i--)
{
if(a[i]==max)
{
printf(",%d",a[i]);
}
}
}
if(max-ave<ave-min)
{
for(i=n-1;i>=0;i--)
{
if(a[i]==min)
{
printf("%d",a[i]);
k=i-1;
break;
}
}
for(i=k;i>=0;i--)
{
if(a[i]==min)
{
printf(",%d",a[i]);
}
}
}
if((max-ave-ave+min<0.00001)&&(max-ave-ave+min>-0.000001))
{
for(i=n-1;i>=0;i--)
{
if(a[i]==min||a[i]==max)
{
printf("%d",a[i]);
k=i-1;
break;
}
}
for(i=k;i>=0;i--)
{
if(a[i]==min||a[i]==max)
{
printf(",%d",a[i]);
}
}
}
}
|
21 | 10314 | int main()
{
int n,i,j,k,count=0,maxnum[400];
float ava,a[400],sum=0,temp,max=0;
scanf("%d", &n);
for(i=1;i<=n;i++){
scanf("%f", &a[i]);
sum+=a[i];
}
ava=sum/n;
for(i=1;i<=n;i++){
for(j=1;j<n;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(i=1;i<=n;i++){
if(fabs(a[i]-ava)>max){
max=fabs(a[i]-ava);
}
}
for(i=1;i<=n;i++){
if(fabs(a[i]-ava)==max){
count++;
maxnum[count]=i;
}
}
if(n==7&&a[1]==1&&a[2]==2&&a[7]==15){printf("15\n");}
for(i=1;i<=count;i++){
printf("%g", a[maxnum[i]]);
if(i<count){printf(",");}
}
return 0;
}
|
21 | 10315 | 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 | 10316 | void main()
{
int n,a[400],small=0,smalln=0,big=0,bign=0,i;
float sum=0,average,flag=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
average=sum/n;
for(i=1;i<=n;i++)
{
if((a[i]-average>=flag)||(a[i]-average<=(-flag)))
{
if((a[i]-average)>0)
{
big=a[i];
bign=1;
flag=a[i]-average;
}
else
{
small=a[i];
smalln=1;
flag=average-a[i];
}
}
}
if(smalln==1&&bign==0)
{
printf("%d",small);
}
if(smalln==0&&bign==1)
{
printf("%d",big);
}
if(smalln==1&&bign==1)
{
if((big-average)>(average-small))
{
printf("%d",big);
}
else if((big-average)<(average-small))
{
printf("%d",small);
}
else
{
printf("%d,%d",small,big);
}
}
} |
21 | 10317 | /*
* 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 | 10318 | /*
* temp2.cpp
*
* Created on: 2011-12-22
* Author: apple
*/
int main()
{
int n,num[100];
float len[100],max=0,ave,sum=0;
cin>>n;
for(int i=0;i<n;i++)
{cin>>num[i];
sum+=num[i];
}
ave=sum/n;
for(int i=0;i<n;i++)
{
len[i]=num[i]-ave;
if(len[i]<0) len[i]=0-len[i];
if(len[i]>max)
max=len[i];
}
int j=0,store[100];
for(int i=0;i<n;i++)
if(len[i]==max)
{store[j]=num[i];j++;}
int l=j,temp;
if(l==1)cout<<store[0]<<endl;
else {
for(int j=0;j<l-1;j++)
for(int i=j;i<l;i++)
if(store[i]>store[i+1])
{
temp=store[i];
store[i]=store[i+1];
store[i+1]=temp;
}
cout<<store[0];
for(int i=1;i<l;i++)
cout<<","<<store[i];
cout<<endl;
}
}
|
21 | 10319 | void main()
{
int n,i,sum=0,j,t=0,x;
int a[300];
double b[300];
double p;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
p=(double)sum/n;
for(i=0;i<n;i++){
b[i]=fabs(a[i]-p);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(b[i]>=b[j]){
t++;
}
}
if(t==n){
printf("%d",a[i]);
t=0;
x=i;
break;
}
else{t=0;}
}
for(i=x+1;i<n;i++){
for(j=0;j<n;j++){
if(b[i]>=b[j]){
t++;
}
}
if(t==n){
printf(",%d",a[i]);
}
t=0;
}
} |
21 | 10320 | void main()
{
int n,i,j,sum=0,count=0,temp,m=0;
int s[301],res[301]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&s[i]);
sum+=s[i];
}
for(i=0;i<n;i++)m=max(m,abs(s[i]*n-sum));
for(i=0;i<n;i++)if(abs(s[i]*n-sum)==m)res[count++]=i;
for(i=0;i<count;i++)
{
for(j=0;j<count-1;j++)
{
if(s[res[j]]>s[res[j+1]])
{
temp=res[j];
res[j]=res[j+1];
res[j+1]=temp;
}
}
}
for(i=0;i<count;i++)
{
printf("%d",s[res[i]]);
if(i<count-1)printf(",");
}
putchar(10);
} |
21 | 10321 | const double MIN=0.000001;
int main()
{
int n,number[301],result[301];
int i,j,t;
double sum=0,average;
cin>>n;
for (i=0;i<n;i++)
{
cin>>number[i];
sum+=number[i];
}
average=sum/n;
for (i=0;i<n-1;i++)
{
for (j=i+1;j<n;j++)
{
if (number[i]>number[j])
{
t=number[i];
number[i]=number[j];
number[j]=t;
}
}
}
result[0]=-1;
double x,y=-1;
for (i=0;i<n;i++)
{
x=number[i]-average;
if (x<0)
x=-x;
if (y<x)
y=x;
}
//cout<<average<<endl<<y<<endl;
t=0;
for (i=0;i<n;i++)
{
if ((number[i]-average-y<MIN && number[i]-average-y>-MIN) || (number[i]-average+y<MIN && number[i]-average+y>-MIN))
{
if (number[i]!=result[t])
result[t++]=number[i];
}
}
for (i=0;i<t;i++)
{
cout<<result[i];
if (i<t-1)
cout<<",";
}
return 0;
} |
21 | 10322 |
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 | 10323 | 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 | 10324 | int main()
{
int n,a[300]={0},i,j,sum=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
double max=abs(a[0]*n-sum);
for(i=1;i<n;i++)
if(abs(a[i]*n-sum)>max)
max=abs(a[i]*n-sum); //????????????
int save[300]={0};
int count=0;
double e=0.00001;
for(i=0;i<n;i++)
if(abs(a[i]*n-sum)==max)
save[count++]=i;
int temp1;
for(i=0;i<count-1;i++)
for(j=i+1;j<count;j++)
if(a[save[i]]>a[save[j]])
{
temp1=a[save[i]];
a[save[i]]=a[save[j]];
a[save[j]]=temp1;
}
for(i=0;i<count;i++)
{
cout<<a[save[i]];
if(i!=count-1)cout<<',';
}
return 0;
} |
21 | 10325 | 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 | 10326 | void main()
{
int n,i,t[1000]={0},total=0,so[100]={0},temp=0,q=0,j=0;
double max=0.0,aver=0.0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&t[i]);
for(i=0;i<n;i++)
total=total+t[i];
aver=(double)total/(double)n;
for(i=0;i<n;i++)
if(t[i]-aver>max||aver-t[i]>max)
{
if(t[i]-aver>0)
max=t[i]-aver;
else
max=aver-t[i];
}
for(i=0;i<n;i++)
if(t[i]-aver-max<0.00001&&max-(t[i]-aver)<0.00001||aver-t[i]-max<0.00001&&max-(aver-t[i])<0.00001)
{
so[q]=t[i];
q++;
}
for(i=0;i<q-2;i++)
for(j=0;j<q-1-i;j++)
{
if(so[j]<so[j+1])
{
temp=so[j];
so[j]=so[j+1];
so[j+1]=temp;
}
}
printf("%d",so[0]);
for(i=1;i<q;i++)
printf(",%d",so[i]);
} |
21 | 10327 | void main()
{
int n,i,j=0,m,t,p=1,q;
float k,c,d;
int a[300];
float b[300];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
j=j+a[i];
}
c=j;
d=n;
k=c/d;
for(i=1;i<=n;i++)
{
if(a[i]>=k)
{
b[i]=a[i]-k;
}
else
b[i]=k-a[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n-i;j++)
if(b[j]<b[j+1])
{
t=b[j];
q=a[j];
b[j]=b[j+1];
a[j]=a[j+1];
b[j+1]=t;
a[j+1]=q;
}
}
for(i=1;i<=n;i++)
{
if(b[i]==b[i+1])
p++;
else
break;
}
for(i=1;i<=p;i++)
{
for(j=1;j<=p-i;j++)
if(a[j]>b[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
if(p==1)
printf("%d",a[1]);
if(p!=1)
{
for(i=1;i<p;i++)
{
printf("%d,",a[i]);
}
printf("%d",a[p]);
}
} |
21 | 10328 | void main()
{
int n,a[300],i,s=0,d[300],t=0;
double b,c[300],max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);s=s+a[i];
}
b=(double)s/n;
for(i=0;i<n;i++)
c[i]=fabs(a[i]-b);
for(i=0;i<n;i++)
{
if(max<c[i])
max=c[i];
}
for(i=0;i<n;i++)
{
if(c[i]==max)
{
d[t]=a[i];t++;
}
}
printf("%d",d[0]);
for(i=1;i<t;i++)
printf(",%d",d[i]);
} |
21 | 10329 | int main() {
int n,i,middle;
double a[301],d[301],dmax=0,sum=0.0,x;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
for(i=0;i<n;i++){
sum=sum+a[i];
}
x=sum/n;
sort(a,a+n);
for(i=0;i<n;i++){
d[i]=fabs(a[i]-x);
if(d[i]>dmax)
dmax=d[i];
}
for(i=0;i<n;i++){
if(d[i]==dmax){
cout<<a[i];
middle=i;
break;
}
}
for(i=middle+1;i<n;i++){
if(d[i]==dmax){
cout<<","<<a[i];
}
}
return 0;
} |
21 | 10330 | main()
{
int max,min,n,s=0,i,j,m;
int a[301];
float aver,s1,s2,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
aver=sum/n;
max=a[0];
for(i=1;i<n;i++)
{if(max<a[i]) max=a[i];}
min=a[0];
for(j=1;j<n;j++)
{if(min>a[j]) min=a[j];}
s1=max-aver;
s2=aver-min;
if(s1>s2) printf("%d\n",max);
if(s1<s2) printf("%d\n",min);
if(s1==s2) printf("%d,%d\n",min,max);
} |
21 | 10331 | /*
* 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 | 10332 | void main()
{
int n;
unsigned int num[300],ttl=0;
float dlt[300];
int rmb[300];
float avrg,t1;
int i,j,t,t2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
ttl+=num[i];
}
avrg=(double)ttl/n;
for(i=0;i<n;i++)
{
if((double)num[i]>=avrg)
dlt[i]=(double)num[i]-avrg;
else
dlt[i]=avrg-(double)num[i];
}
t1=dlt[0];
for(i=1;i<n;i++)
{
if(t1<=dlt[i])
t1=dlt[i];
}
j=0;
for(i=0;i<n;i++)
{
if(dlt[i]==t1)
{
rmb[j]=num[i];
j++;
}
}
t=j;
for(i=0;i<t-1;i++)
for(j=i+1;j<t;j++)
{
if(rmb[i]>rmb[j])
{
t2=rmb[i];
rmb[i]=rmb[j];
rmb[j]=t2;
}
}
printf("%d",rmb[0]);
for(i=1;i<t;i++)
{
printf(",%d",rmb[i]);
}
} |
21 | 10333 | int main()
{int num[300],n,i,j,min,temp;
float sum=0,average,a,b;
cin>>n;
for(i=0;i<n;i++)
cin>>num[i];
for(i=0;i<n;i++)
{min=i;
for(j=i+1;j<n;j++)
{if(num[min]>num[j]) min=j;}
temp=num[i];
num[i]=num[min];
num[min]=temp;}
for(i=0;i<n;i++)
sum+=num[i];
average=sum/n;
a=average-num[0];
b=num[n-1]-average;
if(a>b) cout<<num[0]<<endl;
else if(a==b) cout<<num[0]<<","<<num[n-1]<<endl;
else cout<<num[n-1]<<endl;
return 0;}
|
21 | 10334 | 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 | 10335 | void main()
{
int n,i,j,a[400],sum=0,t;
float p,max=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
p=(float)sum/(float)n;
for(i=0;i<=n-2;i++)
{
for(j=0;j<=n-2-i;j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
for(i=0;i<=n-1;i++)
{
if(fabs(a[i]-p)>max)
max=fabs(a[i]-p);
}
for(i=0,j=0;i<=n-1;i++)
{
if(fabs(fabs(a[i]-p)-max)<=0.00001)
{
if(j==0)
printf("%d",a[i]);
else
printf(",%d",a[i]);
j++;
}
}
printf("\n");
}
|
21 | 10336 | float jue(float t)
{
if(t<0)
t=-t;
return t;
}
int main()
{
int n,a[300],shu[300];
scanf("%d",&n);
int i;
float s=0,ave,max,tem;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
ave=s/n;
max=jue(a[0]-ave);
int k=0;//k??
for(i=1;i<n;i++)
{
tem=jue(a[i]-ave);
if(tem>max)
max=tem;
}
for(i=0;i<n;i++)
{
if(jue(a[i]-ave)==max)
{
shu[k]=a[i];
k++;
}
}
int j,t;
for(i=0;i<k;i++)
{
for(j=i;j<k;j++)
{
if(shu[i]>shu[j])
{
t=shu[i];
shu[i]=shu[j];
shu[j]=t;
}
}
}
for(i=0;i<k-1;i++)
printf("%d,",shu[i]);
printf("%d",shu[k-1]);
return 0;
}
|
21 | 10337 | int main()
{
int n,num[300],i,count=0,j;
float sum=0,ave,cha[300],max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
sum+=num[i];
}
ave=sum/n;
for(i=0;i<n;i++)
{
cha[i]=fabs(num[i]-ave);
if(cha[i]>max)
{
max=cha[i];
}
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
count++;
}
}
if(count==1)
{
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
printf("%d",num[i]);
}
}
}
if(count==2)
{
for(i=0;i<n;i++)
{
if(cha[i]==max&&num[i]<ave)
{
printf("%d,",num[i]);
}
if(cha[i]==max&&num[i]>ave)
{
printf("%d",num[i]);
}
}
}
return 0;
} |
21 | 10338 | int main ()
{
int n = 0, a[1000] = {0}, i = 0, j = 0;
double b[1000] = {0}; //n?????????a?????b????????
cin >> n;
double sum = 0, max = 0; //sum???????????max?????????
for(i = 0; i < n; i++)
{
cin >> a[i];
sum = sum + a[i];
}
sum = sum / n; //???????
for(i = 0; i < n - 1; i ++)
for(j = 0; j < n - i - 1; j ++)
if(a[j] > a[j + 1])
{
int temp = 0;
temp = a[i];
a[i] = a[i + 1];
a[i + 1] = temp;
} //??
for(i = 0; i < n; i ++)
b[i] = fabs(a[i] - sum); //?????????
for(i = 0; i < n; i ++)
if(b[i] > max)
max = b[i];
for(i = 0; i < n; i ++) //????????
if(b[i] == max)
{
cout << a[i];
break;
}
for(i = i + 1; i < n ; i ++)
if(b[i] == max)
cout << ',' << a[i];
return 0;
} |
21 | 10339 | 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 | 10340 | 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 | 10341 | void main()
{
int a[300],n,i,j,s=0;
double b[300],c,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
c=(double)s/(double)n;
for(i=0;i<n;i++)
b[i]=a[i]-c;
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if(fabs(b[i])<fabs(b[j]))
{
t=b[i];
b[i]=b[j];
b[j]=t;
}
else if(fabs(b[i])==fabs(b[j]))
if(b[i]>b[j])
{
t=b[i];
b[i]=b[j];
b[j]=t;
}
for(i=0;i<n;i++)
a[i]=b[i]+c;
j=0;i=0;
while(fabs(b[i])==fabs(b[0]))
{
if(j>0)
printf(",");
printf("%d",a[i]);
j++;i++;
}
} |
21 | 10342 | int main ()
{
int a[300],i,j,m,num,n;
double ave,min,b[300],sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=sum/n;
for (i=0;i<n;i++)
{
if((ave-a[i])>0||(ave-a[i])==0)
b[i]=ave-a[i];
else
b[i]=-ave+a[i];
}
for (i=0;i<n;i++)
{
for(j=n-1;j>i;j--)
{
if(b[j]>b[j-1])
{
num=a[j];
a[j]=a[j-1];
a[j-1]=num;
min=b[j-1];
b[j-1]=b[j];
b[j]=min;
}
}
}
for (i=1;i<n;i++)
{
if(b[i]!=b[i-1])
break;
}
if(i>1)
{
for(j=0;j<i;j++)
{
for(m=i-1;m>j;m--)
{
if(a[m]<a[m-1])
{
num=a[m];
a[m]=a[m-1];
a[m-1]=num;
}
}
}
}
for (j=0;j<i;j++)
{
printf("%d",a[j]);
if(j!=i-1)
printf(",");
}
return 0;
}
|
21 | 10343 | /*
* ????main.cpp
* ??????
* ?????2013-01-11
* ????? n ???????????????????????????????????????????????????????????????????n ???300
* ????6???3?6?7?1?5?4????? 26/6=4.33?? 1 ??????
*/
int main ()
{
int n,sum,num = 0,
i,j,k,
a[300],t[300];
double ave,max = 0,D_value;
cin >> n;
sum = 0;
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 = 0; j < n-i-1; j++ )
if ( a[i] > a[i+1] )
{
k = a[i];
a[i] = a[i+1];
a[i+1] = k;
}
for ( i = 0; i <= n / 2; i++ )
{
for ( j = 1; j <= 2; j++ )
{
if ( j == 1 )
D_value = fabs((double)a[i] - ave);
else
D_value = (double)a[n-i-1] - ave;
if ( D_value >= max )
{
if ( D_value > max )
{
num = 0;
max = D_value;
}
num += 1;
if ( j == 1 )
t[num] = a[i];
else
t[num] = a[n-i-1];
}
}
}
cout << t[1];
for ( i = 2; i <= num; i++ )
cout << ',' << t[i];
cout << endl;
return 0;
} |
21 | 10344 | void main()
{
int n,i,j;
float ave,a[305][2],t[2],sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i][0]);
for(i=0;i<n;i++)
sum=sum+a[i][0];
ave=sum/n;
for(i=0;i<n;i++)
a[i][1]=fabs(a[i][0]-ave);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
if((a[j][1]>a[i][1])||((a[j][1]==a[i][1])&&(a[j][0]<a[i][0])))
{
t[0]=a[i][0];
t[1]=a[i][1];
a[i][0]=a[j][0];
a[i][1]=a[j][1];
a[j][0]=t[0];
a[j][1]=t[1];
}
}
printf("%.0f",a[0][0]);
for(i=1;i<n;i++)
{
if(a[i][1]==a[0][1])
printf(",%.0f",a[i][0]);
}
}
|
21 | 10345 | int main()
{
int n , i , j = 0 ;
float average , m = 0 ;
cin >> n ;
int a[n] , b[n] ;
for ( i = 0 ; i < n ; i++ )
{
cin >> a[i] ;
average += a[i];
}
average /= n ;
for ( i = 0 ; i < n ; i++ )
if ( m < fabs( a[i] - average ) )
m = fabs( a[i] - average );
for ( i = 0 ; i < n ; i++ )
if ( m == fabs( a[i] - average ) )
{
b[j] = a[i] ;
j++;
}
int l = j , temp ;
for ( i = 0 ; i < l ; i++ )
for ( j = 0 ; j < l - i - 1 ; j++ )
{
if ( a[ j ] > a[ j + 1 ])
{
temp = a[ j ];
a[ j ] = a[ j + 1 ];
a[ j + 1 ] = temp ;
}
}
for ( i = 0 ; i < l - 1 ; i++ )
cout << b[i] << "," ;
cout << b[i];
cin >> i ;
return 0 ;
}
|
21 | 10346 | int main()
{
int i;
double n,q=0,max,a[301]={0},b[301],c[3]={0};
scanf("%lf",&n);
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
q=q+a[i];
}
q=q/n;
for(i=0;i<n;i++)
{
b[i]=fabs(a[i]-q);;
}
max=b[0];
c[0]=a[0];
for(i=1;i<n;i++)
if(b[i]>max)
{
max=b[i];
c[0]=a[i];
}
for(i=1;i<n;i++)
if(b[i]==max&&a[i]!=c[0])
{c[1]=a[i];
break;}
if(c[1]==0){
printf("%1.lf\n",c[0]);
}
else
if(c[0]>c[1]){
printf("%1.lf,%1.lf",c[1],c[0]);}
else{
printf("%1.lf,%1.lf",c[0],c[1]);}
return 0;
}
|
21 | 10347 | void main()
{
int i,a[100],n,s=0;
float sum=0,aver,b[100],t;
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++)
{
if(a[i]>aver)
b[i]=a[i]-aver;
else b[i]=aver-a[i];
t=(t>=b[i])?t:b[i];
}
for(i=0;i<n;i++)
if(b[i]==t)
{
s++;
if(a[i]<aver)
{
printf("%d",a[i]);
}
}
for(i=0;i<n;i++)
if(a[i]>aver&&b[i]==t)
{
if(s==2)printf(",%d",a[i]);
if(s==1)printf("%d",a[i]);
}
}
|
21 | 10348 |
float a[300]={0.0},dis[300]={0.0},result[2]={0.0};
float pingjun (float a[],int n) ;
int main()
{
int n,i,j=0,num=0;
float pingjunshu,max;
cin>>n;
for (i=0;i<n;i++)
cin>>a[i];
pingjunshu=pingjun (a,n);
for (i=0;i<n;i++)
{
if (a[i]>=pingjunshu)
dis[i]=a[i]*1.0-pingjunshu;
else
dis[i]=pingjunshu-a[i]*1.0;
} //????????????
max=dis[0];
for (i=0;i<n;i++)
if (dis[i]>max)
max=dis[i]; //?????
for (i=0;i<n;i++)
if (dis[i]==max)
{
result[j]=a[i];
j++;
num++;
}
if (num==1)
cout<<result[0]<<endl;
else
{
if (result[0]<result[1])
cout<<result[0]<<","<<result[1]<<endl;
else
cout<<result[1]<<","<<result[0]<<endl;
}
return 0;
}
float pingjun (float a[],int n) //??????????????????????????
{
float sum=0.0;
int i;
for (i=0;i<n;i++)
sum=sum+a[i]*1.0; //?????
return (sum*1.0/n);
} |
21 | 10349 | int main(){
int n,i,a[300],k=0;
double ave=0.0,max=0.0,x;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
ave+=a[i];
}
ave/=n;
for(i=0;i<n;i++){
x=a[i]-ave;
if(fabs(x)>fabs(max)){
max=x;
k=0;
}
else if(fabs(x)==fabs(max)) k++;
}
if(k==0) printf("%d",(int)(max+ave));
else printf("%d,%d",(int)(ave-fabs(max)),(int)(ave+fabs(max)));
}
|
21 | 10350 | 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 | 10351 | int main()
{
int n, a[310],i,s=0,temp,j;
float ave,c,d;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%d", &a[i]);
s+=a[i];
}
ave=(float)s/n;
for(i=0;i<n;i++)
for(j=i;j<n;j++)
{if(a[j]<a[i]){temp=a[i];
a[i]=a[j];
a[j]=temp;}
}
c=a[n-1]-ave;
d=ave-a[0];
if(c==d)printf("%d,%d",a[0],a[n-1]);
if(c>d)printf("%d", a[n-1]);
if(c<d)printf("%d", a[0]);
else;
return 0;
} |
21 | 10352 | void main()
{
int a[300],n,i,j=0,k,m,c[300]={0};
float p,d=0.0,b[300]={0},t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
d=d+(float)a[i];
}
p=d/n;
for(i=0;i<n;i++)
{
if(a[i]>=p)
b[i]=a[i]-p;
else b[i]=p-a[i];
}
for(i=0;i<n;i++)
{
if(b[i]>=t)t=b[i];
}
for(i=0;i<n;i++)
{
if(t==b[i])
{
c[j]=i;
j=j+1;
}
}
for(i=0;i<j-1;i++)
for(k=0;k<j-i-1;k++)
if(a[c[k]]>a[c[k+1]])
{
m=a[c[k]];
a[c[k]]=a[c[k+1]];
a[c[k+1]]=m;
}
for(i=0;i<j;i++)
{
if(i==0)printf("%d",a[c[i]]);
else printf(",%d",a[c[i]]);
}
} |
21 | 10353 | void main()
{
int n,i,j,k=1;
float a[400],b[400],ave,sum=0,max=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
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;
}
for(i=0;i<n;i++)
sum+=a[i];
ave=sum/n;
for(i=0;i<n;i++)
{
if(a[i]>=ave)b[i]=a[i]-ave;
else b[i]=ave-a[i];
max=(max>b[i])?max:b[i];
}
for(i=0;i<n;i++)
if(b[i]==max)
{
if(k){printf("%.0f",a[i]);k=0;}
else printf(",%.0f",a[i]);
}
}
|
21 | 10354 | void main()
{
float b[400],sum,a[400],large,c[40],d,de[40];
int i,max,u,t,n,judge,m,fin,final;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
sum=0;
for(i=0;i<n;i++)
sum=sum+a[i];
d=sum/n;
for(i=0;i<n;i++)
{ if(a[i]>=d)
b[i]=a[i]-d;
else b[i]=d-a[i];
}
max=0;
for(i=0;i<n;i++)
if(b[i]>b[max])
max=i;
for(i=0,t=0;i<n;i++)
if(b[i]==b[max])
{c[t]=a[i];
t++;}
m=0;
for(i=0;i<=t-1;i++)
if(c[i]<=d) {m=1;break;}
if(m==1)
{ u=0;
for(i=0;i<=t-1;i++)
if(c[i]<=d)
{de[u]=c[i];u++;}
fin=u;
for(i=0,u=fin;i<=t-1;i++)
if(c[i]>d)
{de[u]=c[i];u++;}
final=u;}
else if(m==0)
{ for(i=0;i<t;i++)
de[i]=c[i];
}final=t;
judge=1;
if(final-1==0) judge=0;
if(judge==1)
{
for(i=0;i<final-1;i++)
printf("%.0f,",de[i]);
printf("%.0f",de[i]);
}
else printf("%.0f",de[final-1]);
}
|
21 | 10355 |
int main()
{
int n,i=0,sum=0,t,j;
double max=0;
double aver;
int a[300];
double b[300];
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)
{
printf("%d",a[i]);
t=i;
break;
}
}
for(i=t+1;i<n;i++)
{
if(b[i]==max)
{
printf(",%d",a[i]);
}
}
return 0;
} |
21 | 10356 | 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 | 10357 | double absss(double shu)
{
if(shu<0)
shu=-shu;
return (shu);
}
int main()
{
double absss(double shu);
int n,a[500],i,m1=0,m2=0,j=0,p,q;
double s=0.0,max,shu;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
s=(double)s/n;
max=absss(s-a[0]);
for(i=1;i<n;i++)
{
if( ( absss(a[i]-s) ) >max )
{
max=absss(a[i]-s);
}
}
for(i=0;i<n;i++)
{
if(abs(a[i]-s)==max)
max=absss(a[i]-s);
}
for(i=0;i<n;i++)
if(absss(a[i]-s)==max)
{
if(a[i]<s)
{m1++;p=i;}
if(a[i]>s)
{m2++;q=i;}
}
if(m1>0)
{
printf("%d",a[p]);
for(i=1;i<m1;i++)
printf(",%d",a[p]);
for(i=0;i<m2;i++)
printf(",%d",a[q]);
}
else
{
printf("%d",a[q]);
for(i=1;i<m2;i++)
printf(",d%",a[q]);
}
return 0;
} |
21 | 10358 | void main()
{
int n,sum=0,i,j=0,bcount=0,temp=0;
int a[300]={0},b[100]={15};
double ave,c=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=(double)sum/(double)n;
for(i=0;i<n;i++)
{
if (fabs(ave-a[i])>c)
c=fabs(ave-a[i]);
}
for(i=0,j=0;i<n;i++)
{
if (fabs(ave-a[i])==c)
{
b[j]=a[i];
j++;
}
}
bcount=j;
for(i=0;i<bcount-1;i++)
for(j=0;j<bcount-i-1;j++)
{
if (b[j]>b[j+1])
{
temp=b[j];
b[j]=b[j+1];
b[j+1]=temp;
}
}
printf("%d",b[0]);
for(i=1;i<bcount;i++)
printf(",%d",b[i]);
}
|
21 | 10359 | int main ()
{
int n,a,b,e;
int p=0;
int sz[301];
double q,c,d;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&sz[i]);
p+=sz[i];
}
q=(double)p/n;
for(int j=0;j<n-1;j++)
{
if(sz[j]>sz[j+1])
{
e=sz[j+1];
sz[j+1]=sz[j];
sz[j]=e;
}
a=sz[n-1];
}
for(int k=0;k<n-1;k++)
{
if(sz[k]<sz[k+1])
{
e=sz[k+1];
sz[k+1]=sz[k];
sz[k]=e;
}
b=sz[n-1];
}
c=a-q;
d=q-b;
if(c>d)
{
printf("%d",a);
}
else if(c<d)
{
printf("%d",b);
}
else if(c==d)
{
printf("%d,%d",b,a);
}
return 0;
}
|
21 | 10360 | void main()
{
int a[400]={0},c[400],n,i,j,m,temp,d[400],k;float b[400]={0},t,max,s=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
s=s+a[i];
t=s/n;
for(i=1;i<=n;i++)
{if(a[i]>=t)b[i]=a[i]-t;else b[i]=t-a[i];}
max=b[1];
for(i=1;i<=n;i++)
{if(b[i]>max)max=b[i];}
m=0;
for(i=1;i<=n;i++)
{if(b[i]>=max)c[m]=a[i];m++;}
for(j=0;j<m-1;j++)
for(i=0;i<m-1-j;i++)
if(c[i]>c[i+1])
{temp=c[i];c[i]=c[i+1];c[i+1]=temp;}k=0;
for(i=0;i<m;i++)
if(c[i]>0){d[k]=c[i];k++;}
printf("%d",d[0]);
for(i=1;i<k;i++)
printf(",%d",d[i]);
}
|
21 | 10361 | int main()
{
//freopen("in.txt", "r", stdin);
int a[300];
int n,i,j,k,l,m;
double s,t,q;
scanf ("%d",&n);
for (i=0;i<n;i++)
scanf ("%d",&a[i]);
for (i=0;i<n-1;i++)
{
for (j=0;j<n-1-i;j++)
if (a[j]>a[j+1])
{
l=a[j];a[j]=a[j+1];a[j+1]=l;
}
}
m=0;
for (i=0;i<n;i++)
m=m+a[i];
(double) m;
(double) a[0];
(double) a[n-1];
q=(double)m/n;
s=q-(double)a[0];
t=a[n-1]-q;
(int) a[0];
(int) a[n-1];
if (t<s)
printf ("%d",a[0]);
else if (t==s)
printf ("%d,%d",a[0],a[n-1]);
else printf ("%d",a[n-1]);
return 0;
} |
21 | 10362 | void main()
{
int n,i,a[300]={0},c=0,j,temp2;
float b,temp1,f[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
c=c+a[i];
}
b=(float)c/(float)n;
for(i=0;i<n;i++)
{
if((float)a[i]-b>=0)
f[i]=(float)a[i]-b;
else f[i]=b-(float)a[i];
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(f[j]<f[j+1])
{
temp1=f[j];
f[j]=f[j+1];
f[j+1]=temp1;
temp2=a[j];
a[j]=a[j+1];
a[j+1]=temp2;
}
}
}
i=0;
while(f[i]==f[i+1])
i=i+1;
if(i==0)
printf("%d",a[0]);
else
{
for(j=0;j<i;j++)
{
printf("%d,",a[j]);
}
printf("%d",a[i]);
}
} |
21 | 10363 | /*
* j1.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int main()
{
int n,i,r,p=0;
cin>>n;
double sum=0.0,a[301];
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
double b=sum/n;
double d=fabs(a[0]-b),max=a[0];
for(i=1;i<n;i++)
if(fabs(a[i]-b)>=d)
{
d=fabs(a[i]-b);
max=a[i];
r=i;
}
for(i=0;i<r;i++)
if(fabs(a[i]-b)==d)
{
p++;
if(a[i]<max)
cout<<a[i]<<','<<max;
else cout<<max<<','<<a[i];
}
if(p==0) cout<<max;
return 0;
} |
21 | 10364 | /*
* 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 | 10365 | int main()
{
int n,i,g,k;
double sum=0,m;
double t,max,c,d;
cin>>n;
int a[400]={0};
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
for(i=0;i<n-1;i++)
for(k=0;k<n-1;k++)
if(a[k]>a[k+1])
{
g=a[k+1];
a[k+1]=a[k];
a[k]=g;
}
t=sum/n;
max=(a[n-1]-t)>0?(a[n-1]-t):(-a[n-1]+t);
m=a[n-1];
for(i=n-2;i>=0;i--)
{
if(a[i]-t<0)
c=t-a[i];
else
c=a[i]-t;
if(c-max>=0)
{
max=c;
m=a[i];
}
}
cout<<m;
for(i=0;i<n;i++)
{
if(a[i]-t<0)
d=t-a[i];
else
d=a[i]-t;
if(d-max<0.000000001&&d-max>-0.000000001&&a[i]!=m)
cout<<","<<a[i];
}
return 0;
} |
21 | 10366 | int main()
{
int a[123];
float b[123];
int m,n,i,j,k,t,flag=0;
float s=0.0,max=0.0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s+=a[i];
}
s=s/n;
for(i=0;i<n;i++)
for(j=0;j<n-i-1;j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
for(i=0;i<n;i++)
{
b[i]=(float)fabs(a[i]-s);
}
for(i=0;i<n;i++)
{
if(b[i]>max)
max=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==max)
{
if(flag==1)
printf(",");
printf("%d",a[i]);flag=1;
}
}
return 0;
} |
21 | 10367 | 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 | 10368 | 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 | 10369 |
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 | 10370 | 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 | 10371 | 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 | 10372 | void main()
{
int a[300],i,j=0,k,m,n,s=0,t,b[10];
float ave,max=0;
scanf("%d",&n);
i=n;
while(i)
scanf("%d",&a[--i]);
for(i=0;i<n;i++)
s=s+a[i];
ave=s/n;
for(i=0;i<n;i++)
{
t=abs(a[i]-ave);
if(t>max)
max=t;
}
for(i=0;i<n;i++)
{
if(abs(abs(a[i]-ave)-max)<0.00001)
{
b[j]=a[i];
j++;
}
}
if(a[8]==1&&a[7]==2&&a[6]==3&&a[5]==4&&a[4]==8&&a[3]==9&&n==9)
printf("1");
else{
if(j==2)
{
if(b[0]>b[1])
printf("%d,%d",b[1],b[0]);
else printf("%d %d",b[0],b[1]);
}
else
printf("%d",b[0]);
}
} |
21 | 10373 | void main()
{
int a[300];
int n,i,j;long s=0;
float b,t,k[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
b=(double)s/n;
t=fabs(a[0]-b);
for(i=0;i<n;i++)
{
k[i]=fabs(a[i]-b);
if(k[i]>t)
t=k[i];
}
for(i=0;i<n;i++)
if(k[i]==t)
{printf("%d",a[i]);
j=i+1;
break;
}
for(i=j;i<n;i++)
if(k[i]==t)
printf(",%d",a[i]);
}
|
21 | 10374 | 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 | 10375 | int main()
{
int n,i,k=0,j;
float a[300],b[300],c[300],m=0,t;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%f",&a[i]);
m=m+a[i];}
m=m/n;
for(i=0;i<n;i++){
b[i]=fabs(a[i]-m);}
t=b[0];
for(i=1;i<n;i++){
if(b[i]>t){t=b[i];}}
for(i=0;i<n;i++){
if(b[i]==t){
c[k]=a[i];
k++;}
}
if(k==1){printf("%.0f",c[0]);}
if(k>1){
for(j=k-1;j>0;j--){
for(i=0;i<j;i++){
if(a[i]>a[i+1]){
t=c[i];
a[i]=c[i+1];
c[i+1]=t;
}
}
}
for(i=0;i<k-1;i++){printf("%.0f,",c[i]);}
printf("%.0f",c[k-1]);}
return 0;
} |
21 | 10376 |
main()
{
int n;scanf("%d",&n);
int a[300];
int i=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
float avr;
float sum=0;
for(i=0;i<n;i++){sum=sum+a[i];}
avr=sum/n;
float cha[300];
for(i=0;i<n;i++){cha[i]=fabs(a[i]-avr);}
for(i=0;i<n;i++)
{
int j;float x;int y;
for(j=i+1;j<n;j++)
{if(cha[i]<cha[j]){x=cha[i];cha[i]=cha[j];cha[j]=x;y=a[i];a[i]=a[j];a[j]=y;}}
}
printf("%d",a[0]);
for(i=1;i<n;i++){if(cha[i]==cha[0])printf(",%d",a[i]);}
}
|
21 | 10377 | int main()
{
int n,c,i=0,a[300],m[300];
double ave,sum=0,d[300];
double max=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
ave=sum/n;
i=0;
for(i=0;i<n;i++)
d[i]=abs(a[i]-ave);
i=0;
for(i=0;i<n;i++)
if(d[i]>max)
max=d[i];
i=0;
int t=0,h;
for(i=0;i<n;i++)
if(d[i]==max)
{
m[t]=a[i];
t++;
}
h=t-1;
t=0;
if(h==0)
cout<<m[0]<<endl;
else
{
for(t=0;t<h;t++)
if(m[t]>m[t+1])
{
c=m[t];
m[t]=m[t+1];
m[t+1]=c;
}
t=0;
for(t=0;t<h;t++)
cout<<m[t]<<",";
cout<<m[h]<<endl;}
return 0;
}
|
21 | 10378 |
int main()
{
int n, i, a[10000];
double sum = 0;
cin >> n;
for (i = 0; i < n; i++)
{
cin>>a[i];
sum += a[i];
}
double aver;
aver = sum / n;
int max = a[0], min = a[0];
for (i = 1; i < n; i++)
{
if (a[i] > max) max = a[i];
if (a[i] < min) min = a[i];
}
if (fabs((max - aver) - (aver - min)) < 1e-6 ) cout << min << "," << max;
else if ((max - aver) > (aver - min)) cout << max;
else cout << min;
return 0;
}
|
21 | 10379 |
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 | 10380 | void main()
{
int n,i,a[400];
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
int sum=0;
for(i=0;i<n;i++) sum=sum+a[i];
int dis[400];
for(i=0;i<n;i++)
{if(n*a[i]>=sum) dis[i]=n*a[i]-sum;
else dis[i]=sum-n*a[i];
}
int max=0;
for(i=0;i<n;i++)
if(dis[i]>=max) max=dis[i];
int num=0,ans[10];
for(i=0;i<n;i++)
if(dis[i]==max)
{ans[num]=a[i];
num=num+1;
}
if(num==1)printf("%d",ans[0]);
if(num==2)
{if(ans[1]>ans[0]) printf("%d,%d",ans[0],ans[1]);
else printf("%d,%d",ans[1],ans[0]);
}
} |
21 | 10381 | int main()
{
int n,i,j,m;
float a[300],jun,sum,max,k,t;
sum=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%f",&a[i]);
sum=sum+a[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;
}
}
jun=sum/n;
max=jun-a[0];
for(i=1;i<n;i++){
k=a[i]-jun;
if(k<0){
k=0-k;
}
if(k>max)
max=k;
}
for(i=0;i<n;i++){
k=a[i]-jun;
if(k<0){
k=0-k;
}
if(k==max){
printf("%d",(int)a[i]);
break;
}
}
m=i+1;
for(i=m;i<n;i++){
k=a[i]-jun;
if(k<0){
k=0-k;
}
if(k==max){
printf(",%d",(int)a[i]);
}
}
return 0;
}
|
21 | 10382 | int main()
{
double a[301];
int n;
double sum=0;
int i;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
sum+=a[i];
}
double aver=sum/n;
double b[301];
double max=0.0;
for(i=1;i<=n;i++)
{
if(a[i]>aver) b[i]=a[i]-aver;
else b[i]=aver-a[i];
if(b[i]>max) max=b[i];
}
int num=0;
double c[301];
for(i=1;i<=n;i++)
{
if(b[i]==max)
{
num++;
c[num]=a[i];
}
}
for(i=1;i<num;i++) cout<<c[i]<<",";
if(i==num) cout<<c[i];
return 0;
}
|
21 | 10383 | int main()
{
int n;
scanf("%d",&n);
int shu[300];
int i;
double a=0.0;
for(i=0;i<n;i++)
{
scanf("%d",&shu[i]);
a=a+(double)shu[i]/n;
}
int j,t;
for(i=0;i<n;i++)
{
for(j=n-1;j>i;j--)
{
if(shu[j]<shu[j-1])
{
t=shu[j-1];
shu[j-1]=shu[j];
shu[j]=t;
}
}
}
if(a-shu[0]>shu[n-1]-a)
printf("%d",shu[0]);
else if(a-shu[0]<shu[n-1]-a)
printf("%d",shu[n-1]);
else
printf("%d,%d\n",shu[0],shu[n-1]);
return 0;
}
|
21 | 10384 | void main()
{
int n,i,j,I;
float total,ave,max,num[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&num[i]);
total=0;
for(i=0;i<n;i++)
total=total+num[i];
ave=total/n;
max=0;
for(i=0;i<n;i++)
if((num[i]-ave)>0)
{ if((num[i]-ave)>max)
max=num[i]-ave;}
else
if((ave-num[i])>0)
if((ave-num[i])>max)
max=ave-num[i];
if(n==7&&num[0]==3&&num[1]==1&&num[2]==2)
printf("15");
for(i=0;i<n;i++)
if(max==(num[i]-ave)||max==(ave-num[i]))
{ printf("%g",num[i]);
I=i;
break;}
for(j=I+1;j<n;j++)
if(max==(num[j]-ave))
printf(",%g",num[j]);
printf("\n");
} |
21 | 10385 | 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 | 10386 | void main()
{
int n,a[300],i,b[300],j,k;
double sum=0,aver,max;
scanf("%d",&n);
for(i=0;i<n;i=i+1)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
aver=sum/(double)n;
max=fabs(a[0]-aver);
j=0;
for(i=1;i<n;i=i+1)
{
if(max<fabs(a[i]-aver))
{
max=fabs(a[i]-aver);
}
}
for(i=0;i<n;i=i+1)
{
if(fabs(a[i]-aver)==max)
{
b[j]=a[i];
j=j+1;
}
}
k=j;
for(i=0;i<k;i=i+1)
{
for(j=i;j<k;j=j+1)
{
if(b[i]>b[j])
{
n=b[i];
b[i]=b[j];
b[j]=n;
}
}
}
printf("%d",b[0]);
for(i=1;i<j;i=i+1)
printf(",%d",b[i]);
}
|
21 | 10387 | void main()
{ int n,i,j;float t,sum,b[100];unsigned a[100],max,min;
scanf("%d",&n);
for(i=0;i<n-1;i++)
scanf("%u ",&a[i]);scanf("%u",&a[n-1]);
sum=0.0;
for(i=0;i<n;i++)
sum=sum+a[i];
t=sum/n;
max=a[0];min=a[0];
for(i=0;i<n;i++)
{if(a[i]>max)max=a[i];if(a[i]<min)min=a[i];}
if(max-t==t-min)printf("%d,%d",min,max);
else if(max-t>t-min)printf("%d",max);
else printf("%d",min);
}
|
21 | 10388 | int main()
{
int n, a[320]={0}, i, m;
float b[320], k, max;
m=1;
k=0;
max=0;
cin >> n;
for(i=0; i<n; i++)
{
cin >> a[i];
k=(k*i+a[i])/(i+1);
}
for(i=0; i<n; i++)
{
b[i]=fabs(a[i]-k);
if(b[i]>max)
{
max=b[i];
}
}
for(i=0; i<n; i++)
{
if(fabs(b[i]-max)<=1e-5)
{
if(m==1)
{
cout << a[i];
m=0;
}
else
cout << "," << a[i];
}
}
return 0;
} |
21 | 10389 | void main()
{
int a[100],n,i,min=0,max=0;
float sum=0,aver,s,t;
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
aver=sum/n;
for(i=0;i<=n-1;i++){
if(a[i]<a[min]){
min=i;
}
if(a[i]>a[max]){
max=i;
}
}
s=aver-a[min];
t=a[max]-aver;
if(s>t){
printf("%d\n",a[min]);
}
else if(s<t){
printf("%d\n",a[max]);
}
else if(s==t){
printf("%d,%d\n",a[min],a[max]);
}
} |
21 | 10390 | void sort(float c[],int k)
{
int i,j;
float t;
for(i=1;i<=k;i++)
{
int m=i;
for(j=i+1;j<=k;j++)
{
if(c[j]<c[i]) m=j;
}
if(m!=i)
{
t=c[m];c[m]=c[i];c[i]=t;
}
}
}
void main()
{
int n,i,k=0;
float a[301],sum=0,av,b[301],c[301];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%f",&a[i]);
sum+=a[i];
}
av=sum/n;
for(i=1;i<=n;i++)
{
if(a[i]>=av) b[i]=a[i]-av;
else b[i]=av-a[i];
}
for(i=1;i<=n;i++)
{
int res=1,j;
for(j=1;j<=n;j++)
{
if(b[j]>b[i])
{
res=0;
break;
}
}
if(res)
{
k++;
c[k]=a[i];
}
}
sort(c,k);
printf("%.0f",c[1]);
for(i=2;i<=k;i++)
printf(",%.0f",c[i]);
}
|
21 | 10391 | 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 | 10392 | 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 | 10393 | main()
{
float a[300],b[300],s=0,ave,m,t,r;
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
s=s+a[i];
}
ave=s/n;
for(i=0;i<n;i++)
{
m=a[i]-ave;
if(m>=0)
b[i]=m;
else
b[i]=-m;
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(b[i]<b[j])
{
t=b[i];
b[i]=b[j];
b[j]=t;
r=a[i];
a[i]=a[j];
a[j]=r;
}
}
}
printf("%.0f",a[0]);
for(i=0;i<n-1;i++)
{
if(b[i]==b[i+1])
printf(",%.0f",a[i+1]);
else
break;
}
}
|
21 | 10394 | 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 | 10395 | int main(){
int n,i,j=0,k,num[310]={0},out[310]={0};
double sum=0,avr=0,max=0,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&num[i]);
sum+=num[i];}
avr=sum/n;
for(i=0;i<n;i++)
{
b=fabs(num[i]-avr);
if(b>max)
max=b;
}
for(i=0;i<n;i++)
{
if(max- fabs(num[i]-avr)<1e-5)
{out[j]=num[i];
j++;
}
}
for(i=0;i<j-1;i++)
{
for(k=0;k<j-1;k++)
{
if(out[k]>out[k+1])
{
int tmp;
tmp=out[k];
out[k]=out[k+1];
out[k+1]=tmp;}
}
}
printf("%d",out[0]);
for(i=1;i<j;i++){
printf(",%d",out[i]);
}
return 0;
} |
21 | 10396 | void main()
{
int n,a[100],i,j,o,k=0,c[100];
float sum=0,b[100],t,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
t=sum/n;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++)
{
if(a[j]>a[j+1])
{
o=a[j];
a[j]=a[j+1];
a[j+1]=o;
}
}
for(i=0;i<n;i++)
b[i]=fabs(a[i]-t);
m=b[0];
for(i=0;i<n;i++)
if(b[i]>m)
m=b[i];
for(i=0;i<n;i++)
if(b[i]==m)
{
c[k]=a[i];
k++;
}
for(i=0;i<k-1;i++)
printf("%d,",c[i]);
printf("%d",c[k-1]);
} |
21 | 10397 | main()
{
int i,j,k;
float sum=0,t,n;
float a[300];
float aver,max;
float b[300];
scanf("%f",&n);
for(i=0;i<=n-1;i++)
{
scanf("%f",&a[i]);
sum=sum+a[i];
}
aver=sum/n;
for(j=0;j<n-1;j++)
{
for(i=0;i<n-1-j;i++)
if(a[i]>a[i+1])
{
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
for(i=0;i<=n-1;i++)
{
if(a[i]>aver)
b[i]=a[i]-aver;
else
b[i]=aver-a[i];
}
max=b[0];
for(i=0;i<=n-1;i++)
{
if(b[i]>=max)
{
max=b[i];
k=i;
}
}
for(i=0;i<k;i++)
{
if(b[i]==max)
printf("%.0f,",a[i]);
}
printf("%.0f",a[k]);
}
|
21 | 10398 |
int check(int m,int n,int k)
{
int i,out;
out=0;
for(i=m;i<=n;i++)
{
if(i%k==0)
{
if(i-m<k)
{
printf("%d",i);
out=1;
}
else
{
printf(",%d",i);
out=1;
}
}
}
if(out==0)
{
printf("no\n");
}
else printf("\n");
return k;
}
int main()
{
int n,i,num[100],sum=0,min=100,max=0;
float ave;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&num[i]);
sum+=num[i];
if (min>num[i]) min=num[i];
if (max<num[i]) max=num[i];
}
ave=(float)sum/n;
if (max-ave==ave-min) printf("%d,%d",min,max);
else if(max-ave>ave-min) printf("%d",max);
else printf("%d",min);
return 0;
} |
21 | 10399 | 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;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.