#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*/ findTotalDistinctPrimeFactors(int /*<<< orphan*/);
scalar_t__ isPrime(int /*<<< orphan*/);
int /*<<< orphan*/ lcm(int, int);
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ scanf(char *, int *, int *);
void main() {
  int a, b;
  int div = 1;
  printf("Enter Number a and b \n");
  scanf("%d %d", &a, &b);
  if (isPrime(findTotalDistinctPrimeFactors(lcm(a, b)))) {
    printf("Yes\n");
  } else {
    printf("No \n");
  }
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x1,-0xc(%rbp)
lea    0xe9a(%rip),%rdi
call   1040 <printf@plt>
lea    0xea5(%rip),%rdi
lea    -0x4(%rbp),%rsi
lea    -0x8(%rbp),%rdx
call   1070 <scanf@plt>
mov    -0x4(%rbp),%edi
mov    -0x8(%rbp),%esi
call   1050 <lcm@plt>
mov    %eax,%edi
call   1030 <findTotalDistinctPrimeFactors@plt>
mov    %eax,%edi
call   1060 <isPrime@plt>
cmp    $0x0,%rax
je     11b3 <main+0x63>
lea    0xe74(%rip),%rdi
call   1040 <printf@plt>
jmp    11bf <main+0x6f>
lea    0xe68(%rip),%rdi
call   1040 <printf@plt>
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
lea    0xeae(%rip),%rdi
call   1030 <puts@plt>
lea    0xe9c(%rip),%rdi
lea    0x4(%rsp),%rsi
mov    %rsp,%rdx
call   1070 <scanf@plt>
mov    0x4(%rsp),%edi
mov    (%rsp),%esi
call   1050 <lcm@plt>
mov    %eax,%edi
call   1040 <findTotalDistinctPrimeFactors@plt>
mov    %eax,%edi
call   1060 <isPrime@plt>
test   %rax,%rax
lea    0xe87(%rip),%rax
lea    0xe84(%rip),%rdi
cmove  %rax,%rdi
call   1030 <puts@plt>
pop    %rax
ret

LLVM IR (-O0):
@.str = [23 x i8] c"Enter Number a and b \0A\00"
@.str.1 = [6 x i8] c"%d %d\00"
@.str.2 = [5 x i8] c"Yes\0A\00"
@.str.3 = [5 x i8] c"No \0A\00"
define void @main() {
%1 = alloca i32
%2 = alloca i32
%3 = alloca i32
store i32 1, i32* %3
%4 = call i32 @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str, i64 0, i64 0))
%5 = call i32 @scanf(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.1, i64 0, i64 0), i32* %1, i32* %2)
%6 = load i32, i32* %1
%7 = load i32, i32* %2
%8 = call i32 @lcm(i32 %6, i32 %7)
%9 = call i32 @findTotalDistinctPrimeFactors(i32 %8)
%10 = call i64 @isPrime(i32 %9)
%11 = icmp ne i64 %10, 0
br i1 %11, label %12, label %14
12: ; preds = %0
%13 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str.2, i64 0, i64 0))
br label %16
14: ; preds = %0
%15 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str.3, i64 0, i64 0))
br label %16
16: ; preds = %14, %12
ret void
}

LLVM IR (-O2):
@.str.1 = [6 x i8] c"%d %d\00"
@str = [22 x i8] c"Enter Number a and b \00"
@str.4 = [4 x i8] c"No \00"
@str.5 = [4 x i8] c"Yes\00"
define void @main() {
%1 = alloca i32
%2 = alloca i32
%3 = bitcast i32* %1 to i8*
%4 = bitcast i32* %2 to i8*
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str, i64 0, i64 0))
%6 = call i32 @scanf(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.1, i64 0, i64 0), i32* %1, i32* %2)
%7 = load i32, i32* %1
%8 = load i32, i32* %2
%9 = call i32 @lcm(i32 %7, i32 %8)
%10 = call i32 @findTotalDistinctPrimeFactors(i32 %9)
%11 = call i64 @isPrime(i32 %10)
%12 = icmp eq i64 %11, 0
%13 = select i1 %12, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @str.4, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8], [4 x i8]* @str.5, i64 0, i64 0)
%14 = call i32 @puts(i8* dereferenceable(1) %13)
ret void
}