题目链接:http://codeforces.com/problemset/problem/401/A
题目大意:求最小操作数。
题目分析:……。
代码参考:
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
const int N = 1e6+9;
int main()
{
int n, m, t, i, j, k;
while(~scanf("%d%d", &n, &m))
{
int sum = 0;
for(i=0; i<n; ++i)
{
scanf("%d", &t);
sum += t;
}
sum = abs(sum);
int ans;
if(sum%m == 0) ans = sum/m;
else ans = sum/m+1;
printf("%d\n", ans);
}
return 0;
}