#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*/ FILE;

/* Variables and functions */
size_t CombinationRipetition(int *, size_t, size_t);
size_t CombinationSimple(int *, size_t, size_t);
size_t DispositionRipetition(int *, size_t, size_t);
size_t DispositionSimple(int *, size_t, size_t);
int EXIT_FAILURE;
size_t MultiplicationPrinciple(int **, size_t *, size_t);
size_t PartitionDispositionRipetition(int *, size_t, size_t);
size_t PartitionErAlgorithmI(int *, size_t);
size_t PartitionErAlgorithmII(int *, size_t, size_t);
size_t PermutationRipetition(int *, size_t);
size_t PermutationSimple(int *, size_t);
size_t PowerSetCombinationSimple(int *, size_t);
size_t PowerSetDispositionRipetition(int *, size_t);
size_t PowerSetDivideEtImpera(int *, size_t);
int /*<<< orphan*/ *fopen(char const *, char *);
int /*<<< orphan*/ fscanf(int /*<<< orphan*/ *, char *, ...);
scalar_t__ malloc(size_t);
int /*<<< orphan*/ printf(char *, ...);
int main(int argc, char const *argv[]) {
  size_t i, j, n, k, total;
  FILE *fp_test;
  if (argc != 2) {
    printf("Arguments error!\n");
    printf("Usage: %s <input_file>\n", argv[0]);
    return (EXIT_FAILURE);
  }
  fp_test = fopen(argv[1], "r");
  if (fp_test == NULL) {
    printf("Failed to open file \"%s\"\n", argv[1]);
    return (EXIT_FAILURE);
  }
  fscanf(fp_test, "%zu", &n);
  fscanf(fp_test, "%zu", &k);
  int *input = (int *)malloc(n * sizeof(*input));
  int **choices = (int **)malloc(n * sizeof(int *));
  size_t *num_choices = (size_t *)malloc(n * sizeof(*num_choices));
  for (i = 0; i < n; i++) {
    fscanf(fp_test, "%d", &input[i]);
    num_choices[i] = k;
    choices[i] = (int *)malloc(k * sizeof(int));
    for (j = 0; j < k; j++) {
      choices[i][j] = input[i] + j + (10 * i);
    }
  }
  printf("MultiplicationPrinciple\n");
  total = MultiplicationPrinciple(choices, num_choices, n);
  printf("Total: %zu\n\n", total);
  printf("DispositionSimple\n");
  total = DispositionSimple(input, n, k);
  printf("Total: %zu\n\n", total);
  printf("DispositionRipetition\n");
  total = DispositionRipetition(input, n, k);
  printf("Total: %zu\n\n", total);
  printf("PermutationSimple\n");
  total = PermutationSimple(input, n);
  printf("Total: %zu\n\n", total);
  printf("PermutationRipetition\n");
  total = PermutationRipetition(input, n);
  printf("Total: %zu\n\n", total);
  printf("CombinationSimple\n");
  total = CombinationSimple(input, n, k);
  printf("Total: %zu\n\n", total);
  printf("CombinationRipetition\n");
  total = CombinationRipetition(input, n, k);
  printf("Total: %zu\n\n", total);
  printf("PowerSetDivideEtImpera\n");
  total = PowerSetDivideEtImpera(input, n);
  printf("Total: %zu\n\n", total);
  printf("PowerSetDispositionRipetition\n");
  total = PowerSetDispositionRipetition(input, n);
  printf("Total: %zu\n\n", total);
  printf("PowerSetCombinationSimple\n");
  total = PowerSetCombinationSimple(input, n);
  printf("Total: %zu\n\n", total);
  printf("PartitionDispositionRipetition\n");
  total = PartitionDispositionRipetition(input, n, k);
  printf("Total: %zu\n\n", total);
  printf("PartitionErAlgorithmI\n");
  total = PartitionErAlgorithmI(input, n);
  printf("Total: %zu\n\n", total);
  printf("PartitionErAlgorithmII\n");
  total = PartitionErAlgorithmII(input, n, k);
  printf("Total: %zu\n\n", total);
  return (0);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x60,%rsp
movl   $0x0,-0x4(%rbp)
mov    %edi,-0x8(%rbp)
mov    %rsi,-0x10(%rbp)
cmpl   $0x2,-0x8(%rbp)
je     1264 <main+0x54>
lea    0xdc9(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x10(%rbp),%rax
mov    (%rax),%rsi
lea    0xdc6(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    0x2d86(%rip),%rax
mov    (%rax),%eax
mov    %eax,-0x4(%rbp)
jmp    167a <main+0x46a>
mov    -0x10(%rbp),%rax
mov    0x8(%rax),%rdi
lea    0xdb7(%rip),%rsi
call   1110 <fopen@plt>
mov    %rax,-0x40(%rbp)
cmpq   $0x0,-0x40(%rbp)
jne    12ae <main+0x9e>
mov    -0x10(%rbp),%rax
mov    0x8(%rax),%rsi
lea    0xd96(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    0x2d3c(%rip),%rax
mov    (%rax),%eax
mov    %eax,-0x4(%rbp)
jmp    167a <main+0x46a>
mov    -0x40(%rbp),%rdi
lea    0xd8d(%rip),%rsi
lea    -0x28(%rbp),%rdx
mov    $0x0,%al
call   10b0 <fscanf@plt>
mov    -0x40(%rbp),%rdi
lea    0xd77(%rip),%rsi
lea    -0x30(%rbp),%rdx
mov    $0x0,%al
call   10b0 <fscanf@plt>
mov    -0x28(%rbp),%rdi
shl    $0x2,%rdi
call   10f0 <malloc@plt>
mov    %rax,-0x48(%rbp)
mov    -0x28(%rbp),%rdi
shl    $0x3,%rdi
call   10f0 <malloc@plt>
mov    %rax,-0x50(%rbp)
mov    -0x28(%rbp),%rdi
shl    $0x3,%rdi
call   10f0 <malloc@plt>
mov    %rax,-0x58(%rbp)
movq   $0x0,-0x18(%rbp)
mov    -0x18(%rbp),%rax
cmp    -0x28(%rbp),%rax
jae    13da <main+0x1ca>
mov    -0x40(%rbp),%rdi
mov    -0x48(%rbp),%rdx
mov    -0x18(%rbp),%rax
shl    $0x2,%rax
add    %rax,%rdx
lea    0xd0d(%rip),%rsi
mov    $0x0,%al
call   10b0 <fscanf@plt>
mov    -0x30(%rbp),%rdx
mov    -0x58(%rbp),%rax
mov    -0x18(%rbp),%rcx
mov    %rdx,(%rax,%rcx,8)
mov    -0x30(%rbp),%rdi
shl    $0x2,%rdi
call   10f0 <malloc@plt>
mov    %rax,%rdx
mov    -0x50(%rbp),%rax
mov    -0x18(%rbp),%rcx
mov    %rdx,(%rax,%rcx,8)
movq   $0x0,-0x20(%rbp)
mov    -0x20(%rbp),%rax
cmp    -0x30(%rbp),%rax
jae    13c4 <main+0x1b4>
mov    -0x48(%rbp),%rax
mov    -0x18(%rbp),%rcx
movslq (%rax,%rcx,4),%rax
add    -0x20(%rbp),%rax
imul   $0xa,-0x18(%rbp),%rcx
add    %rcx,%rax
mov    %eax,%edx
mov    -0x50(%rbp),%rax
mov    -0x18(%rbp),%rcx
mov    (%rax,%rcx,8),%rax
mov    -0x20(%rbp),%rcx
mov    %edx,(%rax,%rcx,4)
mov    -0x20(%rbp),%rax
add    $0x1,%rax
mov    %rax,-0x20(%rbp)
jmp    1378 <main+0x168>
jmp    13c9 <main+0x1b9>
mov    -0x18(%rbp),%rax
add    $0x1,%rax
mov    %rax,-0x18(%rbp)
jmp    1315 <main+0x105>
lea    0xc6c(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x50(%rbp),%rdi
mov    -0x58(%rbp),%rsi
mov    -0x28(%rbp),%rdx
call   10c0 <MultiplicationPrinciple@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xc5e(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xc5d(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
mov    -0x30(%rbp),%rdx
call   1040 <DispositionSimple@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xc29(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xcd7(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
mov    -0x30(%rbp),%rdx
call   10a0 <DispositionRipetition@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xbf4(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xc06(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
call   1120 <PermutationSimple@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xbc3(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xbe8(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
call   1060 <PermutationRipetition@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xb92(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xc24(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
mov    -0x30(%rbp),%rdx
call   1080 <CombinationSimple@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xb5d(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xb99(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
mov    -0x30(%rbp),%rdx
call   10d0 <CombinationRipetition@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xb28(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xb7b(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
call   1100 <PowerSetDivideEtImpera@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xaf7(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xb62(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
call   1070 <PowerSetDispositionRipetition@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xac6(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xb50(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
call   1050 <PowerSetCombinationSimple@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xa95(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xb3a(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
mov    -0x30(%rbp),%rdx
call   1130 <PartitionDispositionRipetition@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xa60(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xb25(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
call   10e0 <PartitionErAlgorithmI@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0xa2f(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xb0b(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x48(%rbp),%rdi
mov    -0x28(%rbp),%rsi
mov    -0x30(%rbp),%rdx
call   1030 <PartitionErAlgorithmII@plt>
mov    %rax,-0x38(%rbp)
mov    -0x38(%rbp),%rsi
lea    0x9fa(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
movl   $0x0,-0x4(%rbp)
mov    -0x4(%rbp),%eax
add    $0x60,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbp
push   %r15
push   %r14
push   %r13
push   %r12
push   %rbx
sub    $0x28,%rsp
mov    %rsi,%rbx
cmp    $0x2,%edi
jne    148c <main+0x26c>
mov    0x8(%rbx),%rdi
lea    0xe03(%rip),%rsi
call   1120 <fopen@plt>
test   %rax,%rax
je     16c5 <main+0x4a5>
mov    %rax,%rbp
lea    0xe07(%rip),%rbx
lea    0x8(%rsp),%rdx
mov    %rax,%rdi
mov    %rbx,%rsi
xor    %eax,%eax
call   10c0 <fscanf@plt>
lea    0x10(%rsp),%rdx
mov    %rbp,%rdi
mov    %rbx,%rsi
xor    %eax,%eax
call   10c0 <fscanf@plt>
mov    0x8(%rsp),%rdi
shl    $0x2,%rdi
call   1100 <malloc@plt>
mov    %rax,%r13
mov    0x8(%rsp),%rdi
shl    $0x3,%rdi
call   1100 <malloc@plt>
mov    %rax,0x20(%rsp)
mov    0x8(%rsp),%rdi
shl    $0x3,%rdi
call   1100 <malloc@plt>
mov    %rax,0x18(%rsp)
cmpq   $0x0,0x8(%rsp)
je     14a7 <main+0x287>
xor    %r12d,%r12d
xor    %r14d,%r14d
jmp    12e6 <main+0xc6>
nopl   0x0(%rax)
add    $0x1,%r14
add    $0xa,%r12d
cmp    0x8(%rsp),%r14
mov    %r15,%rbp
jae    14a7 <main+0x287>
lea    0x0(,%r14,4),%rbx
add    %r13,%rbx
mov    %rbp,%r15
mov    %rbp,%rdi
lea    0xd6a(%rip),%rsi
mov    %rbx,%rdx
xor    %eax,%eax
call   10c0 <fscanf@plt>
mov    0x10(%rsp),%rax
mov    0x18(%rsp),%rcx
mov    %rax,(%rcx,%r14,8)
mov    0x10(%rsp),%rdi
shl    $0x2,%rdi
call   1100 <malloc@plt>
movdqa 0xcf3(%rip),%xmm8
mov    0x20(%rsp),%rcx
mov    %rax,(%rcx,%r14,8)
mov    0x10(%rsp),%rcx
test   %rcx,%rcx
je     12d0 <main+0xb0>
cmp    $0x8,%rcx
jb     1367 <main+0x147>
lea    0x4(,%r14,4),%rdx
add    %r13,%rdx
cmp    %rdx,%rax
jae    13e8 <main+0x1c8>
lea    (%rax,%rcx,4),%rdx
cmp    %rdx,%rbx
jae    13e8 <main+0x1c8>
xor    %edx,%edx
mov    %rdx,%r8
not    %r8
add    %rcx,%r8
mov    %rcx,%rdi
and    $0x3,%rdi
je     1394 <main+0x174>
lea    (%r12,%rdx,1),%ebp
nop
mov    (%rbx),%esi
add    %ebp,%esi
mov    %esi,(%rax,%rdx,4)
add    $0x1,%rdx
add    $0x1,%ebp
add    $0xffffffffffffffff,%rdi
jne    1380 <main+0x160>
cmp    $0x3,%r8
jb     12d0 <main+0xb0>
sub    %rdx,%rcx
lea    (%rax,%rdx,4),%rax
add    $0xc,%rax
add    %r12d,%edx
xor    %esi,%esi
xchg   %ax,%ax
lea    (%rdx,%rsi,1),%edi
mov    %edi,%ebp
add    (%rbx),%ebp
mov    %ebp,-0xc(%rax,%rsi,4)
mov    (%rbx),%ebp
add    %edi,%ebp
add    $0x1,%ebp
mov    %ebp,-0x8(%rax,%rsi,4)
mov    (%rbx),%ebp
lea    0x2(%rbp,%rdi,1),%ebp
mov    %ebp,-0x4(%rax,%rsi,4)
mov    (%rbx),%ebp
add    %ebp,%edi
add    $0x3,%edi
mov    %edi,(%rax,%rsi,4)
add    $0x4,%rsi
cmp    %rsi,%rcx
jne    13b0 <main+0x190>
jmp    12d0 <main+0xb0>
lea    (%r14,%r14,1),%rdx
lea    (%rdx,%rdx,4),%rsi
mov    %rcx,%rdx
and    $0xfffffffffffffff8,%rdx
movq   %rsi,%xmm0
pshufd $0x44,%xmm0,%xmm0
movd   (%rbx),%xmm1
pshufd $0x0,%xmm1,%xmm1
add    $0x4,%rsi
movq   %rsi,%xmm2
pshufd $0x44,%xmm2,%xmm2
xor    %esi,%esi
movdqa 0xbee(%rip),%xmm3
movdqa 0xbd6(%rip),%xmm4
nopw   0x0(%rax,%rax,1)
movdqa %xmm3,%xmm5
paddq  %xmm0,%xmm5
movdqa %xmm4,%xmm6
paddq  %xmm0,%xmm6
shufps $0x88,%xmm6,%xmm5
movdqa %xmm2,%xmm6
paddq  %xmm3,%xmm6
movdqa %xmm2,%xmm7
paddq  %xmm4,%xmm7
shufps $0x88,%xmm7,%xmm6
paddd  %xmm1,%xmm5
paddd  %xmm1,%xmm6
movdqu %xmm5,(%rax,%rsi,4)
movdqu %xmm6,0x10(%rax,%rsi,4)
add    $0x8,%rsi
paddq  %xmm8,%xmm3
paddq  %xmm8,%xmm4
cmp    %rsi,%rdx
jne    1430 <main+0x210>
cmp    %rdx,%rcx
je     12d0 <main+0xb0>
jmp    1369 <main+0x149>
lea    0xce8(%rip),%rdi
call   1050 <puts@plt>
mov    (%rbx),%rsi
lea    0xb8e(%rip),%rdi
jmp    16d0 <main+0x4b0>
lea    0xbca(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rdx
mov    0x20(%rsp),%rdi
mov    0x18(%rsp),%rsi
call   10d0 <MultiplicationPrinciple@plt>
lea    0xb9d(%rip),%rbx
xor    %ebp,%ebp
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xbac(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    0x10(%rsp),%rdx
mov    %r13,%rdi
call   1040 <DispositionSimple@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xc29(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    0x10(%rsp),%rdx
mov    %r13,%rdi
call   10b0 <DispositionRipetition@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xb68(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    %r13,%rdi
call   1130 <PermutationSimple@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xb54(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    %r13,%rdi
call   1070 <PermutationRipetition@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xb97(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    0x10(%rsp),%rdx
mov    %r13,%rdi
call   1090 <CombinationSimple@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xb19(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    0x10(%rsp),%rdx
mov    %r13,%rdi
call   10e0 <CombinationRipetition@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xb04(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    %r13,%rdi
call   1110 <PowerSetDivideEtImpera@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xaf5(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    %r13,%rdi
call   1080 <PowerSetDispositionRipetition@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xaed(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    %r13,%rdi
call   1060 <PowerSetCombinationSimple@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xae1(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    0x10(%rsp),%rdx
mov    %r13,%rdi
call   1140 <PartitionDispositionRipetition@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xad5(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    %r13,%rdi
call   10f0 <PartitionErAlgorithmI@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
lea    0xac5(%rip),%rdi
call   1050 <puts@plt>
mov    0x8(%rsp),%rsi
mov    0x10(%rsp),%rdx
mov    %r13,%rdi
call   1030 <PartitionErAlgorithmII@plt>
mov    %rbx,%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   10a0 <printf@plt>
jmp    16e0 <main+0x4c0>
mov    0x8(%rbx),%rsi
lea    0x97a(%rip),%rdi
xor    %eax,%eax
call   10a0 <printf@plt>
mov    0x2902(%rip),%rax
mov    (%rax),%ebp
mov    %ebp,%eax
add    $0x28,%rsp
pop    %rbx
pop    %r12
pop    %r13
pop    %r14
pop    %r15
pop    %rbp
ret

LLVM IR (-O0):
@.str = [18 x i8] c"Arguments error!\0A\00"
@.str.1 = [24 x i8] c"Usage: %s <input_file>\0A\00"
@EXIT_FAILURE = global i32 0
@.str.2 = [2 x i8] c"r\00"
@.str.3 = [26 x i8] c"Failed to open file \22%s\22\0A\00"
@.str.4 = [4 x i8] c"%zu\00"
@.str.5 = [3 x i8] c"%d\00"
@.str.6 = [25 x i8] c"MultiplicationPrinciple\0A\00"
@.str.7 = [13 x i8] c"Total: %zu\0A\0A\00"
@.str.8 = [19 x i8] c"DispositionSimple\0A\00"
@.str.9 = [23 x i8] c"DispositionRipetition\0A\00"
@.str.10 = [19 x i8] c"PermutationSimple\0A\00"
@.str.11 = [23 x i8] c"PermutationRipetition\0A\00"
@.str.12 = [19 x i8] c"CombinationSimple\0A\00"
@.str.13 = [23 x i8] c"CombinationRipetition\0A\00"
@.str.14 = [24 x i8] c"PowerSetDivideEtImpera\0A\00"
@.str.15 = [31 x i8] c"PowerSetDispositionRipetition\0A\00"
@.str.16 = [27 x i8] c"PowerSetCombinationSimple\0A\00"
@.str.17 = [32 x i8] c"PartitionDispositionRipetition\0A\00"
@.str.18 = [23 x i8] c"PartitionErAlgorithmI\0A\00"
@.str.19 = [24 x i8] c"PartitionErAlgorithmII\0A\00"
define i32 @main(i32 %0, i8** %1) {
%3 = alloca i32
%4 = alloca i32
%5 = alloca i8**
%6 = alloca i64
%7 = alloca i64
%8 = alloca i64
%9 = alloca i64
%10 = alloca i64
%11 = alloca i32*
%12 = alloca i32*
%13 = alloca i32**
%14 = alloca i64*
store i32 0, i32* %3
store i32 %0, i32* %4
store i8** %1, i8*** %5
%15 = load i32, i32* %4
%16 = icmp ne i32 %15, 2
br i1 %16, label %17, label %24
17: ; preds = %2
%18 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0))
%19 = load i8**, i8*** %5
%20 = getelementptr inbounds i8*, i8** %19, i64 0
%21 = load i8*, i8** %20
%22 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.1, i64 0, i64 0), i8* %21)
%23 = load i32, i32* @EXIT_FAILURE
store i32 %23, i32* %3
br label %190
24: ; preds = %2
%25 = load i8**, i8*** %5
%26 = getelementptr inbounds i8*, i8** %25, i64 1
%27 = load i8*, i8** %26
%28 = call i32* @fopen(i8* %27, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
store i32* %28, i32** %11
%29 = load i32*, i32** %11
%30 = icmp eq i32* %29, null
br i1 %30, label %31, label %37
31: ; preds = %24
%32 = load i8**, i8*** %5
%33 = getelementptr inbounds i8*, i8** %32, i64 1
%34 = load i8*, i8** %33
%35 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.3, i64 0, i64 0), i8* %34)
%36 = load i32, i32* @EXIT_FAILURE
store i32 %36, i32* %3
br label %190
37: ; preds = %24
%38 = load i32*, i32** %11
%39 = call i32 (i32*, i8*, ...) @fscanf(i32* %38, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.4, i64 0, i64 0), i64* %8)
%40 = load i32*, i32** %11
%41 = call i32 (i32*, i8*, ...) @fscanf(i32* %40, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.4, i64 0, i64 0), i64* %9)
%42 = load i64, i64* %8
%43 = mul i64 %42, 4
%44 = call i64 @malloc(i64 %43)
%45 = inttoptr i64 %44 to i32*
store i32* %45, i32** %12
%46 = load i64, i64* %8
%47 = mul i64 %46, 8
%48 = call i64 @malloc(i64 %47)
%49 = inttoptr i64 %48 to i32**
store i32** %49, i32*** %13
%50 = load i64, i64* %8
%51 = mul i64 %50, 8
%52 = call i64 @malloc(i64 %51)
%53 = inttoptr i64 %52 to i64*
store i64* %53, i64** %14
store i64 0, i64* %6
br label %54
54: ; preds = %101, %37
%55 = load i64, i64* %6
%56 = load i64, i64* %8
%57 = icmp ult i64 %55, %56
br i1 %57, label %58, label %104
58: ; preds = %54
%59 = load i32*, i32** %11
%60 = load i32*, i32** %12
%61 = load i64, i64* %6
%62 = getelementptr inbounds i32, i32* %60, i64 %61
%63 = call i32 (i32*, i8*, ...) @fscanf(i32* %59, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.5, i64 0, i64 0), i32* %62)
%64 = load i64, i64* %9
%65 = load i64*, i64** %14
%66 = load i64, i64* %6
%67 = getelementptr inbounds i64, i64* %65, i64 %66
store i64 %64, i64* %67
%68 = load i64, i64* %9
%69 = mul i64 %68, 4
%70 = call i64 @malloc(i64 %69)
%71 = inttoptr i64 %70 to i32*
%72 = load i32**, i32*** %13
%73 = load i64, i64* %6
%74 = getelementptr inbounds i32*, i32** %72, i64 %73
store i32* %71, i32** %74
store i64 0, i64* %7
br label %75
75: ; preds = %97, %58
%76 = load i64, i64* %7
%77 = load i64, i64* %9
%78 = icmp ult i64 %76, %77
br i1 %78, label %79, label %100
79: ; preds = %75
%80 = load i32*, i32** %12
%81 = load i64, i64* %6
%82 = getelementptr inbounds i32, i32* %80, i64 %81
%83 = load i32, i32* %82
%84 = sext i32 %83 to i64
%85 = load i64, i64* %7
%86 = add i64 %84, %85
%87 = load i64, i64* %6
%88 = mul i64 10, %87
%89 = add i64 %86, %88
%90 = trunc i64 %89 to i32
%91 = load i32**, i32*** %13
%92 = load i64, i64* %6
%93 = getelementptr inbounds i32*, i32** %91, i64 %92
%94 = load i32*, i32** %93
%95 = load i64, i64* %7
%96 = getelementptr inbounds i32, i32* %94, i64 %95
store i32 %90, i32* %96
br label %97
97: ; preds = %79
%98 = load i64, i64* %7
%99 = add i64 %98, 1
store i64 %99, i64* %7
br label %75
100: ; preds = %75
br label %101
101: ; preds = %100
%102 = load i64, i64* %6
%103 = add i64 %102, 1
store i64 %103, i64* %6
br label %54
104: ; preds = %54
%105 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.6, i64 0, i64 0))
%106 = load i32**, i32*** %13
%107 = load i64*, i64** %14
%108 = load i64, i64* %8
%109 = call i64 @MultiplicationPrinciple(i32** %106, i64* %107, i64 %108)
store i64 %109, i64* %10
%110 = load i64, i64* %10
%111 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %110)
%112 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.8, i64 0, i64 0))
%113 = load i32*, i32** %12
%114 = load i64, i64* %8
%115 = load i64, i64* %9
%116 = call i64 @DispositionSimple(i32* %113, i64 %114, i64 %115)
store i64 %116, i64* %10
%117 = load i64, i64* %10
%118 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %117)
%119 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.9, i64 0, i64 0))
%120 = load i32*, i32** %12
%121 = load i64, i64* %8
%122 = load i64, i64* %9
%123 = call i64 @DispositionRipetition(i32* %120, i64 %121, i64 %122)
store i64 %123, i64* %10
%124 = load i64, i64* %10
%125 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %124)
%126 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.10, i64 0, i64 0))
%127 = load i32*, i32** %12
%128 = load i64, i64* %8
%129 = call i64 @PermutationSimple(i32* %127, i64 %128)
store i64 %129, i64* %10
%130 = load i64, i64* %10
%131 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %130)
%132 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.11, i64 0, i64 0))
%133 = load i32*, i32** %12
%134 = load i64, i64* %8
%135 = call i64 @PermutationRipetition(i32* %133, i64 %134)
store i64 %135, i64* %10
%136 = load i64, i64* %10
%137 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %136)
%138 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.12, i64 0, i64 0))
%139 = load i32*, i32** %12
%140 = load i64, i64* %8
%141 = load i64, i64* %9
%142 = call i64 @CombinationSimple(i32* %139, i64 %140, i64 %141)
store i64 %142, i64* %10
%143 = load i64, i64* %10
%144 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %143)
%145 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.13, i64 0, i64 0))
%146 = load i32*, i32** %12
%147 = load i64, i64* %8
%148 = load i64, i64* %9
%149 = call i64 @CombinationRipetition(i32* %146, i64 %147, i64 %148)
store i64 %149, i64* %10
%150 = load i64, i64* %10
%151 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %150)
%152 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.14, i64 0, i64 0))
%153 = load i32*, i32** %12
%154 = load i64, i64* %8
%155 = call i64 @PowerSetDivideEtImpera(i32* %153, i64 %154)
store i64 %155, i64* %10
%156 = load i64, i64* %10
%157 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %156)
%158 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.15, i64 0, i64 0))
%159 = load i32*, i32** %12
%160 = load i64, i64* %8
%161 = call i64 @PowerSetDispositionRipetition(i32* %159, i64 %160)
store i64 %161, i64* %10
%162 = load i64, i64* %10
%163 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %162)
%164 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.16, i64 0, i64 0))
%165 = load i32*, i32** %12
%166 = load i64, i64* %8
%167 = call i64 @PowerSetCombinationSimple(i32* %165, i64 %166)
store i64 %167, i64* %10
%168 = load i64, i64* %10
%169 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %168)
%170 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.17, i64 0, i64 0))
%171 = load i32*, i32** %12
%172 = load i64, i64* %8
%173 = load i64, i64* %9
%174 = call i64 @PartitionDispositionRipetition(i32* %171, i64 %172, i64 %173)
store i64 %174, i64* %10
%175 = load i64, i64* %10
%176 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %175)
%177 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.18, i64 0, i64 0))
%178 = load i32*, i32** %12
%179 = load i64, i64* %8
%180 = call i64 @PartitionErAlgorithmI(i32* %178, i64 %179)
store i64 %180, i64* %10
%181 = load i64, i64* %10
%182 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %181)
%183 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.19, i64 0, i64 0))
%184 = load i32*, i32** %12
%185 = load i64, i64* %8
%186 = load i64, i64* %9
%187 = call i64 @PartitionErAlgorithmII(i32* %184, i64 %185, i64 %186)
store i64 %187, i64* %10
%188 = load i64, i64* %10
%189 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %188)
store i32 0, i32* %3
br label %190
190: ; preds = %104, %31, %17
%191 = load i32, i32* %3
ret i32 %191
}

LLVM IR (-O2):
@.str.1 = [24 x i8] c"Usage: %s <input_file>\0A\00"
@EXIT_FAILURE = global i32 0
@.str.2 = [2 x i8] c"r\00"
@.str.3 = [26 x i8] c"Failed to open file \22%s\22\0A\00"
@.str.4 = [4 x i8] c"%zu\00"
@.str.5 = [3 x i8] c"%d\00"
@.str.7 = [13 x i8] c"Total: %zu\0A\0A\00"
@str = [24 x i8] c"MultiplicationPrinciple\00"
@str.20 = [18 x i8] c"DispositionSimple\00"
@str.21 = [22 x i8] c"DispositionRipetition\00"
@str.22 = [18 x i8] c"PermutationSimple\00"
@str.23 = [22 x i8] c"PermutationRipetition\00"
@str.24 = [18 x i8] c"CombinationSimple\00"
@str.25 = [22 x i8] c"CombinationRipetition\00"
@str.26 = [23 x i8] c"PowerSetDivideEtImpera\00"
@str.27 = [30 x i8] c"PowerSetDispositionRipetition\00"
@str.28 = [26 x i8] c"PowerSetCombinationSimple\00"
@str.29 = [31 x i8] c"PartitionDispositionRipetition\00"
@str.30 = [22 x i8] c"PartitionErAlgorithmI\00"
@str.31 = [23 x i8] c"PartitionErAlgorithmII\00"
@str.32 = [17 x i8] c"Arguments error!\00"
define i32 @main(i32 %0, i8** nocapture %1) {
%3 = alloca i64
%4 = alloca i64
%5 = bitcast i64* %3 to i8*
%6 = bitcast i64* %4 to i8*
%7 = icmp eq i32 %0, 2
br i1 %7, label %13, label %8
8: ; preds = %2
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([17 x i8], [17 x i8]* @str.32, i64 0, i64 0))
%10 = load i8*, i8** %1
%11 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @.str.1, i64 0, i64 0), i8* %10)
%12 = load i32, i32* @EXIT_FAILURE
br label %205
13: ; preds = %2
%14 = getelementptr inbounds i8*, i8** %1, i64 1
%15 = load i8*, i8** %14
%16 = tail call i32* @fopen(i8* %15, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%17 = icmp eq i32* %16, null
br i1 %17, label %18, label %22
18: ; preds = %13
%19 = load i8*, i8** %14
%20 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @.str.3, i64 0, i64 0), i8* %19)
%21 = load i32, i32* @EXIT_FAILURE
br label %205
22: ; preds = %13
%23 = call i32 (i32*, i8*, ...) @fscanf(i32* %16, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.4, i64 0, i64 0), i64* %3)
%24 = call i32 (i32*, i8*, ...) @fscanf(i32* %16, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.4, i64 0, i64 0), i64* %4)
%25 = load i64, i64* %3
%26 = shl i64 %25, 2
%27 = call i64 @malloc(i64 %26)
%28 = inttoptr i64 %27 to i32*
%29 = load i64, i64* %3
%30 = shl i64 %29, 3
%31 = call i64 @malloc(i64 %30)
%32 = inttoptr i64 %31 to i32**
%33 = load i64, i64* %3
%34 = shl i64 %33, 3
%35 = call i64 @malloc(i64 %34)
%36 = inttoptr i64 %35 to i64*
%37 = load i64, i64* %3
%38 = icmp eq i64 %37, 0
br i1 %38, label %146, label %39
39: ; preds = %22, %142
%40 = phi i64 [ %143, %142 ], [ 0, %22 ]
%41 = getelementptr i32, i32* %28, i64 %40
%42 = add i64 %40, 1
%43 = getelementptr i32, i32* %28, i64 %42
%44 = bitcast i32* %43 to i8*
%45 = getelementptr inbounds i32, i32* %28, i64 %40
%46 = call i32 (i32*, i8*, ...) @fscanf(i32* %16, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.5, i64 0, i64 0), i32* %45)
%47 = load i64, i64* %4
%48 = getelementptr inbounds i64, i64* %36, i64 %40
store i64 %47, i64* %48
%49 = load i64, i64* %4
%50 = shl i64 %49, 2
%51 = call i64 @malloc(i64 %50)
%52 = inttoptr i64 %51 to i32*
%53 = inttoptr i64 %51 to i8*
%54 = getelementptr inbounds i32*, i32** %32, i64 %40
store i32* %52, i32** %54
%55 = load i64, i64* %4
%56 = icmp eq i64 %55, 0
br i1 %56, label %142, label %57
57: ; preds = %39
%58 = mul i64 %40, 10
%59 = icmp ult i64 %55, 8
br i1 %59, label %95, label %60
60: ; preds = %57
%61 = getelementptr i32, i32* %52, i64 %55
%62 = icmp ult i8* %53, %44
%63 = icmp ult i32* %41, %61
%64 = and i1 %62, %63
br i1 %64, label %95, label %65
65: ; preds = %60
%66 = and i64 %55, -8
%67 = insertelement <4 x i64> poison, i64 %58, i64 0
%68 = shufflevector <4 x i64> %67, <4 x i64> poison, <4 x i32> zeroinitializer
%69 = load i32, i32* %45
%70 = insertelement <4 x i32> poison, i32 %69, i64 0
%71 = shufflevector <4 x i32> %70, <4 x i32> poison, <4 x i32> zeroinitializer
%72 = insertelement <4 x i32> poison, i32 %69, i64 0
%73 = shufflevector <4 x i32> %72, <4 x i32> poison, <4 x i32> zeroinitializer
%74 = add i64 %58, 4
%75 = insertelement <4 x i64> poison, i64 %74, i64 0
%76 = shufflevector <4 x i64> %75, <4 x i64> poison, <4 x i32> zeroinitializer
br label %77
77: ; preds = %77, %65
%78 = phi i64 [ 0, %65 ], [ %90, %77 ]
%79 = phi <4 x i64> [ <i64 0, i64 1, i64 2, i64 3>, %65 ], [ %91, %77 ]
%80 = add <4 x i64> %79, %68
%81 = add <4 x i64> %76, %79
%82 = trunc <4 x i64> %80 to <4 x i32>
%83 = trunc <4 x i64> %81 to <4 x i32>
%84 = add <4 x i32> %71, %82
%85 = add <4 x i32> %73, %83
%86 = getelementptr inbounds i32, i32* %52, i64 %78
%87 = bitcast i32* %86 to <4 x i32>*
store <4 x i32> %84, <4 x i32>* %87
%88 = getelementptr inbounds i32, i32* %86, i64 4
%89 = bitcast i32* %88 to <4 x i32>*
store <4 x i32> %85, <4 x i32>* %89
%90 = add nuw i64 %78, 8
%91 = add <4 x i64> %79, <i64 8, i64 8, i64 8, i64 8>
%92 = icmp eq i64 %90, %66
br i1 %92, label %93, label %77
93: ; preds = %77
%94 = icmp eq i64 %55, %66
br i1 %94, label %142, label %95
95: ; preds = %60, %57, %93
%96 = phi i64 [ 0, %60 ], [ 0, %57 ], [ %66, %93 ]
%97 = xor i64 %96, -1
%98 = add i64 %55, %97
%99 = and i64 %55, 3
%100 = icmp eq i64 %99, 0
br i1 %100, label %112, label %101
101: ; preds = %95, %101
%102 = phi i64 [ %109, %101 ], [ %96, %95 ]
%103 = phi i64 [ %110, %101 ], [ 0, %95 ]
%104 = load i32, i32* %45
%105 = add i64 %102, %58
%106 = trunc i64 %105 to i32
%107 = add i32 %104, %106
%108 = getelementptr inbounds i32, i32* %52, i64 %102
store i32 %107, i32* %108
%109 = add nuw i64 %102, 1
%110 = add i64 %103, 1
%111 = icmp eq i64 %110, %99
br i1 %111, label %112, label %101
112: ; preds = %101, %95
%113 = phi i64 [ %96, %95 ], [ %109, %101 ]
%114 = icmp ult i64 %98, 3
br i1 %114, label %142, label %115
115: ; preds = %112, %115
%116 = phi i64 [ %140, %115 ], [ %113, %112 ]
%117 = load i32, i32* %45
%118 = add i64 %116, %58
%119 = trunc i64 %118 to i32
%120 = add i32 %117, %119
%121 = getelementptr inbounds i32, i32* %52, i64 %116
store i32 %120, i32* %121
%122 = add nuw i64 %116, 1
%123 = load i32, i32* %45
%124 = add i64 %122, %58
%125 = trunc i64 %124 to i32
%126 = add i32 %123, %125
%127 = getelementptr inbounds i32, i32* %52, i64 %122
store i32 %126, i32* %127
%128 = add nuw i64 %116, 2
%129 = load i32, i32* %45
%130 = add i64 %128, %58
%131 = trunc i64 %130 to i32
%132 = add i32 %129, %131
%133 = getelementptr inbounds i32, i32* %52, i64 %128
store i32 %132, i32* %133
%134 = add nuw i64 %116, 3
%135 = load i32, i32* %45
%136 = add i64 %134, %58
%137 = trunc i64 %136 to i32
%138 = add i32 %135, %137
%139 = getelementptr inbounds i32, i32* %52, i64 %134
store i32 %138, i32* %139
%140 = add nuw i64 %116, 4
%141 = icmp eq i64 %140, %55
br i1 %141, label %142, label %115
142: ; preds = %112, %115, %93, %39
%143 = add nuw i64 %40, 1
%144 = load i64, i64* %3
%145 = icmp ult i64 %143, %144
br i1 %145, label %39, label %146
146: ; preds = %142, %22
%147 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str, i64 0, i64 0))
%148 = load i64, i64* %3
%149 = call i64 @MultiplicationPrinciple(i32** %32, i64* %36, i64 %148)
%150 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %149)
%151 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.20, i64 0, i64 0))
%152 = load i64, i64* %3
%153 = load i64, i64* %4
%154 = call i64 @DispositionSimple(i32* %28, i64 %152, i64 %153)
%155 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %154)
%156 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str.21, i64 0, i64 0))
%157 = load i64, i64* %3
%158 = load i64, i64* %4
%159 = call i64 @DispositionRipetition(i32* %28, i64 %157, i64 %158)
%160 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %159)
%161 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.22, i64 0, i64 0))
%162 = load i64, i64* %3
%163 = call i64 @PermutationSimple(i32* %28, i64 %162)
%164 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %163)
%165 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str.23, i64 0, i64 0))
%166 = load i64, i64* %3
%167 = call i64 @PermutationRipetition(i32* %28, i64 %166)
%168 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %167)
%169 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.24, i64 0, i64 0))
%170 = load i64, i64* %3
%171 = load i64, i64* %4
%172 = call i64 @CombinationSimple(i32* %28, i64 %170, i64 %171)
%173 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %172)
%174 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str.25, i64 0, i64 0))
%175 = load i64, i64* %3
%176 = load i64, i64* %4
%177 = call i64 @CombinationRipetition(i32* %28, i64 %175, i64 %176)
%178 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %177)
%179 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([23 x i8], [23 x i8]* @str.26, i64 0, i64 0))
%180 = load i64, i64* %3
%181 = call i64 @PowerSetDivideEtImpera(i32* %28, i64 %180)
%182 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %181)
%183 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str.27, i64 0, i64 0))
%184 = load i64, i64* %3
%185 = call i64 @PowerSetDispositionRipetition(i32* %28, i64 %184)
%186 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %185)
%187 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.28, i64 0, i64 0))
%188 = load i64, i64* %3
%189 = call i64 @PowerSetCombinationSimple(i32* %28, i64 %188)
%190 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %189)
%191 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @str.29, i64 0, i64 0))
%192 = load i64, i64* %3
%193 = load i64, i64* %4
%194 = call i64 @PartitionDispositionRipetition(i32* %28, i64 %192, i64 %193)
%195 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %194)
%196 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str.30, i64 0, i64 0))
%197 = load i64, i64* %3
%198 = call i64 @PartitionErAlgorithmI(i32* %28, i64 %197)
%199 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %198)
%200 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([23 x i8], [23 x i8]* @str.31, i64 0, i64 0))
%201 = load i64, i64* %3
%202 = load i64, i64* %4
%203 = call i64 @PartitionErAlgorithmII(i32* %28, i64 %201, i64 %202)
%204 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0), i64 %203)
br label %205
205: ; preds = %146, %18, %8
%206 = phi i32 [ %12, %8 ], [ %21, %18 ], [ 0, %146 ]
ret i32 %206
}