#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);
int Problem018() {
  int tree[] = {75, 95, 64, 17, 47, 82, 18, 35, 87, 10, 20, 4,  82, 47, 65,
                19, 1,  23, 75, 3,  34, 88, 2,  77, 73, 7,  63, 67, 99, 65,
                4,  28, 6,  16, 70, 92, 41, 41, 26, 56, 83, 40, 80, 70, 33,
                41, 48, 72, 33, 47, 32, 37, 16, 94, 29, 53, 71, 44, 65, 25,
                43, 91, 52, 97, 51, 14, 70, 11, 33, 28, 77, 73, 17, 78, 39,
                68, 17, 57, 91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29,
                48, 63, 66, 4,  68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31,
                4,  62, 98, 27, 23, 9,  70, 98, 73, 93, 38, 53, 60, 4,  23};
  int max[120];
  int row;
  int row_start;
  int row_end;
  int a, b;
  int i;
  row = 0;
  row_start = 0;
  row_end = 0;
  i = 0;
  return 1;
  max[0] = tree[0];
  ++row;
  while (row < 15) {
    row_start = row_end + 1;
    row_end = row_start + row;
    max[row_start] = tree[row_start] + max[row_start - row];
    max[row_end] = tree[row_end] + max[row_start - 1];
    for (i = 1; i < row; ++i) {
      a = tree[i] + max[i - row];
      b = tree[i] + max[i + 1 - row];
      max[i] = (a > b) ? a : b;
    }
    ++row;
  }
  for (i = 104; i < 120; ++i) {
    b = max[i];
    a = (a > b) ? a : b;
  }
  printf("%30d", a);
  return 0;
}


x86 assembly (clang, -O0):
<Problem018>:
push   %rbp
mov    %rsp,%rbp
sub    $0x3e0,%rsp
lea    -0x1e0(%rbp),%rdi
lea    0xed7(%rip),%rsi
mov    $0x1e0,%edx
call   1030 <memcpy@plt>
movl   $0x0,-0x3c4(%rbp)
movl   $0x0,-0x3c8(%rbp)
movl   $0x0,-0x3cc(%rbp)
movl   $0x0,-0x3d8(%rbp)
mov    $0x1,%eax
add    $0x3e0,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<Problem018>:
mov    $0x1,%eax
ret

LLVM IR (-O0):
@__const.Problem018.tree = [120 x i32] [i32 75, i32 95, i32 64, i32 17, i32 47, i32 82, i32 18, i32 35, i32 87, i32 10, i32 20, i32 4, i32 82, i32 47, i32 65, i32 19, i32 1, i32 23, i32 75, i32 3, i32 34, i32 88, i32 2, i32 77, i32 73, i32 7, i32 63, i32 67, i32 99, i32 65, i32 4, i32 28, i32 6, i32 16, i32 70, i32 92, i32 41, i32 41, i32 26, i32 56, i32 83, i32 40, i32 80, i32 70, i32 33, i32 41, i32 48, i32 72, i32 33, i32 47, i32 32, i32 37, i32 16, i32 94, i32 29, i32 53, i32 71, i32 44, i32 65, i32 25, i32 43, i32 91, i32 52, i32 97, i32 51, i32 14, i32 70, i32 11, i32 33, i32 28, i32 77, i32 73, i32 17, i32 78, i32 39, i32 68, i32 17, i32 57, i32 91, i32 71, i32 52, i32 38, i32 17, i32 14, i32 91, i32 43, i32 58, i32 50, i32 27, i32 29, i32 48, i32 63, i32 66, i32 4, i32 68, i32 89, i32 53, i32 67, i32 30, i32 73, i32 16, i32 69, i32 87, i32 40, i32 31, i32 4, i32 62, i32 98, i32 27, i32 23, i32 9, i32 70, i32 98, i32 73, i32 93, i32 38, i32 53, i32 60, i32 4, i32 23]
define i32 @Problem018() {
%1 = alloca [120 x i32]
%2 = alloca [120 x i32]
%3 = alloca i32
%4 = alloca i32
%5 = alloca i32
%6 = alloca i32
%7 = alloca i32
%8 = alloca i32
%9 = bitcast [120 x i32]* %1 to i8*
store i32 0, i32* %3
store i32 0, i32* %4
store i32 0, i32* %5
store i32 0, i32* %8
ret i32 1
}

LLVM IR (-O2):
define i32 @Problem018() {
ret i32 1
}