#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*/ printf(char *);
int /*<<< orphan*/ recursiveTowerOfHanoi(int, char, char, char);
int /*<<< orphan*/ scanf(char *, int *);
int main() {
  int numberOfDisks;
  printf("Tower of Hanoi \n");
  printf("\n");
  printf(
      "S = Source tower \nI = Intermediate tower \nD = Destination tower \n");
  printf("\n");
  printf("Total Disks in Source tower = ");
  scanf("%d", &numberOfDisks);
  printf("\n");
  printf("Solution (with minimum number of moves): \n");
  printf("\n");
  recursiveTowerOfHanoi(numberOfDisks, 'S', 'D', 'I');
  printf("\n");
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
lea    0xeba(%rip),%rdi
call   1030 <printf@plt>
lea    0xf4c(%rip),%rdi
call   1030 <printf@plt>
lea    0xeb3(%rip),%rdi
call   1030 <printf@plt>
lea    0xf34(%rip),%rdi
call   1030 <printf@plt>
lea    0xedd(%rip),%rdi
call   1030 <printf@plt>
lea    0xef0(%rip),%rdi
lea    -0x8(%rbp),%rsi
call   1050 <scanf@plt>
lea    0xf0c(%rip),%rdi
call   1030 <printf@plt>
lea    0xed7(%rip),%rdi
call   1030 <printf@plt>
lea    0xef4(%rip),%rdi
call   1030 <printf@plt>
mov    -0x8(%rbp),%edi
mov    $0x53,%esi
mov    $0x44,%edx
mov    $0x49,%ecx
call   1040 <recursiveTowerOfHanoi@plt>
lea    0xed1(%rip),%rdi
call   1030 <printf@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
lea    0xeca(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xec4(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xe7c(%rip),%rdi
call   1050 <printf@plt>
lea    0xe8f(%rip),%rdi
lea    0x4(%rsp),%rsi
call   1070 <scanf@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xec8(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
mov    0x4(%rsp),%edi
mov    $0x53,%esi
mov    $0x44,%edx
mov    $0x49,%ecx
call   1060 <recursiveTowerOfHanoi@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
@.str = [17 x i8] c"Tower of Hanoi \0A\00"
@.str.1 = [2 x i8] c"\0A\00"
@.str.2 = [66 x i8] c"S = Source tower \0AI = Intermediate tower \0AD = Destination tower \0A\00"
@.str.3 = [31 x i8] c"Total Disks in Source tower = \00"
@.str.4 = [3 x i8] c"%d\00"
@.str.5 = [43 x i8] c"Solution (with minimum number of moves): \0A\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca i32
store i32 0, i32* %1
%3 = call i32 @printf(i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.2, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.3, i64 0, i64 0))
%8 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.4, i64 0, i64 0), i32* %2)
%9 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.5, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%12 = load i32, i32* %2
%13 = call i32 @recursiveTowerOfHanoi(i32 %12, i8 signext 83, i8 signext 68, i8 signext 73)
%14 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
ret i32 0
}

LLVM IR (-O2):
@.str.3 = [31 x i8] c"Total Disks in Source tower = \00"
@.str.4 = [3 x i8] c"%d\00"
@str = [16 x i8] c"Tower of Hanoi \00"
@str.6 = [65 x i8] c"S = Source tower \0AI = Intermediate tower \0AD = Destination tower \00"
@str.7 = [42 x i8] c"Solution (with minimum number of moves): \00"
define i32 @main() {
%1 = alloca i32
%2 = bitcast i32* %1 to i8*
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([16 x i8], [16 x i8]* @str, i64 0, i64 0))
%4 = tail call i32 @putchar(i32 10)
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.6, i64 0, i64 0))
%6 = tail call i32 @putchar(i32 10)
%7 = tail call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @.str.3, i64 0, i64 0))
%8 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.4, i64 0, i64 0), i32* %1)
%9 = call i32 @putchar(i32 10)
%10 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([42 x i8], [42 x i8]* @str.7, i64 0, i64 0))
%11 = call i32 @putchar(i32 10)
%12 = load i32, i32* %1
%13 = call i32 @recursiveTowerOfHanoi(i32 %12, i8 signext 83, i8 signext 68, i8 signext 73)
%14 = call i32 @putchar(i32 10)
ret i32 0
}