Алгоритм по Дискретной математике!!!!!

...................................
[FONT=Times New Roman][SIZE=3]int i,j;[/SIZE][/FONT]
[COLOR=seagreen]//заполня вспомагательный массив arrA_[/COLOR]
[FONT=Times New Roman][SIZE=3]for( i = 0; i < N; i++)[/SIZE][/FONT]
[FONT=Times New Roman][SIZE=3]{[/SIZE][/FONT]
[SIZE=3][FONT=Times New Roman]for(j = 0; j < N_A; j++)[/FONT][/SIZE]
[SIZE=3][FONT=Times New Roman]    if(arrU == arrA[j])[/FONT][/SIZE]
[SIZE=3][FONT=Times New Roman]     {[/FONT][/SIZE]
[SIZE=3][FONT=Times New Roman]           arrA_ = 1;[/FONT][/SIZE]
[SIZE=3][FONT=Times New Roman]            break;[/FONT][/SIZE]
[SIZE=3][FONT=Times New Roman]       }[/FONT][/SIZE]
[FONT=Times New Roman][SIZE=3]}[/SIZE][/FONT]
[FONT=Times New Roman][SIZE=3][COLOR=seagreen]//заполня вспомагательный массив arrB_[/COLOR]
[COLOR=#2e8b57]     ..................................[/COLOR]
 
[COLOR=#2e8b57]//объединяем множества A и B[/COLOR]
 
[COLOR=#2e8b57][COLOR=black]int *arrUnion = new[/COLOR] [/COLOR][COLOR=black]int[N_A+N_B];[/COLOR]
int j = 0;
[/SIZE][/FONT][FONT=Times New Roman][SIZE=3]for(i = 0; i < N; i++)[/SIZE][/FONT]
[SIZE=3][FONT=Times New Roman]if( arrA_ [COLOR=blue]||[/COLOR] arrB_ )  arrUnion[j++] = arrU;[/FONT][/SIZE]

#include <iostream>
 
using namespace std;

void initMaskArr(int *, int *, int , int *);
void printTotal(int *, int *, char *);
void unifyArrays(int *, int *, int *);
void intersection(int *, int *, int *);
void reverse(int *, int *);
 
#define N_U 7
#define N_A 4
#define N_B 2
 
int main()
{
 int U[] = {1,2,3,4,5,6,7};
 int mask_u[N_U] = {1};
 int A[] = {2,4,6,7};
 int B[] = {4,6};
 int mask_a[N_U] = {0}, mask_b[N_U] = {0};
 int arrUnion[N_U] = {0}, arrInter[N_U] = {0}, revA[N_U] = {0}, revB[N_U] = {0};
 
 initMaskArr(mask_a, A, N_A, U);
 initMaskArr(mask_b, B, N_B, U);
 
 unifyArrays(mask_a, mask_b, arrUnion);
 intersection(mask_a, mask_b,arrInter);
 reverse(mask_a, revA);
 reverse(mask_b, revB);
 
 printTotal(arrUnion, U, "Total of union is: ");
 printTotal(arrInter, U, "Total of intersection is: ");
 printTotal(revA, U, "Dopolnenie of A is: ");
 printTotal(revB, U, "Dopolnenie of B is: ");
 return 0;
}
void initMaskArr(int *mask, int *arr, int size_arr, int *arrU)
{
 for(int i = 0; i < size_arr; i++)
  for(int j = i; j < N_U; j++)
   if(arr == arrU[j])
   {
    mask[j] = 1;
    break;
   }
}
void printTotal(int *mask, int *arr_U, char *message)
{
 cout << message;
 for(int i = 0; i < N_U; i++)
  if( mask )
   cout << arr_U;
 cout << endl;
}
void unifyArrays(int *maskA, int *maskB, int *total)
{
 for(int i = 0; i < N_U; i++)
  if(maskA || maskB)
   total = 1;
}
void intersection(int *maskA, int *maskB, int *total)
{
 for(int i = 0; i < N_U; i++)
  if(maskA && maskB)
   total = 1;
}
void reverse(int *mask, int *total)
{
 for(int i = 0; i < N_U; i++)
  total = !mask;
}