神奇的fans （C语言代码）

解题思路:





注意事项:





参考代码:

#include <stdio.h>

int main(void)

{

int i, j, l, n, m, d, max, count;

scanf("%d", &n);

int num[100];

for (i = 0;i < n;i++)

{

count = 0;

scanf("%d", &m);

for (j = 0;j < m;j++)

scanf("%d", &num[j]);

for (j = 0;j < m;j++)

{

for (l = j, max = num[j];l < m;l++)

{

if (max < num[l])

{

max = num[l];

num[l] = num[j];

num[j] = max;

}

}

}

d = num[0] - num[1];

j = 0;

while (num[j] - num[j+1] == d && j+1 <m)

{

count++;

j++;

}

if (count == m-1)

printf("yes\n");

if (count != m-1)

printf("no\n");

}

return 0;

}