user: What would the C source look like for the assembly code provided here?

```asm
<main>:
  endbr64
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  lea    -0x9000(%rsp),%r11
L123:
  sub    $0x1000,%rsp
  orq    $0x0,(%rsp)
  cmp    %r11,%rsp
  jne    L123
  sub    $0xdf0,%rsp
  lea    D24(%rip),%rdi
  lea    D37(%rip),%r13
  mov    %fs:0x28,%rax
  mov    %rax,0x9de8(%rsp)
  xor    %eax,%eax
  call   <printf@plt>
  lea    0x4(%rsp),%rsi
  mov    %r13,%rdi
  call   <scanf@plt>
  lea    D49(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    0xc(%rsp),%rsi
  mov    %r13,%rdi
  call   <scanf@plt>
  lea    D40(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  mov    0x4(%rsp),%r10d
  test   %r10d,%r10d
  jle    L188
  movl   $0x0,0x8(%rsp)
  xor    %r12d,%r12d
  xor    %r14d,%r14d
  lea    0x1a0(%rsp),%rbx
  test   %r10d,%r10d
  jle    L188
  nopl   (%rax)
L100:
  movslq %r14d,%rdx
  xor    %eax,%eax
  lea    (%rdx,%rdx,4),%rdx
  lea    (%rdx,%rdx,4),%rbp
  shl    $0x2,%rbp
  nopl   0x0(%rax)
L66:
  cltq
  mov    %r13,%rdi
  add    %r12,%rax
  lea    (%rbx,%rax,4),%rsi
  call   <scanf@plt>
  movslq 0x8(%rsp),%rcx
  lea    0x0(%rbp,%rcx,1),%rdx
  mov    %rcx,%rax
  mov    0x1a0(%rsp,%rdx,4),%esi
  cmp    %r14d,%ecx
  je     L144
  test   %esi,%esi
  jne    L144
  movl   $0x270f,0x1a0(%rsp,%rdx,4)
  mov    $0x270f,%esi
L144:
  mov    0xc(%rsp),%edx
  lea    -0x1(%rdx),%edi
  cmp    %r14d,%edi
  je     L168
  mov    0x4(%rsp),%r10d
  add    $0x1,%eax
  mov    %eax,0x8(%rsp)
  cmp    %r10d,%eax
  jl     L66
  add    $0x1,%r14d
  cmp    %r10d,%r14d
  jge    L167
L63:
  movl   $0x0,0x8(%rsp)
  add    $0x64,%r12
  test   %r10d,%r10d
  jg     L100
L188:
  lea    D54(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    0x8(%rsp),%rsi
  mov    %r13,%rdi
  call   <scanf@plt>
  mov    0x8(%rsp),%eax
  lea    D0(%rip),%rdi
  sub    $0x1,%eax
  cltq
  mov    0x10(%rsp,%rax,4),%esi
  xor    %eax,%eax
  call   <printf@plt>
  mov    0x9de8(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L52
  add    $0x9df0,%rsp
  xor    %eax,%eax
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  ret
L168:
  mov    0x4(%rsp),%r10d
  add    $0x1,%eax
  mov    %esi,0x10(%rsp,%rcx,4)
  mov    %eax,0x8(%rsp)
  cmp    %eax,%r10d
  jg     L66
  add    $0x1,%r14d
  cmp    %r10d,%r14d
  jl     L63
L167:
  cmp    $0x1,%r10d
  jle    L188
  lea    -0x1(%r10),%eax
  lea    -0x1(%rdx),%r11d
  mov    $0x1,%r14d
  lea    0x10(%rsp),%r12
  lea    0x14(%rsp,%rax,4),%r9
  nopl   0x0(%rax,%rax,1)
L95:
  mov    %rbx,%rbp
  mov    %r12,%rdi
  xor    %r8d,%r8d
  jmp    L87
  nopl   0x0(%rax,%rax,1)
L54:
  add    $0x1,%r8d
  add    $0x4,%rdi
  add    $0x4,%rbp
  cmp    %r8d,%r10d
  je     L174
L87:
  cmp    %r8d,%r11d
  je     L54
  mov    (%rdi),%ecx
  mov    %rbp,%rsi
  mov    %r12,%rdx
  xchg   %ax,%ax
L76:
  mov    (%rsi),%eax
  add    (%rdx),%eax
  cmp    %eax,%ecx
  cmovg  %eax,%ecx
  add    $0x4,%rdx
  add    $0x190,%rsi
  mov    %ecx,(%rdi)
  cmp    %r9,%rdx
  jne    L76
  jmp    L54
  nopl   (%rax)
L174:
  add    $0x1,%r14d
  cmp    %r10d,%r14d
  jne    L95
  mov    %r14d,0x8(%rsp)
  jmp    L188
L52:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: disassemble_data
arguments: tag: D24
type_guessed: string
name: disassemble_data
arguments: tag: D37
type_guessed: string
name: disassemble_data
arguments: tag: D49
type_guessed: string
name: disassemble_data
arguments: tag: D40
type_guessed: string
name: disassemble_data
arguments: tag: D54
type_guessed: string
name: disassemble_data
arguments: tag: D0
type_guessed: string

tool: D24: 
Enter the no. of vertices 

tool: D37: %d

tool: D49: 
Enter the source vertex 

tool: D40: 
Enter the cost matrix 

tool: D54: 
Enter the final vertex 

tool: D0: 
The shortest distance is %d 

assistant: ```c
int main() {
  int n, i, j, a[100][100], dist[100], src, min, k;
  printf("\nEnter the no. of vertices ");
  scanf("%d", &n);
  printf("\nEnter the source vertex ");
  scanf("%d", &src);
  printf("\nEnter the cost matrix ");
  for (i = 0; i < n; i++)
    for (j = 0; j < n; j++) {
      scanf("%d", &a[i][j]);
      if (a[i][j] == 0 && i != j)
        a[i][j] = 9999;
      if (i == (src - 1))
        dist[j] = a[i][j];
    }
  for (i = 1; i < n; i++) {
    for (j = 0; j < n; j++) {
      if (j != (src - 1)) {
        for (k = 0; k < n; k++) {
          if ((a[j][k] != 9999 || a[j][k] != 0) && dist[j] > dist[k] + a[k][j])
            dist[j] = dist[k] + a[k][j];
        }
      }
    }
  }
  printf("\nEnter the final vertex ");
  scanf("%d", &j);
  printf("\nThe shortest distance is %d ", dist[j - 1]);
  return 0;
}
```