POJ 1477 Box of Bricks G++

来源:互联网 发布:吉百利巧克力知乎 编辑:程序博客网 时间:2024/06/03 19:58

#include <iostream>#include <cstring>using namespace std;int main(){int a[1000];memset(a,0,sizeof(a));int jg[1000];memset(jg,0,sizeof(jg));int m=0;while(1){int n;cin>>n;if(n==0){break;}int b[n];for(int i=0;i<n;i++){cin>>b[i];}int avg=0;for(int i=0;i<n;i++){avg=b[i]+avg;}avg=avg/n;for(int i=0;i<n;i++){if(b[i]>avg){jg[m]=jg[m]+b[i]-avg;}}m++;}for(int i=0;i<m;i++){cout<<"Set #"<<i+1<<endl;cout<<"The minimum number of moves is "<<jg[i]<<"."<<endl<<endl;//The minimum number of moves is 5.}return 0;} 

0 0
原创粉丝点击