1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80
|
#include <stdio.h>
#include "simpio.h"
char C;
char A[] = {'a','b','c','d','e','f','g','h'}; /* these are set A's values */
char B[] = {'a','c','e','g'}; /* these are set B's values */
char unions();
bool intersection();
bool contain();
int main()
{
int x;
for (x=0; x<8; x++)
{
printf("%c ", A[x]);
}
for (x=0; x<8; x++)
{
printf("%c ", B[x]);
}
unions(A, B);
intersection(A, B);
contain(A, B);
return 0;
}
char unions()
{
printf("AUB=");
int x;
for (x=0; x < 10; x++)
{
if (A[x] == true || B[x] == true)
{
C == true;
printf("%c, ", C);
}
}
}
bool intersections()
{
int x, y;
y=0;
for (x=0; x<4; x++)
{
if (B[x] == A[y])
{
printf("%c, ", B[x]);
}
if (B[x] != A[y])
{
y+=1;
}
}
}
bool contain()
{
int x, y;
y=0;
while (y<4)
{
for (x=0; x<10; x++)
{
if (B[y] != A[x])
{
printf("\nFALSE");
break;
}
if (B[3]==A[x])
{
printf("%c\n", B[3]);
}
if (B[y] == A[x])
{
y+=1;
}
}
}
getchar();
}
| |