编写并调试一个磁盘调度模拟程序，采用FCFS算法。已知进程号、进程访问的先后顺序、进程要访问的磁道数、磁头当前位置，要求使用SSTF算法输出每个进程移动的磁道数和平均寻道数

好的，下面是基于FCFS算法的磁盘调度模拟程序，使用SSTF算法输出每个进程移动的磁道数和平均寻道数：

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define MAX_QUEUE_SIZE 1000

// 磁盘访问请求结构体
typedef struct {
    int process_id;         // 进程号
    int cylinder;           // 磁道号
    int distance;           // 与当前磁道的距离
} Request;

int fcfs(Request req[], int count, int current_cylinder);
int sstf(Request req[], int count, int current_cylinder);

int main() {
    Request req[MAX_QUEUE_SIZE];
    int count = 0;
    int current_cylinder = 0;

    // 读入磁盘访问请求
    printf("Enter the requests:\n");
    while (scanf("%d %d", &req[count].process_id, &req[count].cylinder) == 2) {
        req[count].distance = abs(req[count].cylinder - current_cylinder);
        current_cylinder = req[count].cylinder;
        count++;
    }

    // 使用FCFS算法计算磁头移动距离和平均寻道时间
    int fcfs_distance = fcfs(req, count, current_cylinder);
    double fcfs_avg_seek_time = (double)fcfs_distance / count;

    printf("FCFS algorithm:\n");
    printf("Total distance: %d\n", fcfs_distance);
    printf("Average seek time: %.2lf\n", fcfs_avg_seek_time);

    // 使用SSTF算法计算磁头移动距离和平均寻道时间
    int sstf_distance = sstf(req, count, current_cylinder);
    double sstf_avg_seek_time = (double)sstf_distance / count;

    printf("SSTF algorithm:\n");
    printf("Total distance: %d\n", sstf_distance);
    printf("Average seek time: %.2lf\n", sstf_avg_seek_time);

    return 0;
}

// FCFS算法实现
int fcfs(Request req[], int count, int current_cylinder) {
    int total_distance = 0;

    for (int i = 0; i < count; i++) {
        total_distance += abs(req[i].cylinder - current_cylinder);
        current_cylinder = req[i].cylinder;
    }

    return total_distance;
}

// SSTF算法实现
int sstf(Request req[], int count, int current_cylinder) {
    int total_distance = 0;
    int visited[MAX_QUEUE_SIZE] = {0};

    for (int i = 0; i < count; i++) {
        int min_distance = MAX_QUEUE_SIZE;
        int min_index = -1;

        // 找到距离最近的请求
        for (int j = 0; j < count; j++) {
            if (!visited[j] && abs(req[j].cylinder - current_cylinder) < min_distance) {
                min_distance = abs(req[j].cylinder - current_cylinder);
                min_index = j;
            }
        }

        visited[min_index] = 1;
        total_distance += min_distance;
        current_cylinder = req[min_index].cylinder;
    }

    return total_distance;
}

在程序中，首先读入磁盘访问请求，然后分别使用FCFS算法和SSTF算法计算磁头移动距离和平均寻道时间。其中，FCFS算法直接按照请求的顺序进行处理，而SSTF算法则每次找到距离最近的请求进行处理。

编译运行程序后，输入磁盘访问请求（每行输入一个请求，格式为“进程号 磁道号”），程序会输出FCFS算法和SSTF算法的磁头移动距离和平均寻道时间。