编写C语言程序，模拟UNIX磁盘空间管理中使用的分组链接法。

1.定义一个记录磁盘块号的堆栈S—free[10]，以及记录栈中现有磁盘块数的变量S—nfree。

2.定义一个由40个元素构成的结构数组block[40]用作磁盘块存放。

struct size

{ int blocl[10]

}

struct blocd

{ struct size a[10]

//用于在空闲磁盘块号链中存放磁盘块号

}block[40]

3. 假设系统中文件的最大容量为100个磁盘块，且最多只有5个文件，定义一个由5个元素构成的结构数组file[5]用于记录各个文件占用的磁盘块，。

struct File

{ int fileblocd[100]

//用于记录分别分配给文件的磁盘块号

}file[5]

-Procedures for the preparation of C language to simulate the UNIX disk space used in the management of sub-link method. 1. The definition of a record number of disk blocks stack S-free [10], as well as the record of the existing disk block stack variable number of S-nfree. 2. The definition of a 40 element array structure consisting of block [40] for block storage disk. struct size (int blocl [10] ) struct blocd (struct size a [10] // used to free disk blocks in its store chain in its disk block) block [40]　3. the assumption that the system' s maximum capacity of paper disk blocks for the 100, and a maximum of only five documents, the definition of five elements of a structure consisting of an array of file [5] used to record all the disk blocks occupied by files,. struct File (int fileblocd [100] // used to record files were assigned to the disk block number) file [5]