请用C语言实现:输入两个集合A、B，验证集合的并、交、相对补和对称差运算

以下是使用C语言实现输入两个集合A、B，并验证集合的并、交、相对补和对称差运算的示例代码：

#include <stdio.h>

#define MAX_SIZE 100

int main() {
    int A[MAX_SIZE], B[MAX_SIZE], union_set[MAX_SIZE], intersection_set[MAX_SIZE], relative_complement_set[MAX_SIZE], symmetric_difference_set[MAX_SIZE];
    int n, m, i, j, k, l;

    printf("Enter the number of elements in set A: ");
    scanf("%d", &n);

    printf("Enter the elements of set A: ");
    for (i = 0; i < n; i++) {
        scanf("%d", &A[i]);
    }

    printf("Enter the number of elements in set B: ");
    scanf("%d", &m);

    printf("Enter the elements of set B: ");
    for (j = 0; j < m; j++) {
        scanf("%d", &B[j]);
    }

    // Union
    k = 0;
    for (i = 0; i < n; i++) {
        union_set[k] = A[i];
        k++;
    }
    for (j = 0; j < m; j++) {
        for (i = 0; i < n; i++) {
            if (B[j] == A[i]) {
                break;
            }
        }
        if (i == n) {
            union_set[k] = B[j];
            k++;
        }
    }

    // Intersection
    l = 0;
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            if (A[i] == B[j]) {
                intersection_set[l] = A[i];
                l++;
                break;
            }
        }
    }

    // Relative complement of A in B
    k = 0;
    for (j = 0; j < m; j++) {
        for (i = 0; i < n; i++) {
            if (B[j] == A[i]) {
                break;
            }
        }
        if (i == n) {
            relative_complement_set[k] = B[j];
            k++;
        }
    }

    // Symmetric difference
    k = 0;
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            if (A[i] == B[j]) {
                break;
            }
        }
        if (j == m) {
            symmetric_difference_set[k] = A[i];
            k++;
        }
    }
    for (j = 0; j < m; j++) {
        for (i = 0; i < n; i++) {
            if (B[j] == A[i]) {
                break;
            }
        }
        if (i == n) {
            symmetric_difference_set[k] = B[j];
            k++;
        }
    }

    printf("\nUnion of A and B: ");
    for (i = 0; i < k; i++) {
        printf("%d ", union_set[i]);
    }

    printf("\nIntersection of A and B: ");
    for (i = 0; i < l; i++) {
        printf("%d ", intersection_set[i]);
    }

    printf("\nRelative complement of A in B: ");
    for (i = 0; i < k; i++) {
        printf("%d ", relative_complement_set[i]);
    }

    printf("\nSymmetric difference of A and B: ");
    for (i = 0; i < k; i++) {
        printf("%d ", symmetric_difference_set[i]);
    }

    return 0;
}

这个程序首先要求用户输入两个集合A和B的元素，并将它们存储在数组A和B中。然后，程序使用循环和条件语句计算集合的并、交、相对补和对称差运算，并将结果存储在相应的数组中。最后，程序输出这些数组的元素，以显示计算的结果。