| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
帮帮我这个菜鸟吧..#include<iostream>
using namespace std;
main()
{
int n;
int t=1;
do
{
scanf("%d",&n);
int *sub=NULL;
int sum=0,aver=0;
int i=0;
if(n==0)
break;
sub=(int *)malloc((n+1)*sizeof(int));
for(i=0;i<n;i++)
{
scanf("%d",&sub[i]);
sum+=sub[i];
}
aver=sum/(i-1);
sum=0;
for(i=0;i<n;i++)
if(sub[i]<aver)
sum+=aver-sub[i];
printf("Set #%d\n",t);
printf("The minimum number of moves is %d.\n\n",sum);
}while(t++);
}
为什么RE...
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator