#include<stdio.h>
#include<stdlib.h>
int  Judge(int a[])                                                                             //判断是否全部进入安全状态 
{
  int sum=0;
  for (int i=0;i<5;i++)
  {
    if(a[i]==1)
    {sum++;
    }     
  }
  if(sum!=5){ return 1;}
  else return 0;
}  
int main()
{
  //初始化 
  int Allocation[5][3]={ {0,1,0}, {2,0,0}, {3,0,2}, {2,1,1}, {0,0,2}};
  int Max[5][3]={{7,5,3},{3,2,2},{9,0,2},{2,2,2},{4,3,3}};
  int Need[5][3]= {{7,4,3},{1,2,2},{6,0,0},{0,1,1},{4,3,1}};
  int Available[3]={3,3,2};
  int Requesti[3]={3,3,0};                                                                      //修改值申请的值 
  if(Need[4][0]>=Requesti[0]&&Need[4][1]>=Requesti[1]&&Need[4][2]>=Requesti[2]){              //修改值进程剩余资源是哪一个 
    if(Available[0]>=Requesti[0]&&Available[1]>=Requesti[1]&&Available[2]>=Requesti[2]) {   
      for(int j=0;j<3;j++){                                    
      Allocation[4][j]+=Requesti[j];                                                      //修改值：第一次申请值后，对应的是哪个进程需要修改 
      Available[j]-=Requesti[j];
      Need[4][j]-=Requesti[j];                                                          //修改值：第一次申请值后，对应的是哪个进程需要修改  
      }
      //安全性算法
       {
        int work[3],finish[5];
        for (int j=0;j<3;j++){work[j]=Available[j];}
        for(int j=0;j<5;j++){finish[j]=0;}
        int sum1 =0;
          while(Judge (finish))
          {sum1++;
          printf("进入安全序列的顺序是：\n");
            for(int j =0;j<5;j++){
              if (finish[j]==0&&(Need[j][0]<=work[0]&&Need[j][1]<=work[1]&&Need[j][2]<=work[2]))
              {finish[j]=1;
              printf("p%d \n",j);
               for(int m=0;m<3;m++){ work[m]+=Allocation[j][m];}
              }
            }
            if(sum1>5)
            {break;
            }
          }
          if(!Judge(finish))
          {printf("victory");
          }
          if(Judge(finish))
          {printf("fail");
          }
       }
    }
  } 
}