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

```asm
<main>:
  endbr64
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  lea    -0x9000(%rsp),%r11
L206:
  sub    $0x1000,%rsp
  orq    $0x0,(%rsp)
  cmp    %r11,%rsp
  jne    L206
  sub    $0xf88,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,0x9f78(%rsp)
  xor    %eax,%eax
  lea    0x1a0(%rsp),%rdi
  mov    $0x32,%ecx
  rep stos %rax,%es:(%rdi)
  lea    D61(%rip),%rdi
  call   <printf@plt>
  lea    0x4(%rsp),%rsi
  lea    D57(%rip),%rbx
  mov    %rbx,%rdi
  call   <scanf@plt>
  lea    D33(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  lea    0xc(%rsp),%rsi
  mov    %rbx,%rdi
  call   <scanf@plt>
  mov    0xc(%rsp),%eax
  sub    $0x1,%eax
  cltq
  movl   $0x1,0x1a0(%rsp,%rax,4)
  lea    D35(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  mov    0x4(%rsp),%r10d
  test   %r10d,%r10d
  jle    L221
  mov    $0x0,%r12d
  mov    $0x0,%ebx
  lea    D57(%rip),%r13
  jmp    L147
L95:
  mov    0xc(%rsp),%edi
  lea    -0x1(%rdi),%edx
  cmp    %ebx,%edx
  je     L117
L28:
  add    $0x1,%eax
  mov    %eax,0x8(%rsp)
  cmp    0x4(%rsp),%eax
  jge    L63
L107:
  cltq
  add    %r12,%rax
  lea    0x330(%rsp,%rax,4),%rsi
  mov    %r13,%rdi
  call   <scanf@plt>
  mov    0x8(%rsp),%eax
  movslq %eax,%rdx
  add    %rbp,%rdx
  cmpl   $0x0,0x330(%rsp,%rdx,4)
  jne    L95
  cmp    %ebx,%eax
  je     L95
  movslq %eax,%rdx
  add    %rbp,%rdx
  movl   $0x270f,0x330(%rsp,%rdx,4)
  jmp    L95
L117:
  movslq %eax,%rdx
  lea    0x0(%rbp,%rdx,1),%rcx
  mov    0x330(%rsp,%rcx,4),%ecx
  mov    %ecx,0x10(%rsp,%rdx,4)
  jmp    L28
L63:
  add    $0x1,%ebx
  mov    0x4(%rsp),%r10d
  add    $0x64,%r12
  cmp    %ebx,%r10d
  jle    L221
L147:
  movl   $0x0,0x8(%rsp)
  cmpl   $0x0,0x4(%rsp)
  jle    L63
  mov    $0x0,%eax
  movslq %ebx,%rdx
  lea    (%rdx,%rdx,4),%rdx
  lea    (%rdx,%rdx,4),%rbp
  shl    $0x2,%rbp
  jmp    L107
L221:
  cmp    $0x1,%r10d
  jle    L189
  mov    $0x1,%r11d
  mov    %r10d,%edi
  lea    0x1a0(%rsp),%rsi
  lea    0x10(%rsp),%r8
  lea    0x330(%rsp),%rbx
  jmp    L105
L52:
  movslq %edx,%r9
  mov    0x10(%rsp,%r9,4),%r9d
  cmp    %r9d,(%r8,%rax,4)
  cmovl  %eax,%edx
L115:
  add    $0x1,%rax
  cmp    %rax,%rdi
  je     L89
L26:
  cmpl   $0x1,(%rsi,%rax,4)
  jne    L52
  jmp    L115
L89:
  movslq %edx,%rax
  movl   $0x1,0x1a0(%rsp,%rax,4)
  lea    (%rax,%rax,4),%rax
  lea    (%rax,%rax,4),%r9
  shl    $0x4,%r9
  add    %rbx,%r9
  mov    $0x0,%eax
  movslq %edx,%rdx
  jmp    L211
L79:
  add    $0x1,%rax
  cmp    %rax,%rdi
  je     L59
L211:
  cmpl   $0x1,(%rsi,%rax,4)
  je     L79
  mov    (%r9,%rax,4),%ecx
  add    0x10(%rsp,%rdx,4),%ecx
  cmp    %ecx,(%r8,%rax,4)
  jle    L79
  mov    %ecx,(%r8,%rax,4)
  jmp    L79
L59:
  add    $0x1,%r11d
  cmp    %r10d,%r11d
  je     L103
L105:
  mov    $0x0,%eax
  mov    $0x0,%edx
  jmp    L26
L103:
  mov    %r10d,0x8(%rsp)
L189:
  lea    D43(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  lea    0x8(%rsp),%rsi
  lea    D57(%rip),%rdi
  call   <scanf@plt>
  mov    0x8(%rsp),%eax
  sub    $0x1,%eax
  cltq
  mov    0x10(%rsp,%rax,4),%esi
  lea    D48(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  mov    0x9f78(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L159
  mov    $0x0,%eax
  add    $0x9f88,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  ret
L159:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: disassemble_data
arguments: data_label: D61
type: string
name: disassemble_data
arguments: data_label: D57
type: string
name: disassemble_data
arguments: data_label: D33
type: string
name: disassemble_data
arguments: data_label: D35
type: string
name: disassemble_data
arguments: data_label: D43
type: string
name: disassemble_data
arguments: data_label: D48
type: string

tool: D61: 
Enter the no. of vertices 

tool: D57: %d

tool: D33: 
Enter the source vertex 

tool: D35: 
Enter the cost matrix 

tool: D43: 
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, sel[100] = {0}, min;
  printf("\nEnter the no. of vertices ");
  scanf("%d", &n);
  printf("\nEnter the source vertex ");
  scanf("%d", &src);
  sel[src - 1] = 1;
  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++) {
    min = 0;
    for (j = 0; j < n; j++) {
      if (sel[j] != 1 && dist[j] < dist[min]) {
        min = j;
      }
    }
    sel[min] = 1;
    for (j = 0; j < n; j++)
      if (sel[j] != 1 && dist[j] > dist[min] + a[min][j])
        dist[j] = dist[min] + a[min][j];
  }
  printf("\nEnter the final vertex ");
  scanf("%d", &j);
  printf("\nThe shortest distance is %d ", dist[j - 1]);
  return 0;
}
```