#include<stdio.

h>
int main()
{
int alc[5][5],max[5][5],i,j,p,r,need[5]
[5],count=0,finish[6],terminate=0,safe[6],available[6];
printf("Enter the process and allocation\n");
scanf("%d%d", &p,&r);
printf("Enter the Allocation Matrix\n");
for (i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
scanf("%d",&alc[i][j]);
}
}
printf("Enter the Max Matrix\n");
for (i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
scanf("%d",&max[i][j]);
}
}
printf("Enter the available resources\n");
for(i=0;i<r;i++)
scanf("%d",&available[i]);

printf("--------- OUT PUT ---------\n");

printf("allocation Matrix is\n");
for (i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
printf("%d\t",alc[i][j]);
}
printf("\n");
}
printf("Max Matrix is\n");
for (i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
printf("%d\t",max[i][j]);
}
printf("\n");
}
printf("The need matrix\n");
for(i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
need[i][j]=max[i][j]-alc[i][j];
printf("%d\t", need[i][j]);
}
printf("\n");
}
for(i=0;i<p;i++)
{
finish[i]=0;
}
while(count<p)
{
for(i=0;i<p;i++)
{
if(finish[i]==0)
{
for(j=0;j<r;j++)
{
if(need[i][j]>available[j])
break;
}
if(j==r)
{
safe[count]=i;
finish[i]=1;
for(j=0;j<r;j++)
{
available[j]+=alc[i][j];
}
count++;
terminate=0;
}
else
{
terminate++;
}
}
}
if(terminate==(p-1))
{
printf("safe sequence does not exist\n");
break;
}
}
if(terminate != (p-1))
{
printf("\n Available resources after complition\n");
for(i=0;i<r;i++)
{
printf("%d\t", available[i]);
}
printf("safe sequence\n");
for(i=0;i<p;i++)
{
printf("p%d\t",safe[i]);
}
printf("\n");

}
return 0;
}