user: 请将这段汇编代码片段转换成等效的C代码:

```asm
<main>:
  endbr64
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  lea    -0x9000(%rsp),%r11
L85:
  sub    $0x1000,%rsp
  orq    $0x0,(%rsp)
  cmp    %r11,%rsp
  jne    L85
  sub    $0xdf0,%rsp
  lea    D35(%rip),%rdi
  lea    D13(%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    D10(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    0xc(%rsp),%rsi
  mov    %r13,%rdi
  call   <scanf@plt>
  lea    D5(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  mov    0x4(%rsp),%r9d
  test   %r9d,%r9d
  jle    L149
  xor    %r12d,%r12d
  xor    %ebx,%ebx
  lea    0x1a0(%rsp),%r14
  nopl   0x0(%rax,%rax,1)
L0:
  movl   $0x0,0x8(%rsp)
  test   %r9d,%r9d
  jle    L137
  movslq %ebx,%rdx
  xor    %eax,%eax
  lea    (%rdx,%rdx,4),%rdx
  lea    (%rdx,%rdx,4),%rbp
  shl    $0x2,%rbp
  nopw   0x0(%rax,%rax,1)
L58:
  cltq
  mov    %r13,%rdi
  add    %r12,%rax
  lea    (%r14,%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
  test   %esi,%esi
  jne    L146
  cmp    %ebx,%ecx
  je     L146
  movl   $0x270f,0x1a0(%rsp,%rdx,4)
L146:
  mov    0xc(%rsp),%edi
  lea    -0x1(%rdi),%edx
  cmp    %ebx,%edx
  jne    L43
  lea    0x0(%rbp,%rcx,1),%rdx
  mov    0x1a0(%rsp,%rdx,4),%edx
  mov    %edx,0x10(%rsp,%rcx,4)
L43:
  mov    0x4(%rsp),%r9d
  add    $0x1,%eax
  mov    %eax,0x8(%rsp)
  cmp    %r9d,%eax
  jl     L58
  add    $0x1,%ebx
  add    $0x64,%r12
  cmp    %ebx,%r9d
  jg     L0
L137:
  cmp    $0x1,%r9d
  jle    L149
  mov    0xc(%rsp),%eax
  lea    0x10(%rsp),%rbp
  mov    $0x1,%r12d
  lea    0x1a0(%rsp),%r14
  lea    -0x1(%rax),%ebx
  lea    -0x1(%r9),%eax
  lea    0x14(%rsp,%rax,4),%r10
  nopl   0x0(%rax)
L145:
  mov    %r14,%r11
  mov    %rbp,%rdi
  xor    %r8d,%r8d
  jmp    L101
  nopl   0x0(%rax,%rax,1)
L8:
  add    $0x1,%r8d
  add    $0x4,%rdi
  add    $0x4,%r11
  cmp    %r8d,%r9d
  je     L34
L101:
  cmp    %r8d,%ebx
  je     L8
  mov    (%rdi),%ecx
  mov    %r11,%rsi
  mov    %rbp,%rdx
  cs nopw 0x0(%rax,%rax,1)
L68:
  mov    (%rsi),%eax
  add    (%rdx),%eax
  cmp    %eax,%ecx
  cmovg  %eax,%ecx
  add    $0x4,%rdx
  add    $0x190,%rsi
  mov    %ecx,(%rdi)
  cmp    %r10,%rdx
  jne    L68
  jmp    L8
  nopl   (%rax)
L34:
  add    $0x1,%r12d
  cmp    %r9d,%r12d
  jne    L145
  mov    %r12d,0x8(%rsp)
L149:
  lea    D11(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    0x8(%rsp),%rsi
  mov    %r13,%rdi
  call   <scanf@plt>
  mov    0x8(%rsp),%eax
  lea    D48(%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    L153
  add    $0x9df0,%rsp
  xor    %eax,%eax
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  ret
L153:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: extract_symbolic_data
arguments: tag: D35
type_guessed: string
name: extract_symbolic_data
arguments: tag: D13
type_guessed: string
name: extract_symbolic_data
arguments: tag: D10
type_guessed: string
name: extract_symbolic_data
arguments: tag: D5
type_guessed: string
name: extract_symbolic_data
arguments: tag: D11
type_guessed: string
name: extract_symbolic_data
arguments: tag: D48
type_guessed: string

tool: D35: 
Enter the no. of vertices 

tool: D13: %d

tool: D10: 
Enter the source vertex 

tool: D5: 
Enter the cost matrix 

tool: D11: 
Enter the final vertex 

tool: D48: 
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;
}
```