write a c program to print unique prime numbers in array

Sure, here is a simple C program that prints unique prime numbers from an array:

#include <stdio.h>
#include <stdbool.h>

bool isPrime(int num) {
    if (num <= 1) return false;
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) return false;
    }
    return true;
}

bool isUnique(int num, int arr[], int n) {
    for (int i = 0; i < n; i++) {
        if (arr[i] == num) return false;
    }
    return true;
}

int main() {
    int arr[] = {2, 3, 5, 7, 2, 3, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
    int n = sizeof(arr) / sizeof(arr[0]);
    int uniquePrimes[n];
    int m = 0;

    for (int i = 0; i < n; i++) {
        if (isPrime(arr[i]) && isUnique(arr[i], uniquePrimes, m)) {
            uniquePrimes[m++] = arr[i];
        }
    }

    printf("Unique prime numbers in the array are: ");
    for (int i = 0; i < m; i++) {
        printf("%d ", uniquePrimes[i]);
    }

    return 0;
}

This program works as follows:

1. It defines a helper function isPrime to check if a number is prime.
2. It defines another helper function isUnique to check if a number is unique in the array of unique primes found so far.
3. In the main function, it iterates over the input array. For each number, it checks if it is prime and unique. If it is, it adds it to the array of unique primes.
4. Finally, it prints all the unique primes found.