competitive-programming/solved-lightOj/1148.cpp at master · the-redback/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long llu;

#define ft        first
#define sd        second
#define mp        make_pair
#define pb(x)     push_back(x)
#define all(x)    x.begin(), x.end()
#define allr(x)   x.rbegin(), x.rend()
#define mem(a, b) memset(a, b, sizeof(a))
#define inf       1e9
#define eps       1e-9
#define mod       1000000007
#define NN        30100

#define read(a) scanf("%lld", &a)

ll a[100];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t = 1, tc;
    cin >> tc;
    ll i, j, k, l, m, n;
    while (tc--) {
        cin >> n;

        ll ans = 0;
        ll sum = 0;
        for (i = 0; i < n; i++) cin >> a[i];
        sort(a, a + n);

        ll cnt = 1;

        for (i = 1; i < n; i++) {
            if (a[i] != a[i - 1]) {
                ll tmp = ceil(cnt / (double)(a[i - 1] + 1));
                tmp = tmp * (a[i - 1] + 1);
                sum += tmp;
                cnt = 1;
            } else
                cnt++;
        }
        ll tmp = ceil(cnt / (double)(a[n - 1] + 1));
        tmp = tmp * (a[n - 1] + 1);
        sum += tmp;

        printf("Case %lld: %lld\n", t++, sum);
    }
    return 0;
}