codeforces 401A - Vanya and Cards

題目鏈接：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;
}