[BOJ] 14815 : Fresh Chocolate (Small)

#include <cstdio>
#include <algorithm>
using namespace std;

int main() {
	int tc, t, n, p, c[5];
	scanf("%d", &tc);
	for (t = 1; t <= tc; t++) {
		c[0] = c[1] = c[2] = c[3] = 0;
		
		scanf("%d %d", &n, &p);
		for (int i = 0, a; i < n; i++) scanf("%d", &a), c[a % p]++;
		
		int r = c[0];
		if (p == 2) {
			r += (c[1] + 1) / 2;
		}
		else if (p == 3) {
			if (c[1] > c[2]) swap(c[1], c[2]);
			r += c[1] + (c[2] - c[1] + 2) / 3;
		}

		printf("Case #%d: %d\n", t, r);
	}

	return 0;
}