label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
21 | 10000 | void main()
{
long j;
int i,N,a[301]={0};
int sum,max,min;
scanf("%d",&N);
scanf("%d",&a[0]);
sum=max=min=a[0];
for(i=1;i<N;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
if(a[i]>max)max=a[i];
else if(a[i]<min)min=a[i];
}
j=(max*N-sum)-(sum-min*N);
if(j>0)printf("%d",max);
else if(j==0)printf("%d,%d",min,max... |
21 | 10001 | void main()
{
int i,j,x=0;
float m=0,k,b[300],c[300],d,a[300],n;
scanf("%f",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
for(i=0;i<n;i++)
{
m=m+a[i];
}
k=m/n;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(a[j]>a[j+1])
{
d=a[j];
a[j]=a[j+1];
a[j+1]=d;
}
}
}
for(i=0;i<n;i++)
{
... |
21 | 10002 | int main()
{
int i,n,t=0,count=0,j;
float k,sum=0,a[300],b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%f",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
k=(float)sum/(float)n;
for(i=0;i<n;i++)
{
if(a[i]>=k)
b[i]=a[i]-k;
else b[i]=k-a[i];
}
float x=b[0];
for(i=1;i<n;i++)
{
if(b[i]>x)
{
x=b[i]... |
21 | 10003 | 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;... |
21 | 10004 | int main()
{
int n,i,j,k1,k2,k3,k4,z,h;
float a[1000],sum=0,s,b[1000],m,o,fl;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum=sum+a[i];
b[i]=a[i];
/* printf("%f,%f,%f\n",a[i],sum,b[i]);*/
}
s=sum/n;
/*printf("%f\n",s);*/
for(j=0;j<n;j++)
{
if(b[j]-s>0)
{
b[j]=b... |
21 | 10005 | void main()
{
int a[300],b[300];
int j=0,i,n,k,m,t;
float c,max,sum=0,d[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
c=sum/n;
for(i=0;i<n;i++)
{
if(c-a[i]>=0)
d[i]=c-a[i];
else
d[i]=a[i]-c;
}
max=d[0];
for(i=0;i<n;i++)... |
21 | 10006 | void main()
{
int n,a=0,i,q=0,c[2],j,u=1;
int num[501];
float av,k[501],p[501],temp;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
i==1?scanf("%d",&num[i]):scanf(" %d",&num[i]);
}
for(i=1;i<=n;i++) a=a+num[i];
av=a/n;
for(i=1;i<=n;i++)
k[i]=abs(num[i]-av);
for(i=1;i<=n;i++)
p[i]=k[i];
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(k[i... |
21 | 10007 |
int main(int argc, char* argv[])
{
int n,i,a[300],s=0;
double t,max=0;
int x,y,flag;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s+=a[i];
}
t=(float)s/n;
for(i=0;i<n;i++)
{
if(fabs(a[i]-t)>max)
{
x=a[i];
max=fabs(a[i]-t);
flag=0;
}
else if(fabs(a[i]-t)==max)
{
y=a[i];
f... |
21 | 10008 | 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]=f... |
21 | 10009 | void bb(int n,int b[300]){
int i=0,j=0,k;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++){
if(b[j]>b[j+1]){
k=b[j];
b[j]=b[j+1];
b[j+1]=k;
}
}
}
int main()
{
int n,i,a[200],s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
s+=a[i];
}
bb(n,a);
... |
21 | 10010 | 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];
... |
21 | 10011 | int main()
{
int n,sum=0,i,j,a[301],temp;
double ave;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",(a+i));
for(i=0;i<n;i++)
sum+=*(a+i);
ave=(double)sum/(double)n;
for(j=1;j<n;j++)
{
for(i=0;i<n-j;i++)
{
if(fabs(ave-*(a+i))<fabs(ave-*(a+i+1)))
{
temp=*(a+i);
*(a+i)=*(a+i+1);
*(a+i+1)=te... |
21 | 10012 | int main()
{
int num[300];
float average=0,temp,max=0;
int i,n,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",num+i);
for(i=0;i<n;i++)
average+=num[i];
average/=n;
for(i=0;i<n;i++)
{
temp=fabs(average-num[i]);
if(temp>max)
... |
21 | 10013 | //*************************************************
//***????????***
//***??????***
//***???2013.1.13***
//*************************************************
int main ()
{
int n,c,i,t[2],flag;
double a[301],average,d;
cin >> n;
average = 0;
for (i = 0; i < n; i++)
{
cin >> a[i];
average += a[i];
}
average /=... |
21 | 10014 | 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[... |
21 | 10015 | 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("%... |
21 | 10016 | void main()
{
long i,s,k,n,max,min;
scanf("%ld\n",&n);
min=32767; max=0; s=0;
for (k=1;k<=n;k++){scanf("%ld",&i); if(max<i)max=i; if(min>i)min=i; s+=i;}
if ((max*n-s)>(s-min*n)) printf("%ld\n",max);
else if ((max*n-s)<(s-min*n)) printf("%ld\n",min);
else printf("%ld,%ld",min,max);
} |
21 | 10017 | 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];
... |
21 | 10018 | //============================================================================
// Name : 4.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
int main() {
i... |
21 | 10019 | int main(int argc, char* argv[])
{
int n,i,c[300],k;
double a=0,b[300];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&c[i]);
a+=c[i];
}
a/=n;
for(i=0;i<n;i++){
b[i]=c[i]-a;
}
for(i=n-1;i>0;i--){
for(k=0;k<i;k++){
if(b[k]>b[k+1]){
double t=b[k];
b[k]=b[k+1];
b[k+1]=t... |
21 | 10020 | void bubble(int *p,int n)
{
int i=0,pass,temp;
for(pass=1;pass<=n;pass++)
{
for(i=0;i<n-pass;i++)
{
if(*(p)>*(p+1))
{
temp=*(p);
*(p)=*(p+1);
*(p+1)=temp;
}
}
}
return;
}
float ffabs(float x)
{
if(x>0)
return x;
else
return -x;
}
void main()
{
int n,i,*num,sum=0,*temp,r=0;
float... |
21 | 10021 | void main()
{
int n,i,j,k,t,max,temp,sum=0,a[300],b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
sum=sum+a[i];
if((a[0]*n)>sum)
max=a[0]*n-sum;
else if((a[0]*n)<sum)
max=sum-a[0]*n;
for(i=1;i<n;i++)
{if(((a[i]*n)>sum)&&(((a[i]*n)-sum)>max))
max=a[i]*n-sum;
else if(((a[i]*... |
21 | 10022 | struct
{float a;
float c;
}num[401];
void main()
{
int n,i,j;
float sum=0,b,h=0,k;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%f",&num[i].a);
for(i=0;i<n;i++)
{
sum=sum+num[i].a;
}
b=sum/n;
for(i=0;i<n;i++)
{
num[i].c=fabs(num[i].a-b);
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-1;i++)
{
if(num[i].c<nu... |
21 | 10023 | 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;
}
... |
21 | 10024 |
float my_abs(float a)
{
return a < 0 ? -a : a;
}
int main()
{
//freopen("in.txt", "r", stdin);
int n;
scanf("%d", &n);
float avg = 0;
float data[400];
for (int i = 0;i < n; i++)
{
scanf("%f", &data[i]);
avg += data[i];
}
avg /= n;
float dif[400];
for (int i = 0;i < n; i++)
{
dif[i] = my_abs(data... |
21 | 10025 | int main(int argc, char* argv[])
{
int i,n,num[300],s,j,b,c;
double ave,v[300],a;
s=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&num[i]);
s+=num[i];
}
ave=(double)s/n;
for(i=0;i<n;i++){
if(num[i]<ave){
v[i]=ave-num[i];
}
else{
v[i]=num[i]-ave;
}
}
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++)... |
21 | 10026 |
int main() {
struct data1 {
int num;
float min;
} data[1000], temp;
int n, i,j;
float sum=0, max;
scanf("%d", &n);
for(i=0;i<n;i++) {
scanf("%d", &data[i].num);
sum+=data[i].num;
}
sum=sum/n;
for(i=0;i<n;i++) {
if(data[i].num>=sum) {
data[i].min=data[i].num-sum;
} else {
data[i].min=sum-data... |
21 | 10027 | void main()
{
int n,i,j,k,t,a[300],sum=0,s=0;
float average,b[300],max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n-1;i++) //????
{
k=i;
for(j=i+1;j<n;j++)
{
if(a[k]>a[j]) k=j;
}
if(k!=i)
{
t=a[i];
a[i]=a[k];
a[k]=t;
}
}
for(i=0;i<n;i++)
{
sum=sum+a[i... |
21 | 10028 | int main()
{
int i,j,k,l,m,n;
double average,sum=0.0,max;
int a[305];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
average=sum/n;
max=fabs(a[0]-average);
// printf("%lf %lf",average,max);
for(i=1;i<n;i++)
{
if(fabs(a[i]-average)>max) max=fabs(a[i]-average);
}
for(i=0;i<n;... |
21 | 10029 |
int main()
{
unsigned int i,n,a[M],flag=1;
double ave=0,max=0;
scanf("%u",&n);
for (i=0;i<n;i++)
{
scanf("%u",&a[i]);
ave+=a[i];
}
ave=ave/n;
for (i=0;i<n;i++)
{
double c;
if ((c=fabs(ave-a[i])-max)>0 && fabs(c)>E) max+=c;
}
for (i=0;i<n;i++)
if (fabs(fabs(a[i]-ave)-max)<E)
{
if (!flag)... |
21 | 10030 | 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;
... |
21 | 10031 | int main(){
int a[300],n,i,j,he=0,temp,num=0;
float pingjun,max;
cin>>n;
for(i=0;i<=n-1;i++)
{
cin>>a[i];
he+=a[i];
}
pingjun=(float)he/(float)n;
for(i=n-1;i>=1;i--)
for(j=0;j<=i-1;j++)
{
if(a[j]>a[j+1])
{
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}
}
for(i=0;i<=n-1;i++)
if(abs(a[i]... |
21 | 10032 | void main()
{
int n,i,j,k,a[300];
float d=0,m=0,p=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);d=d+a[i];
}
d=(float)d;
d=d/n;
for(i=0;i<n;i++)
{
if(a[i]-d>=0)
{if(a[i]-d>p)
{p=a[i]-d;j=i;}}
else
{if(d-a[i]>m)
{m=d-a[i];k=i;}
}
}
if(p>m)
printf("%d",a[j]);
el... |
21 | 10033 | float f(float a)
{
if(a<0)
return -a;
else
return a;
}
int main()
{
float n;
cin>>n;
double a[100];
int i,j;
float sum=0;
for(i=1;i<=n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
float ave,t;
ave=sum/n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n-i;j++)
{
if(a[j+1]<a[j])
{
t=a[j];a[j]=a[... |
21 | 10034 | 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(fa... |
21 | 10035 | int main()
{
double Numbers[500]={0};
double Temp[100]={-1};
double Ave=0;
double Sum=0;
double Max=0;
double Exchange=0;
int k=0;
int n=0;
int i=0;
int j=0;
cin>>n;
for (i=0;i<n;i++)
{cin>>Numbers[i];
Sum+=Numbers[i];}
Ave=Sum/n;
for (i=0;i<n;i++)
{ if (fabs(Num... |
21 | 10036 | float cc(int x,float y)
{
if (x>y)
return(x-y);
else return(y-x);
}
void main()
{
int n,i,p=0,j;
float sum=0,t=0;
int a[301],b[301];
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
sum=sum/n;
for (i=1;i<=n;i++)
if (cc(a[i],sum)>t)
t=cc(a[i],sum);
for (i=1;i<=n;i++)
{
if (c... |
21 | 10037 |
int main()
{
int n,a[500],min=100000,max=0,sum=0;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++)
{
if(a[i]>max) max=a[i];
if(a[i]<min) min=a[i];
sum+=a[i];
}
if(sum-min*n<max*n-sum) cout<<max;
else if(sum-min*n>max*n-sum) cout<<min;
else cout<<min<<','<<max;
return 0;
}
|
21 | 10038 | void main()
{
int a[301],i,j,n,sum=0,max,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<=n-1;j++)
if(a[j]<a[i])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
if((a[0]+a[n-1])*n==sum*2)
printf("%d,%d\n",a[0],a[n-1]);
else if((a... |
21 | 10039 | 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+... |
21 | 10040 | int main()
{
int n,i,a[100],j,t,c[100];
int s=0;
float max,m,b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}for(i=0;i<n;i++)
{
for(j=n-1;j>i;j--)
{
if(a[j]<a[j-1])
{
t=a[j-1];
a[j-1]=a[j];
a[j]=t;
}
}
}
for(i=0;i<n;i++)
{
m=(float)s/n;
b[i]=a[i]-m;
... |
21 | 10041 | int main()
{
int n,i,t=0,f[300]={0};
float a[300]={0},d[300]={0},s=0,max=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%f",&a[i]);
s=s+a[i];
}
s=s/n;
for (i=0;i<n;i++)
{
d[i]=fabs((float)a[i]-s);
if (d[i]>max) max=d[i];
}
for (i=0;i<n;i++)
{
//printf("%f,",(d[i]-max));
if ((max-d[i])<1e-6)
{
f[t]=a[i];
t++;
}
}
//prin... |
21 | 10042 | void main()
{
int i,j,r=0,t;
float n,sum=0;
float a[100]={0},b[100]={0};
int c[100]={0};
scanf("%f",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum+=a[i];
}
sum=sum/n;
for(i=0;i<n;i++)
{
for(j=i;j<n;j++)
{
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
for(i=0;i<n;i++)
{
... |
21 | 10043 | int main()
{
int n;
int i,j;
int a[300];
float b[300];
int c[300];
int t=0;
int sum=0;
int temp;
float ave;
float max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
ave=(float)sum/n;
for(i=0;i<n;i++)
{
if(a[i]-ave>=0)
b[i]=a[i]-ave;
else
b[i]=ave-a[i];
if (b[i]... |
21 | 10044 | void main()
{
int a[300],n,i,j,temper;
float average,sum=0,b[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
average=sum/n;
//printf("%f",average);
for(i=0;i<n;i++)
{
if(a[i]>average)
b[i]=a[i]-average;
else
b[i]=average-a[i];
}
//for(i=0;i<n;i++)
//{
//printf(... |
21 | 10045 | int main()
{
int n;
double sum = 0.0;
double ave;
double a[300];
double b[300];
double c[300] = {0.0};
int d[300];
int i, j, num = 0;
double temp;
cin >> n;
for ( i = 0; i < n; i++ )
{
cin >> a[i];
sum = sum + a[i];
}
for ( i = 0; i < n - 1; i++ )
for ( j = 0; j < n - 1 - i; j++ )
if ( a[i] < a[j... |
21 | 10046 |
double num[400];
double dis[400];
int main()
{
int n;
int i,j;
double temp;
double ave=0;
const double min=1e-6;
double max=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>num[i];
ave+=num[i];
}
ave=ave/n;
for(i=n-2;i>=0;i--)
for(j=0;j<=... |
21 | 10047 | //#include<string.h>
int i,n,a[1000],max,min;
float aver;
int main(){
scanf("%d",&n);
scanf("%d",&a[0]);
min=a[0];max=a[0];aver=a[0];
for(i=1;i<n;i++){
scanf("%d",&a[i]);
aver+=a[i];
if(a[i]>max) max=a[i];
if(a[i]<min) min=a[i];
}
aver/=n;
if(max+... |
21 | 10048 | int main()
{
int n, i, j, a[300], tempint, count = 1;
double aver = 0, b[300], temp;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
aver += a[i];
}
aver = aver / n;
for(i = 0; i < n; i++)
{
b[i] = fabs(aver - a[i]);
}
for(i = 0; i < n - 1; i++)
{
for(j = 0; j < n - 1 - i; j++)
{
if(b[j] < b[j+... |
21 | 10049 | int main()
{
int i,j,n,t,a[300]={0};
float ave=0,sum=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-1;i++){
for(j=0;j<n-i-1;j++){
if(a[i]>a[i+1]){
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
}
if((ave-a[0])>(a[n-1]-ave))
printf("%d",a[0]);
else i... |
21 | 10050 |
int main()
{
int n, i, j, a[10000];
float sum=0, ave, max=0, b, c, d, e;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%d", &a[i]);
sum=sum+(float)a[i];
}
ave=sum/(float)n;
c=ave;
b=ave;
for(j=0; j<n; j++)
{
if((float)a[j]>c)
c=(float)a[j];
else if((float)a[j]<b)
b=(float)a[j];
}
d=c-ave;
e... |
21 | 10051 | int n,sum=0,a[100],b[100];
double ave,max=0;
void bubble(int *a,int n)
{
int i,j,m;
for (i=1;i<n;i++)
for (j=0;j<n-i;j++)
if(a[j]>a[j+1])
{
m=a[j];
a[j]=a[j+1];
a[j+1]=m;
}
}
void fuc()
{
int i,j=0;
ave=(double)sum/n;
for (i=0;i<n;i++)
{
max=(fabs(ave-a[i])>max) ? fabs(ave-a[i]) : max;... |
21 | 10052 | void main()
{
float a[300];
unsigned int b[300],i,j=0,n;
float sum=0,p,max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum+=a[i];
}
p=(float)sum/n;
for(i=0;i<n;i++)
if(fabs(a[i]-p)>max)
max=fabs(a[i]-p);
for(i=0;i<n;i++)
if(fabs(fabs(a[i]-p)-max)<0.01)
b[j++]=(int)a[i];
if(j==1)
p... |
21 | 10053 | int main()
{
int a[300];
float b[300];
int i,n;
float sum=0;
scanf("%d",&n);
for(i=0;i<=n-2;i++)
{
scanf("%d ",&a[i]);
}
scanf("%d",&a[n-1]);
for(i=0;i<=n-1;i++){
sum=sum+a[i];
}
float m;
m=sum/n;
for(i=0;i<=n;i++){
b[i]=a[i]-m;
if(b[i]<0){
b[i]=m-a[i];
}
}
float max=0;
for(i=0;i<=n... |
21 | 10054 | int main()
{
int i,j,n,x,sum=0,a[300]={0};
double average,b[300]={0},t;
cin>>n;
for(i=0;i<n;i++)
{cin>>a[i];
sum=sum+a[i];}
for(i=0;i<n-1;i++)
for(j=0;j<n-1-i;j++)
if(a[j]>a[j+1])
{
x=a[j];a[j]=a[j+1];a[j+1]=x;
}
for(i=0;i<n;i++)
{
... |
21 | 10055 | void main()
{
int i,n,a[305],sum,z;
int aver,x=0,y;
scanf("%d",&n);
for(i=0,sum=0;i<n;i++)
{scanf("%d",&a[i]);sum+=a[i];}
aver=(sum+n-2)/n;
for(i=0;i<n;i++)
{y=a[i]-aver;
if(y<0) y=0-y;
if(x<y) x=y;}
for(i=0;;i++){
y=a[i]-aver;
if(y==x||y==0-x) {printf("%d",a[i]),z=i;break;}
else continue;}
for(i=z+1;i<n;i++)... |
21 | 10056 | int main(){
int a[100],i,n;
float ave,b[100],k=0,m=0,t=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
m=m+a[i];
}
ave=(float)m/n;
for(i=0;i<n;i++)
{
b[i]=fabs((float)(a[i]-ave));
if(b[i]>k)
k=b[i];
}
for(i=0;i<n;i++)
{
if(b[i]==k){
t++;
... |
21 | 10057 | void main()
{
int n,s=0,i,j;
int a[300];
double b[300]={0},c[300];
double ave,t,p,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
s=s+a[i];
ave=(double)s/n;
for(i=0;i<n;i++)
{
if(a[i]>ave)
{
b[i]=a[i]-ave;
c[i]=ave-a[i];
}
else
{
b[i]=ave-a[i];
c[i]=b[i];
... |
21 | 10058 | int main()
{
int n,i,j,t,m,c=0,sum=0,ave;
int a[300],b[300];
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++)
b[i]=abs(a[i]*n-sum);
for(i=0;i<n;i++)
for(j=0;j<n-i-1;j++)
{
if(b[j]<b[j+1])
{
t=b[j];
b[j]=b[j+1];
b[j+1]=t;
m=a[j];
... |
21 | 10059 | void main()
{
int i,j,n,num=0;
float average,n1,m,sn=0,a[300],b[300],max,k[300],p[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sn=sn+a[i];
}
n1=n;
average=sn/n1;
for(i=0;i<n;i++)
{
m=(average-a[i]);
b[i]=m*m;
}
max=b[0];
for(i=0;i<n;i++)
{
for(j=i;j<n;j++)
{
if(max>=b[j+1... |
21 | 10060 | int main()
{
int n,i,j,t,x,a[1000],b[1000];
scanf("%d",&n);
for (i=1;i<=n;i++) scanf("%d",&a[i]);
float s=0;
for (i=1;i<=n;i++) s=s+a[i];
s=s/n;
float max=0;
for (i=1;i<=n;i++)
{
if (fabs(a[i]-s)>max)
{
max=fabs(a[i]-s);
t=1;
b[t]=a[i];
... |
21 | 10061 | int main()
{
int n;
double in[400];
double cha[400]={0};
int i,j,k,s=0;
double temp=0;
int flag[400]={0};
double to=0,aver;
cin>>n;
for(i=0;i<=n-1;i++){
cin>>in[i];
to=to+in[i];
}
aver=to/n;
//cout<<aver<<endl;
for(i=0;i<=n-1;i++){
cha[i]=fabs(in[i]-aver);
// cout<<cha[i]<<endl;
}
for(i=0;i<=n-1;i++){
if(temp<cha[i... |
21 | 10062 | int main ()
{
float a[300];
int n,i,j,k;
float average,c;
float 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(k=0;k<n-1-j;k++)
{
if(a[k]>a[k+1])
{
c=a[k];
a[k]=a[k+1];
a[k+1]=c;
}
}
}
average=sum/(float)n;
if(average-a[0... |
21 | 10063 | void main()
{
int n,i,j,k=0;
struct num
{
unsigned int a;
double b;
}num[301];
double aver,sum=0;
scanf("%d",&n);
printf("\n");
for(i=0;i<n;i++)
{
scanf("%d ",&num[i].a);
sum=sum+num[i].a;
}
printf("\n");
aver=sum/n;
for(i=0;i<n;i++)
num[i].b=fabs(num[i].a-av... |
21 | 10064 | void main()
{
int a[300],n,i,j1=0,j2=0,sum=0;
double ave,qq=0.0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
ave=(float)sum/n;
for(i=0;i<n;i++)
{
if(qq<fabs(a[i]-ave))
{
qq=fabs(a[i]-ave);
j1=i;
}
if(qq==fabs(a[i]-ave)&&a[i]!=a[j1])
j2=i;
}
if(fabs(a[j1]-ave)==fabs... |
21 | 10065 | /*
* sub.cpp
*
* Created on: 2011-12-23
* Author: 11229
*/
/*
* ?????.cpp
*
* Created on: 2011-12-23
* Author: 11229
*/
void sort(double arr[100],int len);
int main()
{
int n,i,imax=0,imin=0;
cin>>n;
double sum=0,array[301]={0},average=0,*p=NULL,distant[301]={0},*pdis=distant,
MAXdis=0,MINdis... |
21 | 10066 | 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... |
21 | 10067 | /*
* sub.cpp
*
* Created on: 2011-12-23
* Author: 11229
*/
/*
* ?????.cpp
*
* Created on: 2011-12-23
* Author: 11229
*/
void sort(double arr[100],int len);
int main()
{
int n,i,imax=0;
cin>>n;
double sum=0,array[301]={0},average=0,*p=NULL,distant[301]={0},*pdis=distant,
MAXdis=0,maxnum[100]={... |
21 | 10068 | void main()
{
int num[300],i,k=0,n,j;
float aver,sub[300],sum=0;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&num[i]);
sum=sum+num[i];
}
aver=sum/n;
for (i=0;i<n;i++)
sub[i]=fabs(num[i]-aver);
for (i=0;i<n;i++)
if (sub[i]>sub[k])
k=i;
for (i=0;i<n;i++)
if (sub[i]==sub[k]&&i!=k)
{
if (num[... |
21 | 10069 |
int main(int argc, char* argv[])
{
int n,sum=0,a[300];
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum += a[i];
}
float aver;
aver=(float)sum/n;
int j;
float b[300];
for(j=0;j<n;j++)
{
if((float)a[j]>aver)
{
b[j]=a[j]-aver;
}
else
{
b[j]=aver-a[j];
}
}
float c;
... |
21 | 10070 | int main(){
int n,k=0;
cin>>n;
float a[n],ar,sum=0,max=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
ar=sum/n;
for(int i=0;i<n;i++)
if(abs(a[i]-ar)>=max)max=abs(a[i]-ar);
for(int i=0;i<n;i++)
if((abs(a[i]-ar)==max)&&k==0){cout<<a[i];
k++;
}
else if((abs(a[i]-ar)==max)&&k!=0){cout<<','<<a[i];
... |
21 | 10071 | int main()
{
int n,i;int s[300]={0};int max,min;int ave;float ave2;
scanf("%d",&n);
scanf("%d",&s[0]);
ave=s[0];max=s[0];min=s[0];
for(i=1;i<=n-1;i++)
{
scanf("%d",&s[i]);
if(s[i]>max) max=s[i];
if(s[i]<min) min=s[i];
ave=ave+s[i];
}
ave2=(float)ave;
ave2=ave2/n;
if(fabs((max-ave2)-(ave2-min))<0.001) ... |
21 | 10072 | int main()
{
int i,j,sum;
int n,p=0;
double x,temp;
int a[301],c[301];
double b[301];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(i=0,sum=0;i<=n-1;i++)
{
sum=sum+a[i];
}
x=(1.0*sum)/n;
for(i=0;i<=n-1;i++)
{
if(a[i]-x<0)
{
b[i]=x-a[i];
}
else
{
b[i]=a[i]-x;
}
}
f... |
21 | 10073 | 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 -... |
21 | 10074 | int main(){
double p,sum=0.0;
int i,n,m[300],k=0,temp;
double c[300],a[300];
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
p=sum/n;
for(i=0;i<n;i++){
double x=a[i]-p;
c[i]=fabs(x);
}
double max=0;
for(i=0;i<n;i++){
if(c[i]>=max){
max=c[i];
}
}
for(i=0;i<n;i++){
if(c[i]==max){
m[k]=i... |
21 | 10075 | void main()
{
int i,j=0,n;
double p,b[300],max,a[300],sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
sum=sum+a[i];
}
p=sum/n;
for(i=0;i<n;i++)
{
if(a[i]>=p)
b[i]=a[i]-p;
else b[i]=p-a[i];
}
max=b[0];
for(i=1;i<n;i++)
{
if(b[i]>max)
{
max=b[i];
}
}
for(i=0;i<n;i++)
... |
21 | 10076 | void main()
{
int n,i,j,p=0;
float m,a[300],sum=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
sum=sum+a[i];
}
m=sum/n;
for(i=0;i<(n-1);i++)
{
for(j=(i+1);j<n;j++)
if(fabs(a[i]-m)<fabs(a[j]-m))
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
for(i=0;i<n;i++)
... |
21 | 10077 |
int main()
{
unsigned int a[300], n, sum = 0;
double ave, max[100], c, big = 0;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
ave = (double)sum / n;
int s = 0;
for (int j = 0; j < n; j++)
{
c = fabs(a[j] - ave);
if (c == big)
{
s++;
max[s] = a[j];
}
if (c > big... |
21 | 10078 |
int main()
{
int n,a[300]={0},b[300]={0},i,sum=0,j,temp;
double aver,dist,temp1;
scanf("%d\n",&n);
scanf("%d",&a[0]);
for(i=1;i<n;i++)
scanf(" %d",&a[i]);
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;}
for(i=0;i<n;i++)
sum+=a[i];
aver=sum/(double... |
21 | 10079 | int main()
{
int n,sum=0,i,m[350],max,j,cha[350];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m[i]);
sum=sum+m[i];
}
cha[0]=abs(m[0]*n-sum);
max=cha[0];
j=0;
for(i=1;i<n;i++)
{
cha[i]=abs(m[i]*n-sum);
if(cha[i]>max)
{
max=cha[i];
j=i;
}
}
for(i=0;i<n;i++)
{
if(cha[i]==max)
{
i... |
21 | 10080 | void main()
{
int n,a[300],b[300],i,p,k,j=1,q;
double s=0,m=0,t;
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++)
{
t=fabs(a[i]-s);
if(t>m)
{
m=t;
k=i;
p=1;
}
else if(fabs(t-m)<=1e-6)
p++;
}
b[0]=a[k];
if(p==1)
printf("%d",a[k]);... |
21 | 10081 | int s(int f[],int n)
{
int i,sum=0;
for(i=0;i<n;i++)
sum+=f[i];
return sum;
}
int dis(int x,int n,int sum)
{
int tp;
if((x*n)>sum)
tp=x*n-sum;
else
tp=sum-x*n;
return tp;
}
int max_d(int d[],int n,int sum)
{
int i,tp,max=0;
for(i=0;i<n;i++)
if(d[i]>max)
max=d[i];
return max;
}
void main()
{
int i,... |
21 | 10082 | struct s
{
float c;
int b;
}s[301]={0.0,0};
void main()
{
int n,j,i,a[300],sum=0;
float av;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
av=(float)sum/n;
for(i=0;i<n;i++)
{
s[i].c=fabs(a[i]-av);
s[i].b=i;
}
for(j=0;j<n;j++)
{
for(i=0... |
21 | 10083 | int main()
{
int n,i,j,tem,a[300];
float ave,b[300],max,sum;
sum=0;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%d",&a[j]);
sum=sum+a[j];
}
ave=sum/n;
for(i=0;i<n;i++)
{
if(a[i]<=ave)
b[i]=ave-a[i];
else
b[i]=a[i]-ave;
}
max=b... |
21 | 10084 | int main()
{
int i,j,k,p,temp,x[300],z[300];
float ave,total,y[300],max=0;
total=0;
p=0;
scanf("%d",&k);
for(i=0;i<=k-1;i++)
{
scanf("%d",&x[i]);
total+=x[i];
}
ave=total/k;
for(i=0;i<=k-1;i++)
y[i]=(fabs)(x[i]-ave);
for(i=0;i<=k-1;i++)
{
if(y[i]>max) max=y[i];
}
for(i=0;i<=k-1;i++)
{
if((max-... |
21 | 10085 | int main(){
int n;
double sum=0,ave,max=0;
cin>>n;
int a[n],i;
double b[n],x=0,y=0;
for(i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
ave=sum/n;
for(i=0;i<n;i++){
b[i]=abs(a[i]-ave);
if(max<b[i]) max=b[i];
}
for(i=0;i<n;i++){
if (b[i]==max && x==0) x=a[i];
if (b[i]==max && x!... |
21 | 10086 |
void main()
{
unsigned long a[1000], n, i, min, max;
double ave=0;
scanf("%d", &n);
for (i=0;i<n;i++)
{
scanf("%d", &a[i]);
}
min=a[0];
max=a[0];
for (i=0;i<n;i++)
{
ave+=a[i];
if (a[i]<min) min=a[i];
if (a[i]>max) max=a[i];
}
ave/=n;
double d1=ave-min, d2=max-ave;
if (fabs(d1-d2)<1e-10)
print... |
21 | 10087 | void main()
{ unsigned int n,i,j,a[300],b[300];float av=0,m,mm=0;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=0;i<n;i++) av=av+a[i];
av=av/n;
for(i=0;i<n;i++)
{ if(av>a[i]) m=av-a[i];
else m=a[i]-av;
if(m>=mm) mm=m;
}
for(j=0;j<300;j++) b[j]=0;
j=0;
for(i=0;i<n;i++)
{ if(av>a[i]) m=av-a[i]... |
21 | 10088 | /*/?? - ?????
?? ??-From Whf
??
?? n ???????????????????????????????????????????????????????????????????n ???300
????6???3?6?7?1?5?4????? 26/6=4.33?? 1 ??????
????
?1????????? n?
?2???? n ??????????????
????
???????????????????????????????????????????????????
????
7
1 2 3 4 5 6 7
????
1,7
/*/
v... |
21 | 10089 | 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)... |
21 | 10090 | void main()
{
int n,a[301]={0},i,j,l;
float av=0,b[301]={0},k;
scanf("%d",&n);
for(i=1;i<=n;i++) {scanf("%d",&a[i]); av+=a[i];}
av=av/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++)
for(j=1;j<=(n-i);j++)
if(b[j]<b[j+1]) {k=b[j];b[j]=b[j+1];b[j+1]=k;
l=a[j];a[j]=a[... |
21 | 10091 |
int main(int argc, char* argv[])
{
int n,i=0,j=0,r[300],sum=0,l=0,k=0;
double aver,cha[300],max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&r[i]);
sum=sum+r[i];
}
aver=sum*1.0/n;
for(i=0;i<n;i++)
{
cha[i]=fabs(aver-r[i]);
}
for(i=0;i<n;i++)
{
if(cha[i]>max)
{
max=cha[i];
}
}
for(i=... |
21 | 10092 | 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++)
... |
21 | 10093 | void main()
{
int n,i,j,k,total=0,a[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
float N,b[300]={0.0000},c[300]={0.0000};
for(i=0;i<n;i++)
{
total=total+a[i];
}
N=(float)total/n;
for(i=0;i<n;i++)
{
if(a[i]>=N)b[i]=a[i]-N;
else c[i]=N-a[i];
}
float bmax=0.0000,cmax=0.0000;
f... |
21 | 10094 | float average(int a[],int n)
{
int sum=0,i;
float avr;
for(i=0;i<n;i++)
sum=sum+a[i];
avr=(float)sum/n;
return(avr);
}
void main()
{
int n,a[300],i,num;
float avr,b[300],t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
avr=average(a,n);
for(i=0;i<n;i++)
{
if(a[i]>avr)
b[i]=(float)a[i]-avr;... |
21 | 10095 | int main()
{
int n,i,num_min=1,num_max=1;
float max=-10000,min=10000,a[301],sum=0,ave;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]>max)
{
max=a[i];
num_max=1;
}
else if(a[i]==max)
{
num_max++;
}
if(min>a[i])
{
min=a[i];
num_min=1;
}
else if(min==a[i])
{
num_min++;
}
... |
21 | 10096 |
int main()
{
int n;
double max=0;
int num[310]={0};
int out[310]={0};
double sum=0,avr=0;
int i=0,j=0,k=0;
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++)
{
if(fabs(num[i]-avr)>max)
... |
21 | 10097 | void main()
{int n,i,t=0;float s=0;
int m[300];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&m[i]);
s=s+m[i];}
float aver;
aver=s/n;
int k=0;
for(i=1;i<n;i++)
if(fabs(m[k]-aver)<fabs(m[i]-aver))
k=i;
for(i=0;i<n;i++)
if(fabs(m[k]-aver)==fabs(m[i]-aver))
{if(t)
printf(",");
printf("... |
21 | 10098 | main()
{
int n,i,j;
float ave,x,sum=0;
float a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&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])
{
x=a[j];
a[j]=a[j+1];
a[j+1]=x;
}
if((ave-a[0])<(a[n-1]-ave)) printf("%d\n",(int)a[n-1]);
else i... |
21 | 10099 | 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++)
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.