POJ 1477 解题报告

简单题。

thestoryofsnow1477Accepted132K16MSC++

/* ID: thestor1 LANG: C++ TASK: poj1477 */#include <iostream>#include <fstream>#include <cmath>#include <cstdio>#include <cstring>#include <limits>#include <string>#include <vector>#include <list>#include <set>#include <map>#include <queue>#include <stack>#include <algorithm>#include <cassert>using namespace std;const int MAXN = 50;int main(){int n;int nums[MAXN];int caseno = 1;while (scanf("%d", &n) && n > 0){int sum = 0;for (int i = 0; i < n; ++i){scanf("%d", &nums[i]);sum += nums[i];}int avg = sum / n;int nmoves = 0;for (int i = 0; i < n; ++i){if (nums[i] > avg){nmoves += nums[i] - avg;}}printf("Set #%d\n", caseno);caseno++;printf("The minimum number of moves is %d.\n\n", nmoves);}return 0;  }