user: 下面的汇编指令对应的C源代码是什么:

```asm
<CheckSolution>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x18,%rsp
  mov    (%rsi),%ebx
  test   %ebx,%ebx
  jne    L144
L184:
  add    $0x18,%rsp
  mov    %ebx,%eax
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
  nopl   0x0(%rax)
L144:
  mov    %rdi,%r15
  mov    %edx,%edi
  mov    %edx,%r14d
  mov    %rsi,%rbp
  call   <CreateIntMatrix@plt>
  lea    -0x1(%r14),%ebx
  mov    %rax,%r12
  test   %r14d,%r14d
  jle    L98
  mov    %r14d,%edx
  xor    %esi,%esi
  mov    %rax,%rdi
  shl    $0x2,%rdx
  mov    %rdx,0x8(%rsp)
  call   <memset@plt>
  mov    %r14d,%edi
  call   <CreateIntMatrix@plt>
  mov    0x8(%rsp),%rdx
  mov    %rax,%r13
  movslq %r14d,%rax
  shl    $0x2,%rax
  lea    (%r12,%rax,1),%rcx
  lea    0x0(%rbp,%rax,1),%rsi
  cmp    %rcx,%rbp
  setae  %cl
  cmp    %rsi,%r12
  setae  %sil
  or     %sil,%cl
  je     L119
  cmp    $0x2,%ebx
  jbe    L119
  mov    %r14d,%esi
  lea    -0x10(%rbp,%rax,1),%rcx
  mov    %r12,%rdx
  shr    $0x2,%esi
  lea    -0x10(%rcx),%rax
  lea    -0x1(%rsi),%edi
  mov    %rax,%rsi
  shl    $0x4,%rdi
  sub    %rdi,%rsi
  jmp    L111
  cs nopw 0x0(%rax,%rax,1)
L12:
  sub    $0x10,%rax
L111:
  movdqu (%rcx),%xmm0
  add    $0x10,%rdx
  mov    %rax,%rcx
  pshufd $0x1b,%xmm0,%xmm0
  movups %xmm0,-0x10(%rdx)
  cmp    %rsi,%rax
  jne    L12
  mov    %r14d,%eax
  and    $0xfffffffc,%eax
  test   $0x3,%r14b
  je     L39
  mov    %ebx,%edx
  mov    %eax,%esi
  sub    %eax,%edx
  lea    0x0(,%rsi,4),%rcx
  movslq %edx,%rdx
  mov    0x0(%rbp,%rdx,4),%edx
  mov    %edx,(%r12,%rsi,4)
  lea    0x1(%rax),%esi
  cmp    %esi,%r14d
  jle    L39
  mov    %ebx,%edx
  add    $0x2,%eax
  sub    %esi,%edx
  movslq %edx,%rdx
  mov    0x0(%rbp,%rdx,4),%edx
  mov    %edx,0x4(%r12,%rcx,1)
  cmp    %eax,%r14d
  jle    L39
  mov    %ebx,%edx
  sub    %eax,%edx
  movslq %edx,%rax
  mov    0x0(%rbp,%rax,4),%eax
  mov    %eax,0x8(%r12,%rcx,1)
L39:
  movslq %ebx,%rax
  xor    %ecx,%ecx
  jmp    L182
  nopl   0x0(%rax)
L134:
  cmp    $0x9,%edx
  jle    L141
  sub    $0xa,%edx
  mov    $0x1,%ecx
  mov    %edx,0x0(%r13,%rax,4)
  cmp    %edx,(%r15,%rax,4)
  jne    L5
L175:
  sub    $0x1,%rax
  test   %eax,%eax
  js     L196
L182:
  mov    0x0(%rbp,%rax,4),%edx
  add    (%r12,%rax,4),%edx
  cmp    $0x1,%ecx
  jne    L83
  add    $0x1,%edx
L83:
  mov    %edx,0x0(%r13,%rax,4)
  test   %eax,%eax
  jne    L134
L141:
  xor    %ecx,%ecx
  cmp    %edx,(%r15,%rax,4)
  je     L175
L5:
  xor    %ebx,%ebx
  jmp    L147
  nopl   (%rax)
L98:
  mov    %r14d,%edi
  call   <CreateIntMatrix@plt>
  mov    %rax,%r13
  test   %ebx,%ebx
  jns    L39
  nopw   0x0(%rax,%rax,1)
L196:
  mov    $0x1,%ebx
L147:
  mov    %r12,%rdi
  call   <free@plt>
  mov    %r13,%rdi
  call   <free@plt>
  jmp    L184
  nopw   0x0(%rax,%rax,1)
L119:
  lea    -0x4(%rbp,%rax,1),%rcx
  add    %r12,%rdx
  mov    %r12,%rax
  nopl   0x0(%rax,%rax,1)
L142:
  mov    (%rcx),%esi
  add    $0x4,%rax
  sub    $0x4,%rcx
  mov    %esi,-0x4(%rax)
  cmp    %rdx,%rax
  jne    L142
  jmp    L39
```

assistant: ```c
bool CheckSolution(int *Number, int *Solution, int NumberOfDigits) {
  if (Solution[0] == 0)
    return false;
  int count1 = 0, Carry = 0;
  int *Reverse = CreateIntMatrix(NumberOfDigits - count1);
  for (int counter = 0; counter < NumberOfDigits; counter++)
    Reverse[counter] = 0;
  int *PossibleNumber = CreateIntMatrix(NumberOfDigits);
  bool Valid = true;
  for (int count2 = 0; count2 < NumberOfDigits - count1; count2++) {
    Reverse[count2] = Solution[NumberOfDigits - 1 - count2 - count1];
  }
  for (int count2 = NumberOfDigits - 1; count2 >= count1; count2--) {
    PossibleNumber[count2] = Reverse[count2] + Solution[count2];
    if (Carry == 1) {
      PossibleNumber[count2] += 1;
      Carry = 0;
    }
    if (PossibleNumber[count2] >= 10 && count2 != 0) {
      PossibleNumber[count2] -= 10;
      Carry = 1;
    } else
      Carry = 0;
    if (PossibleNumber[count2] != Number[count2]) {
      Valid = false;
      break;
    }
  }
  while (count1 != 0) {
    count1--;
    PossibleNumber[count1] = Solution[count1];
    if (Carry == 1) {
      PossibleNumber[count1]++;
      Carry = 0;
    }
    if (PossibleNumber[count1] != Number[count1]) {
      Valid = false;
      break;
    }
  }
  free(Reverse);
  free(PossibleNumber);
  return Valid;
}
```