#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 */
scalar_t__ check_polynomial_comparison(char *, char *, int);
int test_polynomial_comparison() {
  int ret = 0;
  ret += check_polynomial_comparison("x^2", "x^2", 1);
  ret += check_polynomial_comparison("x^2", "x^3", 0);
  ret += check_polynomial_comparison("x^2.00", "x^2", 1);
  ret += check_polynomial_comparison("0", "0", 1);
  ret += check_polynomial_comparison("1x", "x", 1);
  ret += check_polynomial_comparison("1x^1", "x", 1);
  ret += check_polynomial_comparison("1x^0", "1", 1);
  return ret;
}


x86 assembly (clang, -O0):
<test_polynomial_comparison>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
lea    0xeda(%rip),%rsi
mov    $0x1,%edx
mov    %rsi,%rdi
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%rcx
movslq -0x4(%rbp),%rax
add    %rcx,%rax
mov    %eax,-0x4(%rbp)
lea    0xeb9(%rip),%rdi
lea    0xeb6(%rip),%rsi
xor    %edx,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%rcx
movslq -0x4(%rbp),%rax
add    %rcx,%rax
mov    %eax,-0x4(%rbp)
lea    0xe9f(%rip),%rdi
lea    0xe90(%rip),%rsi
mov    $0x1,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%rcx
movslq -0x4(%rbp),%rax
add    %rcx,%rax
mov    %eax,-0x4(%rbp)
lea    0xe7f(%rip),%rsi
mov    $0x1,%edx
mov    %rsi,%rdi
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%rcx
movslq -0x4(%rbp),%rax
add    %rcx,%rax
mov    %eax,-0x4(%rbp)
lea    0xe60(%rip),%rdi
lea    0xe5a(%rip),%rsi
mov    $0x1,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%rcx
movslq -0x4(%rbp),%rax
add    %rcx,%rax
mov    %eax,-0x4(%rbp)
lea    0xe3e(%rip),%rdi
lea    0xe35(%rip),%rsi
mov    $0x1,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%rcx
movslq -0x4(%rbp),%rax
add    %rcx,%rax
mov    %eax,-0x4(%rbp)
lea    0xe1e(%rip),%rdi
lea    0xe15(%rip),%rsi
mov    $0x1,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%rcx
movslq -0x4(%rbp),%rax
add    %rcx,%rax
mov    %eax,-0x4(%rbp)
mov    -0x4(%rbp),%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<test_polynomial_comparison>:
push   %r15
push   %r14
push   %r12
push   %rbx
push   %rax
lea    0xee1(%rip),%r14
mov    %r14,%rdi
mov    %r14,%rsi
mov    $0x1,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%r15
lea    0xecb(%rip),%rsi
mov    %r14,%rdi
xor    %edx,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%r12
add    %r15d,%r12d
lea    0xeb8(%rip),%rdi
mov    %r14,%rsi
mov    $0x1,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%rbx
add    %r12d,%ebx
lea    0xea3(%rip),%rdi
mov    %rdi,%rsi
mov    $0x1,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%r14
add    %ebx,%r14d
lea    0xe8b(%rip),%rdi
lea    0xe85(%rip),%r15
mov    %r15,%rsi
mov    $0x1,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%rbx
add    %r14d,%ebx
lea    0xe6d(%rip),%rdi
mov    %r15,%rsi
mov    $0x1,%edx
call   1030 <check_polynomial_comparison@plt>
mov    %rax,%r14
add    %ebx,%r14d
lea    0xe58(%rip),%rdi
lea    0xe4f(%rip),%rsi
mov    $0x1,%edx
call   1030 <check_polynomial_comparison@plt>
add    %r14d,%eax
add    $0x8,%rsp
pop    %rbx
pop    %r12
pop    %r14
pop    %r15
ret

LLVM IR (-O0):
@.str = [4 x i8] c"x^2\00"
@.str.1 = [4 x i8] c"x^3\00"
@.str.2 = [7 x i8] c"x^2.00\00"
@.str.3 = [2 x i8] c"0\00"
@.str.4 = [3 x i8] c"1x\00"
@.str.5 = [2 x i8] c"x\00"
@.str.6 = [5 x i8] c"1x^1\00"
@.str.7 = [5 x i8] c"1x^0\00"
@.str.8 = [2 x i8] c"1\00"
define i32 @test_polynomial_comparison() {
%1 = alloca i32
store i32 0, i32* %1
%2 = call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i32 1)
%3 = load i32, i32* %1
%4 = sext i32 %3 to i64
%5 = add nsw i64 %4, %2
%6 = trunc i64 %5 to i32
store i32 %6, i32* %1
%7 = call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.1, i64 0, i64 0), i32 0)
%8 = load i32, i32* %1
%9 = sext i32 %8 to i64
%10 = add nsw i64 %9, %7
%11 = trunc i64 %10 to i32
store i32 %11, i32* %1
%12 = call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.2, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i32 1)
%13 = load i32, i32* %1
%14 = sext i32 %13 to i64
%15 = add nsw i64 %14, %12
%16 = trunc i64 %15 to i32
store i32 %16, i32* %1
%17 = call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.3, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.3, i64 0, i64 0), i32 1)
%18 = load i32, i32* %1
%19 = sext i32 %18 to i64
%20 = add nsw i64 %19, %17
%21 = trunc i64 %20 to i32
store i32 %21, i32* %1
%22 = call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.4, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.5, i64 0, i64 0), i32 1)
%23 = load i32, i32* %1
%24 = sext i32 %23 to i64
%25 = add nsw i64 %24, %22
%26 = trunc i64 %25 to i32
store i32 %26, i32* %1
%27 = call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str.6, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.5, i64 0, i64 0), i32 1)
%28 = load i32, i32* %1
%29 = sext i32 %28 to i64
%30 = add nsw i64 %29, %27
%31 = trunc i64 %30 to i32
store i32 %31, i32* %1
%32 = call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str.7, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.8, i64 0, i64 0), i32 1)
%33 = load i32, i32* %1
%34 = sext i32 %33 to i64
%35 = add nsw i64 %34, %32
%36 = trunc i64 %35 to i32
store i32 %36, i32* %1
%37 = load i32, i32* %1
ret i32 %37
}

LLVM IR (-O2):
@.str = [4 x i8] c"x^2\00"
@.str.1 = [4 x i8] c"x^3\00"
@.str.2 = [7 x i8] c"x^2.00\00"
@.str.3 = [2 x i8] c"0\00"
@.str.4 = [3 x i8] c"1x\00"
@.str.5 = [2 x i8] c"x\00"
@.str.6 = [5 x i8] c"1x^1\00"
@.str.7 = [5 x i8] c"1x^0\00"
@.str.8 = [2 x i8] c"1\00"
define i32 @test_polynomial_comparison() {
%1 = tail call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i32 1)
%2 = tail call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.1, i64 0, i64 0), i32 0)
%3 = add i64 %2, %1
%4 = tail call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.2, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i32 1)
%5 = add i64 %3, %4
%6 = tail call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.3, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.3, i64 0, i64 0), i32 1)
%7 = add i64 %5, %6
%8 = tail call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.4, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.5, i64 0, i64 0), i32 1)
%9 = add i64 %7, %8
%10 = tail call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str.6, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.5, i64 0, i64 0), i32 1)
%11 = add i64 %9, %10
%12 = tail call i64 @check_polynomial_comparison(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str.7, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.8, i64 0, i64 0), i32 1)
%13 = add i64 %11, %12
%14 = trunc i64 %13 to i32
ret i32 %14
}