题解

#include <bits/stdc++.h>
using namespace std;

char s[10];
long long cnt[500005];

int main() {
	int tot = 0;
	while (scanf("%s", s) == 1) {
		long long num = 0;
		int tmp = -1;
		for (int i = 0; i < 7; i++) {
			if (s[i] <= '9') {
				tmp = s[i] - '0';
			} else {
				tmp = s[i] - 'A' + 10;
			}
			num += tmp * pow(36, 6 - i);
		}
		cnt[tot++] = num;
	}
	
	sort(cnt, cnt + tot);
	long long ret = 1e18;
	for (int i = 1; i < tot; i++) {
		ret = min(ret, cnt[i] - cnt[i-1]);
	}
	printf("%lld\n", ret);
	return 0;
}