采用先来先服务FCFS调度进程运行，计算每个进程的周转时间，带权周转时间，并且计算所有进程的平均周转时间，带权平均周转时间； 要求模拟整个调度过程，输出每个时刻的进程运行状态，如“时刻3：进程B开始运行”； 要求输出计算出来的每个进程的周转时间，带权周转时间，所有进程的平均周转时间，带权平均周转时间，C语言代码

好的，我来解答你的问题。以下是一个简单的模拟先来先服务FCFS调度的进程运行的C语言代码，包括计算每个进程的周转时间和带权周转时间，以及输出每个时刻的进程运行状态：

#include <stdio.h>

#define MAX_PROCESSES 10

struct Process {
  int arrival_time;
  int burst_time;
  int completion_time;
  int turnaround_time;
  float normalized_turnaround_time;
};

int main() {
  int i, j, n;
  float average_turnaround_time = 0, average_normalized_turnaround_time = 0;
  struct Process processes[MAX_PROCESSES], temp;

  printf("Enter the number of processes: ");
  scanf("%d", &n);

  // Input process arrival time and burst time
  for (i = 0; i < n; i++) {
    printf("Enter the arrival time and burst time of process %d: ", i + 1);
    scanf("%d %d", &processes[i].arrival_time, &processes[i].burst_time);
  }

  // Sort processes by arrival time using bubble sort
  for (i = 0; i < n - 1; i++) {
    for (j = 0; j < n - i - 1; j++) {
      if (processes[j].arrival_time > processes[j + 1].arrival_time) {
        temp = processes[j];
        processes[j] = processes[j + 1];
        processes[j + 1] = temp;
      }
    }
  }

  // Calculate completion time, turnaround time, and normalized turnaround time
  for (i = 0; i < n; i++) {
    if (i == 0) {
      processes[i].completion_time = processes[i].burst_time;
    } else {
      processes[i].completion_time = processes[i - 1].completion_time + processes[i].burst_time;
    }
    processes[i].turnaround_time = processes[i].completion_time - processes[i].arrival_time;
    processes[i].normalized_turnaround_time = (float) processes[i].turnaround_time / processes[i].burst_time;
  }

  // Calculate average turnaround time and normalized turnaround time
  for (i = 0; i < n; i++) {
    average_turnaround_time += processes[i].turnaround_time;
    average_normalized_turnaround_time += processes[i].normalized_turnaround_time;
  }
  average_turnaround_time /= n;
  average_normalized_turnaround_time /= n;

  // Output process running status and results
  printf("Time\tProcess\tStatus\n");
  for (i = 0; i < n; i++) {
    printf("%d\t%d\tStarted\n", processes[i].arrival_time, i + 1);
    printf("%d\t%d\tCompleted\n", processes[i].completion_time, i + 1);
  }
  printf("Average turnaround time: %.2f\n", average_turnaround_time);
  printf("Average normalized turnaround time: %.2f\n", average_normalized_turnaround_time);

  return 0;
}

这个代码中，我们首先输入进程的到达时间和运行时间，然后根据到达时间对进程进行排序，采用冒泡排序算法。接下来，我们计算每个进程的完成时间、周转时间和带权周转时间，并计算所有进程的平均周转时间和带权平均周转时间。最后，我们输出每个时刻的进程运行状态，以及计算出来的结果。

注意，这个代码只是一个简单的模拟，实际的操作系统调度算法会更加复杂，需要考虑多种因素。