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