#include #include #include int compareIntegers(const void *a, const void *b) { return (*(int*)a - *(int*)b); } void main(void) { int n = 0; scanf("%d",&n); int numList[n]; for(int i = 0; i < n ; i ++){ scanf("%d",&numList[i]); } size_t arraySize = sizeof(numList) / sizeof(numList[0]); qsort(numList, arraySize, sizeof(int), compareIntegers); int min = numList[1] - numList[0]; for(int i = 1 ;i < n-1;i++){ if(numList[i+1] == numList[i]){ continue; } if( (min == 0 || min > numList[i+1] - numList[i] ) && numList[i+1] - numList[i] != 0){ min = numList[i+1] - numList[i]; } if(min == 1){ break; } } printf("%d",min); }