分页式存储管理

#include<stdio.h>  
#include<stdlib.h>  
#include<iostream.h>  
#include<time.h>  
struct Page  
{  
    int kuai;  
    int stage;  
}FPage[1000],LPage[1000];  
  
struct Memory  
{  
    int num;  
    int page;  
}FMemory[1000],LMemory[1000],OMemory[1000];  
  
int PageLength;         /*页表长度*/  
int Memsize;            /*内存块数*/  
int FAbsent,LAbsent,OAbsent,visit;          /*FIFO中的缺页次数    LRU中的缺页次数       访问内存次数  */  
int Logical;            /*逻辑地址*/  
int Pagenumber,Pageaddr;/*页号    页内地址*/  
int Physical;       /*物理地址*/  
int PageSize;       /*块的大小*/  
int Freemem;        /*空闲内存*/  
  
int G[8][8];  
  
int opt[10000];     int oth=0;  
int temp[1000];  
  

void GShow()  
{  
    int i,j;  
    printf("位式图：\n");  
    for(i=0;i<8;i++)  
    {  
        printf("\t");  
        for(j=0;j<8;j++)       
            printf("%d ",G[i][j]);  
        printf("\n");  
    }  
}  
  
  
void init()                 /*初始化*/  
{  
    srand((unsigned)time(NULL));  
    int i,j;  
    for(i=0;i<8;i++)  
        G[0][i]=1;  
    for(i=1;i<8;i++)  
    {  
        for(j=0;j<8;j++)  
            G[i][j]=rand()%2;  
    }     
      
    for(i=0;i<PageLength;i++)  
    {  
        FPage[i].kuai=-1;       FPage[i].stage=0;     
        LPage[i].kuai=-1;       LPage[i].stage=0;