This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const string ny[2] = {"No", "Yes"};
int main() {
ll n,k;
cin>>n>>k;
ll cad[n];
for(int i=0; i<n; i++)
{
cin>>cad[i];
cad[i]=cad[i]%k;
}
sort(cad,cad+n);
ll bs=(cad[n-1]-cad[0]+1)/2;
for(int i=0; i<n-1; i++)
{
bs=min((cad[i]+k-cad[i+1]+1)/2,bs);
}
cout<<bs;
return 0;
}
# | 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... |