POJ-1477

最新推荐文章于 2017-02-08 11:07:58 发布

EddyLiu-csdn

最新推荐文章于 2017-02-08 11:07:58 发布

阅读量546

点赞数

分类专栏： POJ

本文链接：https://blog.csdn.net/eddy_liu/article/details/48227341

版权

POJ 专栏收录该内容

93 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<vector>
using namespace std;

int main(int argc, char *argv[]){
	int stacksNum;
	vector<int> v(50);
	int setNum=0;
	while(cin>>stacksNum, stacksNum!=0){
		int bricksNum=0;
		int moveTimes=0;

		setNum++;

		for(int i=0;i<stacksNum;i++){
			cin>>v[i];
			bricksNum+=v[i];
		}

		for(int i=0;i<stacksNum;i++){
			int move=bricksNum/stacksNum-v[i];
			if(move>0){
				moveTimes+=move;
			}
		}

		cout<<"Set #"<<setNum<<endl;
		cout<<"The minimum number of moves is "<<moveTimes<<".\n"<<endl;
	}

	return 0;
}