user: Translate the below assembly code into C programming language:

```asm
<main>:
  endbr64
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  lea    -0x9000(%rsp),%r11
L122:
  sub    $0x1000,%rsp
  orq    $0x0,(%rsp)
  cmp    %r11,%rsp
  jne    L122
  sub    $0xdf0,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,0x9de8(%rsp)
  xor    %eax,%eax
  lea    D49(%rip),%rdi
  call   <printf@plt>
  lea    0x4(%rsp),%rsi
  lea    D67(%rip),%rbx
  mov    %rbx,%rdi
  call   <scanf@plt>
  lea    D25(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  lea    0xc(%rsp),%rsi
  mov    %rbx,%rdi
  call   <scanf@plt>
  lea    D7(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  mov    0x4(%rsp),%ebp
  test   %ebp,%ebp
  jle    L130
  mov    $0x0,%r12d
  mov    $0x0,%ebx
  lea    D67(%rip),%r13
  jmp    L132
L34:
  mov    0xc(%rsp),%edi
  lea    -0x1(%rdi),%edx
  cmp    %ebx,%edx
  je     L67
L99:
  add    $0x1,%eax
  mov    %eax,0x8(%rsp)
  cmp    0x4(%rsp),%eax
  jge    L84
L41:
  cltq
  add    %r12,%rax
  lea    0x1a0(%rsp,%rax,4),%rsi
  mov    %r13,%rdi
  call   <scanf@plt>
  mov    0x8(%rsp),%eax
  movslq %eax,%rdx
  add    %rbp,%rdx
  cmpl   $0x0,0x1a0(%rsp,%rdx,4)
  jne    L34
  cmp    %ebx,%eax
  je     L34
  movslq %eax,%rdx
  add    %rbp,%rdx
  movl   $0x270f,0x1a0(%rsp,%rdx,4)
  jmp    L34
L67:
  movslq %eax,%rdx
  lea    0x0(%rbp,%rdx,1),%rcx
  mov    0x1a0(%rsp,%rcx,4),%ecx
  mov    %ecx,0x10(%rsp,%rdx,4)
  jmp    L99
L84:
  add    $0x1,%ebx
  mov    0x4(%rsp),%ebp
  add    $0x64,%r12
  cmp    %ebx,%ebp
  jle    L130
L132:
  movl   $0x0,0x8(%rsp)
  cmpl   $0x0,0x4(%rsp)
  jle    L84
  mov    $0x0,%eax
  movslq %ebx,%rdx
  lea    (%rdx,%rdx,4),%rdx
  lea    (%rdx,%rdx,4),%rbp
  shl    $0x2,%rbp
  jmp    L41
L130:
  cmp    $0x1,%ebp
  jle    L153
  mov    0xc(%rsp),%eax
  lea    -0x1(%rax),%r11d
  lea    0x10(%rsp),%r12
  mov    %ebp,%ebx
  lea    -0x1(%rbp),%eax
  lea    0x14(%rsp,%rax,4),%r9
  mov    $0x1,%r13d
  jmp    L100
L205:
  add    $0x1,%r8d
  add    $0x4,%rsi
  add    $0x4,%r10
  cmp    %r8d,%ebx
  je     L103
L128:
  cmp    %r8d,%r11d
  je     L205
  mov    %r10,%rdi
  mov    %r12,%rdx
L139:
  mov    (%rdi),%eax
  add    (%rdx),%eax
  mov    (%rsi),%r14d
  cmp    %r14d,%eax
  cmovg  %r14d,%eax
  mov    %eax,(%rsi)
  add    $0x4,%rdx
  add    $0x190,%rdi
  cmp    %r9,%rdx
  jne    L139
  jmp    L205
L103:
  add    $0x1,%r13d
  cmp    %ebp,%r13d
  je     L123
L100:
  lea    0x1a0(%rsp),%r10
  mov    %r12,%rsi
  mov    $0x0,%r8d
  jmp    L128
L123:
  mov    %ebp,0x8(%rsp)
L153:
  lea    D34(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  lea    0x8(%rsp),%rsi
  lea    D67(%rip),%rdi
  call   <scanf@plt>
  mov    0x8(%rsp),%eax
  sub    $0x1,%eax
  cltq
  mov    0x10(%rsp,%rax,4),%esi
  lea    D58(%rip),%rdi
  mov    $0x0,%eax
  call   <printf@plt>
  mov    0x9de8(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L142
  mov    $0x0,%eax
  add    $0x9df0,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  ret
L142:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: parse_data
arguments: label: D49
datatype: string
name: parse_data
arguments: label: D67
datatype: string
name: parse_data
arguments: label: D25
datatype: string
name: parse_data
arguments: label: D7
datatype: string
name: parse_data
arguments: label: D34
datatype: string
name: parse_data
arguments: label: D58
datatype: string

tool: D49: 
Enter the no. of vertices 

tool: D67: %d

tool: D25: 
Enter the source vertex 

tool: D7: 
Enter the cost matrix 

tool: D34: 
Enter the final vertex 

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