#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*/ exit(int /*<<< orphan*/);
int /*<<< orphan*/ findsolution();
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ scanf(char *, char *);
void call_findsolution() {
  char ques;
  while (1) {
    printf("\n\nDo u want another solution if exists (y/Y | _ ) : ");
    scanf("%c", &ques);
    if (ques == 'y' || ques == 'Y')
      findsolution();
    else
      exit(0);
  }
}


x86 assembly (clang, -O0):
<call_findsolution>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
lea    0xeb1(%rip),%rdi
call   1030 <printf@plt>
lea    0xeda(%rip),%rdi
lea    -0x1(%rbp),%rsi
call   1050 <scanf@plt>
movsbl -0x1(%rbp),%eax
cmp    $0x79,%eax
je     117e <call_findsolution+0x3e>
movsbl -0x1(%rbp),%eax
cmp    $0x59,%eax
jne    118a <call_findsolution+0x4a>
mov    $0x0,%al
call   1040 <findsolution@plt>
jmp    1191 <call_findsolution+0x51>
xor    %edi,%edi
call   1060 <exit@plt>
jmp    1148 <call_findsolution+0x8>

x86 assembly (clang, -O2):
<call_findsolution>:
push   %r15
push   %r14
push   %rbx
sub    $0x10,%rsp
lea    0xeb0(%rip),%rdi
call   1030 <printf@plt>
lea    0xed9(%rip),%rdi
lea    0xf(%rsp),%rsi
call   1050 <scanf@plt>
mov    0xf(%rsp),%al
and    $0xdf,%al
cmp    $0x59,%al
jne    11b5 <call_findsolution+0x75>
lea    0xe89(%rip),%r14
lea    0xeb7(%rip),%r15
lea    0xf(%rsp),%rbx
cs nopw 0x0(%rax,%rax,1)
nopl   (%rax)
xor    %eax,%eax
call   1040 <findsolution@plt>
mov    %r14,%rdi
call   1030 <printf@plt>
mov    %r15,%rdi
mov    %rbx,%rsi
call   1050 <scanf@plt>
movzbl 0xf(%rsp),%eax
and    $0xdf,%al
cmp    $0x59,%al
je     1190 <call_findsolution+0x50>
xor    %edi,%edi
call   1060 <exit@plt>

LLVM IR (-O0):
@.str = [53 x i8] c"\0A\0ADo u want another solution if exists (y/Y | _ ) : \00"
@.str.1 = [3 x i8] c"%c\00"
define void @call_findsolution() {
%1 = alloca i8
br label %2
2: ; preds = %0, %16
%3 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str, i64 0, i64 0))
%4 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i8* %1)
%5 = load i8, i8* %1
%6 = sext i8 %5 to i32
%7 = icmp eq i32 %6, 121
br i1 %7, label %12, label %8
8: ; preds = %2
%9 = load i8, i8* %1
%10 = sext i8 %9 to i32
%11 = icmp eq i32 %10, 89
br i1 %11, label %12, label %14
12: ; preds = %8, %2
%13 = call i32 (...) @findsolution()
br label %16
14: ; preds = %8
%15 = call i32 @exit(i32 0)
unreachable
16: ; preds = %12
br label %2
}

LLVM IR (-O2):
@.str = [53 x i8] c"\0A\0ADo u want another solution if exists (y/Y | _ ) : \00"
@.str.1 = [3 x i8] c"%c\00"
define void @call_findsolution() {
%1 = alloca i8
%2 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([53 x i8], [53 x i8]* @.str, i64 0, i64 0))
%3 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i8* %1)
%4 = load i8, i8* %1
%5 = and i8 %4, -33
%6 = icmp eq i8 %5, 89
br i1 %6, label %7, label %14
7: ; preds = %0, %7
%8 = call i32 (...) @findsolution()
%9 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([53 x i8], [53 x i8]* @.str, i64 0, i64 0))
%10 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i8* %1)
%11 = load i8, i8* %1
%12 = and i8 %11, -33
%13 = icmp eq i8 %12, 89
br i1 %13, label %7, label %14
14: ; preds = %7, %0
%15 = call i32 @exit(i32 0)
unreachable
}