Codechef ACM-ICPC Asia-Kanpur Site First Round Online Contest 2013 D

#include <map> #include <set> #include <stack> #include <queue> #include <cmath> #include <vector> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; #define maxn 101 #define mod 1000000007 #define INF 0x7fffffff #define ll long long //#define ll __int64 int n, m; int a[maxn]; int main(){ int cas = 1; while (scanf("%d", &n) && n){ int s = 0; for (int i = 0; i < n; i++){ scanf("%d", &a[i]); s += a[i]; } s /= n; int ans = 0; for (int i = 0; i < n; i++)if (a[i]>s)ans += a[i] - s; printf("Set #%d\nThe minimum number of moves is", cas++); printf("% d.\n", ans); } return 0; } Statues Problem code: STATUES

My Submissions All Submissions

The Princess of the Indian Royal Rajput clan loves her Royal Palace. There are N rooms in the palace. Every room has one or more statues. It is not necessary that every room has the same number of statues.

The Princess believes in total equality. It makes her sad to see some rooms with more statues than other rooms. Hence, she has decided to make the number of statues equal in all the rooms. Fortunately, the total number of statues in the palace, across all the rooms, is a multiple of N.

Your job is to figure out the minimum number of moves needed in order to equalize the number of statues in all the rooms. In one move, you may select a statue and move it to any other room. All the statues are indistinguishable.

Input

The input consists of multiple test cases. Each test case is described on two lines.

The first line contains a single positive integer N, the number of rooms.

The second line contains N positive integers { A₁, A₂, ..., A_N } separated by single spaces, describing the number of statues in each of the N rooms respectively.

The end of input is signified by a special test case with N = 0. This will be the last test case in the input, and should not be processed.

Constraints

There are at most 50 test cases in a test file.
1 ≤ N ≤ 50
1 ≤ Ai ≤ 100
Sum of all Ai's is divisible by N

Output

For each test case, print two lines in the output. The first of such lines is the test case number, T in the form of "Set #T", without the quotes (see sample output for clarity). On the second line, print "The minimum number of moves is M.", without the quotes. Here, M is the minimum number of moves you must make to equalize the number of statues in all the rooms. Output a blank line after each test case.

Be careful about the case and punctuation in the above strings. Not adhering to the output format strictly will lead to the Wrong Answer verdict.

Sample Input

6
5 2 4 1 7 5
3
2 3 4
0

Sample Output

Set #1
The minimum number of moves is 5.

Set #2
The minimum number of moves is 1.