#include <stdio.h>
#include <stdlib.h>
int compare(const void *a, const void *b) {
return (*(int*)a - *(int*)b);
}
int isArithmeticProgression(int arr[], int size) {
if (size == 1) {
return 1;
}
qsort(arr, size, sizeof(int), compare);
int difference = arr[1] - arr[0];
for (int i = 2; i < size; i++) {
if (arr[i] - arr[i - 1] != difference) {
return 0;
}
}
return 1;
}
int main() {
int arr[] = {10, 20, 15, 5, 25, 35, 30};
int size = sizeof(arr) / sizeof(arr[0]);
(isArithmeticProgression(arr, size)) ? (printf("Yes\n")) : (printf("No\n"));
return 0;
}
/*
run:
Yes
*/