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

```asm
<main>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  lea    -0x9000(%rsp),%r11
L14:
  sub    $0x1000,%rsp
  orq    $0x0,(%rsp)
  cmp    %r11,%rsp
  jne    L14
  sub    $0xf88,%rsp
  mov    $0x32,%ecx
  lea    D47(%rip),%r14
  mov    %fs:0x28,%rax
  mov    %rax,0x9f78(%rsp)
  xor    %eax,%eax
  lea    0x1a0(%rsp),%rbx
  mov    %rbx,%rdi
  rep stos %rax,%es:(%rdi)
  lea    D40(%rip),%rdi
  call   <printf@plt>
  lea    0x4(%rsp),%rsi
  mov    %r14,%rdi
  call   <scanf@plt>
  lea    D21(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    0xc(%rsp),%rsi
  mov    %r14,%rdi
  call   <scanf@plt>
  mov    0xc(%rsp),%eax
  lea    D59(%rip),%rdi
  sub    $0x1,%eax
  cltq
  movl   $0x1,0x1a0(%rsp,%rax,4)
  xor    %eax,%eax
  call   <printf@plt>
  mov    0x4(%rsp),%ecx
  test   %ecx,%ecx
  jle    L206
  movl   $0x0,0x8(%rsp)
  xor    %r12d,%r12d
  xor    %r15d,%r15d
  lea    0x330(%rsp),%r13
  test   %ecx,%ecx
  jle    L206
  nopl   0x0(%rax,%rax,1)
L103:
  movslq %r15d,%rdx
  xor    %eax,%eax
  lea    (%rdx,%rdx,4),%rdx
  lea    (%rdx,%rdx,4),%rbp
  shl    $0x2,%rbp
  nopl   0x0(%rax)
L20:
  cltq
  mov    %r14,%rdi
  add    %r12,%rax
  lea    0x0(%r13,%rax,4),%rsi
  call   <scanf@plt>
  movslq 0x8(%rsp),%rcx
  lea    0x0(%rbp,%rcx,1),%rdx
  mov    %rcx,%rax
  mov    0x330(%rsp,%rdx,4),%esi
  cmp    %r15d,%ecx
  je     L1
  test   %esi,%esi
  jne    L1
  movl   $0x270f,0x330(%rsp,%rdx,4)
  mov    $0x270f,%esi
L1:
  mov    0xc(%rsp),%edi
  lea    -0x1(%rdi),%edx
  cmp    %r15d,%edx
  je     L38
  mov    0x4(%rsp),%ecx
  add    $0x1,%eax
  mov    %eax,0x8(%rsp)
  cmp    %ecx,%eax
  jl     L20
  add    $0x1,%r15d
  cmp    %ecx,%r15d
  jge    L98
L91:
  movl   $0x0,0x8(%rsp)
  add    $0x64,%r12
  test   %ecx,%ecx
  jg     L103
L206:
  lea    D18(%rip),%rdi
  xor    %eax,%eax
  call   <printf@plt>
  lea    0x8(%rsp),%rsi
  mov    %r14,%rdi
  call   <scanf@plt>
  mov    0x8(%rsp),%eax
  lea    D35(%rip),%rdi
  sub    $0x1,%eax
  cltq
  mov    0x10(%rsp,%rax,4),%esi
  xor    %eax,%eax
  call   <printf@plt>
  mov    0x9f78(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L182
  add    $0x9f88,%rsp
  xor    %eax,%eax
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
  nopl   0x0(%rax,%rax,1)
L38:
  mov    %esi,0x10(%rsp,%rcx,4)
  mov    0x4(%rsp),%ecx
  add    $0x1,%eax
  mov    %eax,0x8(%rsp)
  cmp    %eax,%ecx
  jg     L20
  add    $0x1,%r15d
  cmp    %ecx,%r15d
  jl     L91
L98:
  cmp    $0x1,%ecx
  jle    L206
  mov    $0x1,%r10d
  movslq %ecx,%rdi
  lea    0x10(%rsp),%r8
  nopl   0x0(%rax,%rax,1)
L67:
  xor    %eax,%eax
  xor    %esi,%esi
  nopl   0x0(%rax)
L153:
  cmpl   $0x1,(%rbx,%rax,4)
  je     L131
  mov    0x10(%rsp,%rsi,4),%edx
  cmp    %edx,(%r8,%rax,4)
  jge    L131
  movslq %eax,%rsi
L131:
  add    $0x1,%rax
  cmp    %rdi,%rax
  jne    L153
  movl   $0x1,0x1a0(%rsp,%rsi,4)
  lea    (%rsi,%rsi,4),%rax
  lea    (%rax,%rax,4),%r9
  xor    %eax,%eax
  shl    $0x4,%r9
  add    %r13,%r9
L202:
  cmpl   $0x1,(%rbx,%rax,4)
  je     L110
  mov    (%r9,%rax,4),%edx
  add    0x10(%rsp,%rsi,4),%edx
  cmp    %edx,(%r8,%rax,4)
  jle    L110
  mov    %edx,(%r8,%rax,4)
L110:
  add    $0x1,%rax
  cmp    %rax,%rdi
  jne    L202
  add    $0x1,%r10d
  cmp    %ecx,%r10d
  jne    L67
  mov    %r10d,0x8(%rsp)
  jmp    L206
L182:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: disassemble_data
arguments: tag: D47
data_type: string
name: disassemble_data
arguments: tag: D40
data_type: string
name: disassemble_data
arguments: tag: D21
data_type: string
name: disassemble_data
arguments: tag: D59
data_type: string
name: disassemble_data
arguments: tag: D18
data_type: string
name: disassemble_data
arguments: tag: D35
data_type: string

tool: D47: %d

tool: D40: 
Enter the no. of vertices 

tool: D21: 
Enter the source vertex 

tool: D59: 
Enter the cost matrix 

tool: D18: 
Enter the final vertex 

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