Submission #74288844

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,char> pic;
typedef vector<int> vi;
typedef vector<ll> vll;
#define SZ(x) ((int)x.size())
ll ksm(ll a,ll b,ll p){if (p == 1)return 0;if (b == 0)return 1%p;
ll ans = 1;	a %= p;while (b > 0){if (b&1){ans = ans*a%p;}a = (a*a)
%p;b >>= 1;}return ans;}
const int mod = 1e9+7;
const int P = 998244353;
const ll inf = (1LL << 50LL);
const ll N = 5010;

int n,k,mi = 1 << 30;
int a[200010];
int b[200010],rear = 0;
map<int,int> f;
int main(){
	scanf("%d%d",&n,&k);
	for (int i = 1;i <= n;i++){
		scanf("%d",&a[i]);
		b[i] = a[i]%k;
	}
	sort(b+1,b+n+1);
	mi = min(mi,b[n]-b[1]);
	for (int i = 1;i <= n;i++){
		mi = min(mi,b[i]+k-b[i+1]);
	}
	printf("%d",mi);
	
    return 0;
}

Submission Info

Judge Result