#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
int /*<<< orphan*/ findIfSubset(int *, int *, int, int);
int /*<<< orphan*/ findIntersection(int *, int, int *, int);
int /*<<< orphan*/ findUnion(int *, int, int *, int);
int /*<<< orphan*/ printPowerSet(int *, int);
int /*<<< orphan*/ printSet(int *, int);
int readInput(int *);
int removeDuplicates(int *, int);
int /*<<< orphan*/ sort(int *, int);
int main() {
  int set1[100], set2[100], len1, len2;
  len1 = readInput(set1);
  len2 = readInput(set2);
  printSet(set2, len2);
  sort(set1, len1);
  sort(set2, len2);
  len1 = removeDuplicates(set1, len1);
  len2 = removeDuplicates(set2, len2);
  findUnion(set1, len1, set2, len2);
  findIntersection(set1, len1, set2, len2);
  findIfSubset(set1, set2, len1, len2);
  printPowerSet(set1, len1);
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x340,%rsp
movl   $0x0,-0x4(%rbp)
lea    -0x1a0(%rbp),%rdi
call   1070 <readInput@plt>
mov    %eax,-0x334(%rbp)
lea    -0x330(%rbp),%rdi
call   1070 <readInput@plt>
mov    %eax,-0x338(%rbp)
lea    -0x330(%rbp),%rdi
mov    -0x338(%rbp),%esi
call   10a0 <printSet@plt>
lea    -0x1a0(%rbp),%rdi
mov    -0x334(%rbp),%esi
call   1030 <sort@plt>
lea    -0x330(%rbp),%rdi
mov    -0x338(%rbp),%esi
call   1030 <sort@plt>
lea    -0x1a0(%rbp),%rdi
mov    -0x334(%rbp),%esi
call   1050 <removeDuplicates@plt>
mov    %eax,-0x334(%rbp)
lea    -0x330(%rbp),%rdi
mov    -0x338(%rbp),%esi
call   1050 <removeDuplicates@plt>
mov    %eax,-0x338(%rbp)
lea    -0x1a0(%rbp),%rdi
mov    -0x334(%rbp),%esi
lea    -0x330(%rbp),%rdx
mov    -0x338(%rbp),%ecx
call   1040 <findUnion@plt>
lea    -0x1a0(%rbp),%rdi
mov    -0x334(%rbp),%esi
lea    -0x330(%rbp),%rdx
mov    -0x338(%rbp),%ecx
call   1090 <findIntersection@plt>
lea    -0x1a0(%rbp),%rdi
lea    -0x330(%rbp),%rsi
mov    -0x334(%rbp),%edx
mov    -0x338(%rbp),%ecx
call   1080 <findIfSubset@plt>
lea    -0x1a0(%rbp),%rdi
mov    -0x334(%rbp),%esi
call   1060 <printPowerSet@plt>
xor    %eax,%eax
add    $0x340,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbp
push   %r15
push   %r14
push   %rbx
sub    $0x328,%rsp
lea    0x190(%rsp),%r14
mov    %r14,%rdi
call   1070 <readInput@plt>
mov    %eax,%ebp
mov    %rsp,%r15
mov    %r15,%rdi
call   1070 <readInput@plt>
mov    %eax,%ebx
mov    %r15,%rdi
mov    %eax,%esi
call   10a0 <printSet@plt>
mov    %r14,%rdi
mov    %ebp,%esi
call   1030 <sort@plt>
mov    %r15,%rdi
mov    %ebx,%esi
call   1030 <sort@plt>
mov    %r14,%rdi
mov    %ebp,%esi
call   1050 <removeDuplicates@plt>
mov    %eax,%ebp
mov    %r15,%rdi
mov    %ebx,%esi
call   1050 <removeDuplicates@plt>
mov    %eax,%ebx
mov    %r14,%rdi
mov    %ebp,%esi
mov    %r15,%rdx
mov    %eax,%ecx
call   1040 <findUnion@plt>
mov    %r14,%rdi
mov    %ebp,%esi
mov    %r15,%rdx
mov    %ebx,%ecx
call   1090 <findIntersection@plt>
mov    %r14,%rdi
mov    %r15,%rsi
mov    %ebp,%edx
mov    %ebx,%ecx
call   1080 <findIfSubset@plt>
mov    %r14,%rdi
mov    %ebp,%esi
call   1060 <printPowerSet@plt>
xor    %eax,%eax
add    $0x328,%rsp
pop    %rbx
pop    %r14
pop    %r15
pop    %rbp
ret

LLVM IR (-O0):
define i32 @main() {
%1 = alloca i32
%2 = alloca [100 x i32]
%3 = alloca [100 x i32]
%4 = alloca i32
%5 = alloca i32
store i32 0, i32* %1
%6 = getelementptr inbounds [100 x i32], [100 x i32]* %2, i64 0, i64 0
%7 = call i32 @readInput(i32* %6)
store i32 %7, i32* %4
%8 = getelementptr inbounds [100 x i32], [100 x i32]* %3, i64 0, i64 0
%9 = call i32 @readInput(i32* %8)
store i32 %9, i32* %5
%10 = getelementptr inbounds [100 x i32], [100 x i32]* %3, i64 0, i64 0
%11 = load i32, i32* %5
%12 = call i32 @printSet(i32* %10, i32 %11)
%13 = getelementptr inbounds [100 x i32], [100 x i32]* %2, i64 0, i64 0
%14 = load i32, i32* %4
%15 = call i32 @sort(i32* %13, i32 %14)
%16 = getelementptr inbounds [100 x i32], [100 x i32]* %3, i64 0, i64 0
%17 = load i32, i32* %5
%18 = call i32 @sort(i32* %16, i32 %17)
%19 = getelementptr inbounds [100 x i32], [100 x i32]* %2, i64 0, i64 0
%20 = load i32, i32* %4
%21 = call i32 @removeDuplicates(i32* %19, i32 %20)
store i32 %21, i32* %4
%22 = getelementptr inbounds [100 x i32], [100 x i32]* %3, i64 0, i64 0
%23 = load i32, i32* %5
%24 = call i32 @removeDuplicates(i32* %22, i32 %23)
store i32 %24, i32* %5
%25 = getelementptr inbounds [100 x i32], [100 x i32]* %2, i64 0, i64 0
%26 = load i32, i32* %4
%27 = getelementptr inbounds [100 x i32], [100 x i32]* %3, i64 0, i64 0
%28 = load i32, i32* %5
%29 = call i32 @findUnion(i32* %25, i32 %26, i32* %27, i32 %28)
%30 = getelementptr inbounds [100 x i32], [100 x i32]* %2, i64 0, i64 0
%31 = load i32, i32* %4
%32 = getelementptr inbounds [100 x i32], [100 x i32]* %3, i64 0, i64 0
%33 = load i32, i32* %5
%34 = call i32 @findIntersection(i32* %30, i32 %31, i32* %32, i32 %33)
%35 = getelementptr inbounds [100 x i32], [100 x i32]* %2, i64 0, i64 0
%36 = getelementptr inbounds [100 x i32], [100 x i32]* %3, i64 0, i64 0
%37 = load i32, i32* %4
%38 = load i32, i32* %5
%39 = call i32 @findIfSubset(i32* %35, i32* %36, i32 %37, i32 %38)
%40 = getelementptr inbounds [100 x i32], [100 x i32]* %2, i64 0, i64 0
%41 = load i32, i32* %4
%42 = call i32 @printPowerSet(i32* %40, i32 %41)
ret i32 0
}

LLVM IR (-O2):
define i32 @main() {
%1 = alloca [100 x i32]
%2 = alloca [100 x i32]
%3 = bitcast [100 x i32]* %1 to i8*
%4 = bitcast [100 x i32]* %2 to i8*
%5 = getelementptr inbounds [100 x i32], [100 x i32]* %1, i64 0, i64 0
%6 = call i32 @readInput(i32* %5)
%7 = getelementptr inbounds [100 x i32], [100 x i32]* %2, i64 0, i64 0
%8 = call i32 @readInput(i32* %7)
%9 = call i32 @printSet(i32* %7, i32 %8)
%10 = call i32 @sort(i32* %5, i32 %6)
%11 = call i32 @sort(i32* %7, i32 %8)
%12 = call i32 @removeDuplicates(i32* %5, i32 %6)
%13 = call i32 @removeDuplicates(i32* %7, i32 %8)
%14 = call i32 @findUnion(i32* %5, i32 %12, i32* %7, i32 %13)
%15 = call i32 @findIntersection(i32* %5, i32 %12, i32* %7, i32 %13)
%16 = call i32 @findIfSubset(i32* %5, i32* %7, i32 %12, i32 %13)
%17 = call i32 @printPowerSet(i32* %5, i32 %12)
ret i32 0
}