码迷,mamicode.com
首页 > 其他好文 > 详细

POJ 1477

时间:2015-06-09 16:37:50      阅读:64      评论:0      收藏:0      [点我收藏+]

标签:

 1 #include <iostream>
 2 #define MAXN 100
 3 using namespace std;
 4 
 5 int _[MAXN];
 6 
 7 int main()
 8 {
 9     //freopen("acm.acm","r",stdin);
10     int n;
11     int i;
12     int ave;
13     int sum;
14     int time = 0;
15     while(cin>>n,n)
16     {
17         sum = 0;
18         for(i = 0; i < n; ++ i)
19         {
20             cin>>_[i];
21             sum += _[i];
22         }
23         ave = sum/n;
24         sum = 0;
25         for(i = 0; i < n; ++ i)
26         {
27             sum += abs(_[i]-ave);
28         }
29         cout<<"Set #"<<++ time<<endl;
30         cout<<"The minimum number of moves is ";
31         cout<<sum/2<<"."<<endl;
32         cout<<endl;
33     }
34 }

 

POJ 1477

标签:

原文地址:http://www.cnblogs.com/gavinsp/p/4563409.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!