201712-1

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

int HaveSame(int a[],int n)
{
    int i = 0;
    int result=20000;
    for (i = 1; i < n; i++)
    {
        if (a[i] == a[i - 1])
        {
            return 0;
        }
        else
        {
            if ((a[i] - a[i - 1]) < result)
            {
                result = a[i] - a[i - 1];
            }
        }
    }
    return result;
}

int cmp(const void * a, const void * b)
{
    return (*(int*)a - *(int*)b);//a>b 返回正值  
}

int main()
{
    int n;
    scanf("%d", &n);
    int num[1002];
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &num[i]);
    }
    qsort(num, n, sizeof(num[0]),cmp);
    printf("%d\n", HaveSame(num, n));
    return 0;
}