215662026-01-13 16:15:47algoproBájital (80 pont)cpp17Wrong answer 40/8037ms800 KiB
// UUID: da78dfae-d14e-46a6-9c0a-95e381cfa6fa
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	vector<int> num(n);
	for (int i=0; i<n; i++) cin >> num[i];

	int div = 0;
	int mod = 0;

	for (int i=0; i<n; i++){
		div += num[i]/m;
		mod += num[i]%m;
	}

	cout << min(div, mod) + ((div-min(div, mod))*m)/(m+1);

}
SubtaskSumTestVerdictTimeMemory
base40/80
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted4/42ms316 KiB
8Accepted4/42ms316 KiB
9Wrong answer0/235ms800 KiB
10Wrong answer0/237ms612 KiB
11Wrong answer0/237ms564 KiB
12Wrong answer0/237ms564 KiB
13Wrong answer0/237ms564 KiB
14Wrong answer0/237ms564 KiB
15Wrong answer0/237ms564 KiB
16Wrong answer0/237ms564 KiB
17Wrong answer0/237ms760 KiB
18Wrong answer0/237ms564 KiB
19Wrong answer0/237ms564 KiB
20Wrong answer0/237ms564 KiB
21Wrong answer0/237ms564 KiB
22Wrong answer0/237ms564 KiB
23Accepted4/42ms508 KiB
24Accepted4/41ms508 KiB
25Accepted4/41ms316 KiB
26Accepted4/420ms564 KiB
27Wrong answer0/435ms564 KiB
28Wrong answer0/435ms564 KiB
29Accepted4/435ms632 KiB
30Accepted2/235ms564 KiB
31Accepted2/235ms756 KiB
32Wrong answer0/237ms564 KiB
33Wrong answer0/235ms608 KiB