#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
ll n, t;
cin >> n >> t;
if (t == 1) {
cout << 0;
return 0;
}
vector<ll> a(n);
for (ll& i : a) cin >> i, i %= t;
sort(a.begin(), a.end());
ll mx = 0;
for (int i = 0; i < n - 1; i++)
mx = max(mx, a[i + 1] - a[i]);
mx = max(mx, t - a[n - 1] + a[0]);
cout << (t - mx + 1) / 2;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |