#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 */
typedef int /*<<< orphan*/ x;

/* Variables and functions */
int bestsum_m(int *, int, int);
int /*<<< orphan*/ printf(char *, int, int);
int main() {
  int x[] = {31, -41, 59, 26, -53, 58, 97, -93, -23, 84};
  int m;
  int n = (int)(sizeof(x) / sizeof(x[0]));
  for (m = 1; m < n - 1; m++)
    printf("[%d]\t%d\n", m, bestsum_m(x, n, m));
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x40,%rsp
movl   $0x0,-0x4(%rbp)
lea    -0x30(%rbp),%rdi
lea    0xeb6(%rip),%rsi
mov    $0x28,%edx
call   1040 <memcpy@plt>
movl   $0xa,-0x38(%rbp)
movl   $0x1,-0x34(%rbp)
mov    -0x34(%rbp),%eax
mov    -0x38(%rbp),%ecx
sub    $0x1,%ecx
cmp    %ecx,%eax
jge    11a7 <main+0x77>
mov    -0x34(%rbp),%eax
mov    %eax,-0x3c(%rbp)
lea    -0x30(%rbp),%rdi
mov    -0x38(%rbp),%esi
mov    -0x34(%rbp),%edx
call   1050 <bestsum_m@plt>
mov    -0x3c(%rbp),%esi
mov    %eax,%edx
lea    0xe94(%rip),%rdi
call   1030 <printf@plt>
mov    -0x34(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x34(%rbp)
jmp    1162 <main+0x32>
xor    %eax,%eax
add    $0x40,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %r14
push   %rbx
sub    $0x28,%rsp
mov    0xef2(%rip),%rax
mov    %rax,0x20(%rsp)
movaps 0xed6(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xeba(%rip),%xmm0
movaps %xmm0,(%rsp)
mov    %rsp,%r14
mov    %r14,%rdi
mov    $0xa,%esi
mov    $0x1,%edx
call   1040 <bestsum_m@plt>
lea    0xec2(%rip),%rbx
mov    %rbx,%rdi
mov    $0x1,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    %r14,%rdi
mov    $0xa,%esi
mov    $0x2,%edx
call   1040 <bestsum_m@plt>
mov    %rbx,%rdi
mov    $0x2,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    %r14,%rdi
mov    $0xa,%esi
mov    $0x3,%edx
call   1040 <bestsum_m@plt>
mov    %rbx,%rdi
mov    $0x3,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    %r14,%rdi
mov    $0xa,%esi
mov    $0x4,%edx
call   1040 <bestsum_m@plt>
mov    %rbx,%rdi
mov    $0x4,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    %r14,%rdi
mov    $0xa,%esi
mov    $0x5,%edx
call   1040 <bestsum_m@plt>
mov    %rbx,%rdi
mov    $0x5,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    %r14,%rdi
mov    $0xa,%esi
mov    $0x6,%edx
call   1040 <bestsum_m@plt>
mov    %rbx,%rdi
mov    $0x6,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    %r14,%rdi
mov    $0xa,%esi
mov    $0x7,%edx
call   1040 <bestsum_m@plt>
mov    %rbx,%rdi
mov    $0x7,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    %r14,%rdi
mov    $0xa,%esi
mov    $0x8,%edx
call   1040 <bestsum_m@plt>
mov    %rbx,%rdi
mov    $0x8,%esi
mov    %eax,%edx
call   1030 <printf@plt>
xor    %eax,%eax
add    $0x28,%rsp
pop    %rbx
pop    %r14
ret

LLVM IR (-O0):
@__const.main.x = [10 x i32] [i32 31, i32 -41, i32 59, i32 26, i32 -53, i32 58, i32 97, i32 -93, i32 -23, i32 84]
@.str = [9 x i8] c"[%d]\09%d\0A\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca [10 x i32]
%3 = alloca i32
%4 = alloca i32
store i32 0, i32* %1
%5 = bitcast [10 x i32]* %2 to i8*
store i32 10, i32* %4
store i32 1, i32* %3
br label %6
6: ; preds = %18, %0
%7 = load i32, i32* %3
%8 = load i32, i32* %4
%9 = sub nsw i32 %8, 1
%10 = icmp slt i32 %7, %9
br i1 %10, label %11, label %21
11: ; preds = %6
%12 = load i32, i32* %3
%13 = getelementptr inbounds [10 x i32], [10 x i32]* %2, i64 0, i64 0
%14 = load i32, i32* %4
%15 = load i32, i32* %3
%16 = call i32 @bestsum_m(i32* %13, i32 %14, i32 %15)
%17 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0), i32 %12, i32 %16)
br label %18
18: ; preds = %11
%19 = load i32, i32* %3
%20 = add nsw i32 %19, 1
store i32 %20, i32* %3
br label %6
21: ; preds = %6
ret i32 0
}

LLVM IR (-O2):
@__const.main.x = [10 x i32] [i32 31, i32 -41, i32 59, i32 26, i32 -53, i32 58, i32 97, i32 -93, i32 -23, i32 84]
@.str = [9 x i8] c"[%d]\09%d\0A\00"
define i32 @main() {
%1 = alloca [10 x i32]
%2 = bitcast [10 x i32]* %1 to i8*
%3 = getelementptr inbounds [10 x i32], [10 x i32]* %1, i64 0, i64 0
%4 = call i32 @bestsum_m(i32* %3, i32 10, i32 1)
%5 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0), i32 1, i32 %4)
%6 = call i32 @bestsum_m(i32* %3, i32 10, i32 2)
%7 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0), i32 2, i32 %6)
%8 = call i32 @bestsum_m(i32* %3, i32 10, i32 3)
%9 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0), i32 3, i32 %8)
%10 = call i32 @bestsum_m(i32* %3, i32 10, i32 4)
%11 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0), i32 4, i32 %10)
%12 = call i32 @bestsum_m(i32* %3, i32 10, i32 5)
%13 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0), i32 5, i32 %12)
%14 = call i32 @bestsum_m(i32* %3, i32 10, i32 6)
%15 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0), i32 6, i32 %14)
%16 = call i32 @bestsum_m(i32* %3, i32 10, i32 7)
%17 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0), i32 7, i32 %16)
%18 = call i32 @bestsum_m(i32* %3, i32 10, i32 8)
%19 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0), i32 8, i32 %18)
ret i32 0
}