银行家算法(页 1) - C语言论坛 - 编程论坛

yuhailong8828 发表于 2008-6-22 12:02

银行家算法

C语言版
#define N 3
#define M 3
#define F 1000
int issafe(int need1[N][M],int allo1[N][M],int max1[N][M],int avai1[M])
{int need[N][M],allo[N][M],max[N][M],avai[M];
int i,j,k,flag,m=0,p[M],z;

for(i=0;i<N;i++)
  {for(j=0;j<N;j++)
{need[i][j]=need1[i][j];
   allo[i][j]=allo1[i][j];
   max[i][j]=max1[i][j];
}
avai[i]=avai1[i];
  }
while(m<N)
  {z=m;
for(i=0;i<N;i++)
   {flag=1;
   for(j=0;j<M;j++)
      {if(need[i][j]>avai[j])
         {flag=0;break;
         }
      }
   if(flag==1)
      {

         for(j=0;j<M;j++)
            {
            max[i][j]=F;

            need[i][j]=F;
            }
         for(j=0;j<N;j++) {avai[j]+=allo[i][j];}
         p[m]=i;  printf("p:%d-->",p[m]);
      m++;
      }

   }
if(z==m) return 0;
  }
return 1;
}

void printinit(int max[N][M],int allo[N][M],int need[N][M],int avai[M])
{int i,j;
printf("\nThe max\n");
for(i=0;i<N;i++)
  {printf("p%d: ",i);
for(j=0;j<N;j++)
{
   printf("%4d",max[i][j]);

}
printf("\n");
  }
printf("\nThe allocation\n");
for(i=0;i<N;i++)
  {printf("p%d: ",i);
for(j=0;j<N;j++)
{
   printf("%4d",allo[i][j]);

}
   printf("\n");
}
printf("\nThe need\n");
for(i=0;i<N;i++)
  {printf("p%d: ",i);
for(j=0;j<N;j++)
{
   printf("%4d",need[i][j]);

}
printf("\n");
  }
printf("\nThe available\n ");
for(i=0;i<N;i++)
{printf("%4d",avai[i]);
}

}
void init(int max[N][M],int allo[N][M],int need[N][M],int avai[M])
{int i,j;
printf("\nplease input the max!");
for(i=0;i<N;i++)
  {printf("\ninput the max of p:%d\n",i);
for(j=0;j<M;j++)
scanf("%d",&max[i][j]);
}
printf("\nplease input the allocation!");
for(i=0;i<N;i++)
  {printf("\ninput the max of p:%d\n",i);
for(j=0;j<M;j++)
scanf("%d",&allo[i][j]);
}
printf("\nplease input the available!\n");
  for(i=0;i<M;i++)
scanf("%d",&avai[i]);
for(i=0;i<N;i++)
for(j=0;j<M;j++)
need[i][j]=max[i][j]-allo[i][j];
}
main()
{int i,j,t,d[N];
int y,e=1,repay=0;
char r;
int max[N][M]={7,5,3,3,2,2,9,0,2};
int allo[N][M]={0,1,0,2,0,0,3,0,2};
int need[N][M];
int avai[M]={5,5,2};
for(i=0;i<N;i++)
for(j=0;j<M;j++)
need[i][j]=max[i][j]-allo[i][j];
printinit(max,allo,need,avai);
printf("\nif you want to reset it please input R,or put other key to continue\n");
r=getch();
if(r=="R"||r=='r')
  init(max,allo,need,avai);
for(;;)
{printinit(max,allo,need,avai);
  printf("\nplese any key to check the now station\n");
  getch();
  if(issafe(need,allo,max,avai))
{printf("\nnow the station is safe!\n");
printf("\npealse input which pocess(0,1,2......N-1)\n");
scanf("%d",&t);
printf("pealse input the pocess want to apply resource\n");
while(e==1)
   {for(i=0;i<M;i++)
      scanf("%d",&d[i]);
   for(i=0;i<M;i++)
      if(d[i]>need[t][i])
         {e=0;}
   if(e==0)
         {printf("\nerror!\nthe apply is exceed the need!please reset!\n");
         printf("the need:") ;
         for(j=0;j<M;j++)
            printf("%4d",need[t][j]) ;
         printf("\nbe sure unexceed the need\npealse input the pocess want to apply resource\n");
         e=1;
         }
   else
         e=0;
   }
e=1;
printf("is checking now.....");
for(i=0;i<M;i++)
   {need[t][i]-=d[i];
   allo[t][i]+=d[i];
   avai[i]-=d[i];
   }
if(issafe(need,allo,max,avai))
{ for(i=0;i<M;i++)

         if(need[t][i]!=0)
         {repay=1;break;}

      if(repay==0)
      for(i=0;i<M;i++)
      {avai[i]+=max[t][i];
      max[t][i]=0;
      allo[t][i]=0;
      }


      printf("\nsuccess!\n");
}

else
   {printf("\nfail\n");
   for(i=0;i<M;i++)
   {need[t][i]+=d[i];
   allo[t][i]-=d[i];
   avai[i]+=d[i];
   }
   }
}
  else
printf("\nnow the station is unsafe!\n");

  printf("\nIf you want to continue,please input 1\n");
  printf("If you want to exit,please input 0\ncontinue or not?[1/0]");
  scanf("%d",&y);
  if(y==0)
break;
}

}

StarWing83 发表于 2008-6-22 12:14

[quote][font=新宋体][size=2][color=#008000]/*****************************************************************
** HighlightCodeV3.0 software by yzfy(雨中飞燕) http://yzfy.org **
*****************************************************************/
[/color][color=#FF0000]#include <stdio.h>
[/color][color=#FF0000]#include <stdlib.h>

[/color][color=#FF0000]#define[/color][color=#FF00FF] N 3
[/color][color=#FF0000]#define[/color][color=#FF00FF] M 3
[/color][color=#FF0000]#define[/color][color=#FF00FF] F 1000
[/color]int [color=#008080]issafe[/color]([color=#0000FF]int [/color]need1[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],[color=#0000FF]int [/color]allo1[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],[color=#0000FF]int [/color]max1[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],[color=#0000FF]int [/color]avai1[color=#800000][[/color][color=#800080]M[/color][color=#800000]][/color])
[color=#800000]{
[/color][color=#0000FF]int [/color]need[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],allo[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],[color=#FF8000]max[/color][color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],avai[color=#800000][[/color][color=#800080]M[/color][color=#800000]][/color];
[color=#0000FF]int [/color]i,j,flag,m=[color=#8000C0]0[/color],p[color=#800000][[/color][color=#800080]M[/color][color=#800000]][/color],z;

[color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]N[/color];i++)
[color=#800000]{
      [/color][color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]N[/color];j++)
      [color=#800000]{
         [/color]need[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]=need1[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color];
         allo[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]=allo1[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color];
         [color=#FF8000]max[/color][color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]=max1[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color];
      [color=#800000]}
      [/color]avai[color=#800000][[/color]i[color=#800000]][/color]=avai1[color=#800000][[/color]i[color=#800000]][/color];
[color=#800000]}
[/color][color=#0000FF]while [/color](m<[color=#800080]N[/color])
[color=#800000]{
      [/color]z=m;
      [color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]N[/color];i++)
      [color=#800000]{
         [/color]flag=[color=#8000C0]1[/color];
         [color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]M[/color];j++)
         [color=#800000]{
            [/color][color=#0000FF]if [/color](need[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]>avai[color=#800000][[/color]j[color=#800000]][/color])
            [color=#800000]{
                  [/color]flag=[color=#8000C0]0[/color];[color=#0000FF]break[/color];
            [color=#800000]}
         }
         [/color][color=#0000FF]if [/color](flag==[color=#8000C0]1[/color])
         [color=#800000]{

            [/color][color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]M[/color];j++)
            [color=#800000]{
                  [/color][color=#FF8000]max[/color][color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]=[color=#800080]F[/color];

                  need[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]=[color=#800080]F[/color];
            [color=#800000]}
            [/color][color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]N[/color];j++) [color=#800000]{[/color]avai[color=#800000][[/color]j[color=#800000]][/color]+=allo[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color];[color=#800000]}
            [/color]p[color=#800000][[/color]m[color=#800000]][/color]=i;  [color=#FF0000]printf[/color]([color=#FF00FF]"p:%d-->"[/color],p[color=#800000][[/color]m[color=#800000]][/color]);
            m++;
         [color=#800000]}

      }
      [/color][color=#0000FF]if [/color](z==m) [color=#0000FF]return [/color][color=#8000C0]0[/color];
[color=#800000]}
[/color][color=#0000FF]return [/color][color=#8000C0]1[/color];
[color=#800000]}

[/color][color=#0000FF]void [/color][color=#008080]printinit[/color]([color=#0000FF]int [/color][color=#FF8000]max[/color][color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],[color=#0000FF]int [/color]allo[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],[color=#0000FF]int [/color]need[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],[color=#0000FF]int [/color]avai[color=#800000][[/color][color=#800080]M[/color][color=#800000]][/color])
[color=#800000]{
[/color][color=#0000FF]int [/color]i,j;
[color=#FF0000]printf[/color]([color=#FF00FF]"\nThe max\n"[/color]);
[color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]N[/color];i++)
[color=#800000]{
      [/color][color=#FF0000]printf[/color]([color=#FF00FF]"p%d: "[/color],i);
      [color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]N[/color];j++)
      [color=#800000]{
         [/color][color=#FF0000]printf[/color]([color=#FF00FF]"%4d"[/color],[color=#FF8000]max[/color][color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]);

      [color=#800000]}
      [/color][color=#FF0000]printf[/color]([color=#FF00FF]"\n"[/color]);
[color=#800000]}
[/color][color=#FF0000]printf[/color]([color=#FF00FF]"\nThe allocation\n"[/color]);
[color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]N[/color];i++)
[color=#800000]{
      [/color][color=#FF0000]printf[/color]([color=#FF00FF]"p%d: "[/color],i);
      [color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]N[/color];j++)
      [color=#800000]{
         [/color][color=#FF0000]printf[/color]([color=#FF00FF]"%4d"[/color],allo[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]);

      [color=#800000]}
      [/color][color=#FF0000]printf[/color]([color=#FF00FF]"\n"[/color]);
[color=#800000]}
[/color][color=#FF0000]printf[/color]([color=#FF00FF]"\nThe need\n"[/color]);
[color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]N[/color];i++)
[color=#800000]{
      [/color][color=#FF0000]printf[/color]([color=#FF00FF]"p%d: "[/color],i);
      [color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]N[/color];j++)
      [color=#800000]{
         [/color][color=#FF0000]printf[/color]([color=#FF00FF]"%4d"[/color],need[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]);

      [color=#800000]}
      [/color][color=#FF0000]printf[/color]([color=#FF00FF]"\n"[/color]);
[color=#800000]}
[/color][color=#FF0000]printf[/color]([color=#FF00FF]"\nThe available\n "[/color]);
[color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]N[/color];i++)
[color=#800000]{
      [/color][color=#FF0000]printf[/color]([color=#FF00FF]"%4d"[/color],avai[color=#800000][[/color]i[color=#800000]][/color]);
[color=#800000]}

}
[/color][color=#0000FF]void [/color][color=#008080]init[/color]([color=#0000FF]int [/color][color=#FF8000]max[/color][color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],[color=#0000FF]int [/color]allo[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],[color=#0000FF]int [/color]need[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color],[color=#0000FF]int [/color]avai[color=#800000][[/color][color=#800080]M[/color][color=#800000]][/color])
[color=#800000]{
[/color][color=#0000FF]int [/color]i,j;
[color=#FF0000]printf[/color]([color=#FF00FF]"\nplease input the max!"[/color]);
[color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]N[/color];i++)
[color=#800000]{
      [/color][color=#FF0000]printf[/color]([color=#FF00FF]"\ninput the max of p:%d\n"[/color],i);
      [color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]M[/color];j++)
         [color=#FF0000]scanf[/color]([color=#FF00FF]"%d"[/color],&[color=#FF8000]max[/color][color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]);
[color=#800000]}
[/color][color=#FF0000]printf[/color]([color=#FF00FF]"\nplease input the allocation!"[/color]);
[color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]N[/color];i++)
[color=#800000]{
      [/color][color=#FF0000]printf[/color]([color=#FF00FF]"\ninput the max of p:%d\n"[/color],i);
      [color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]M[/color];j++)
         [color=#FF0000]scanf[/color]([color=#FF00FF]"%d"[/color],&allo[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]);
[color=#800000]}
[/color][color=#FF0000]printf[/color]([color=#FF00FF]"\nplease input the available!\n"[/color]);
[color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]M[/color];i++)
      [color=#FF0000]scanf[/color]([color=#FF00FF]"%d"[/color],&avai[color=#800000][[/color]i[color=#800000]][/color]);
[color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]N[/color];i++)
      [color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]M[/color];j++)
         need[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]=[color=#FF8000]max[/color][color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]-allo[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color];
[color=#800000]}
[/color][color=#0000FF]int [/color][color=#FF0000]main[/color]()
[color=#800000]{
[/color][color=#0000FF]int [/color]i,j,t,d[color=#800000][[/color][color=#800080]N[/color][color=#800000]][/color];
[color=#0000FF]int [/color]y,e=[color=#8000C0]1[/color],repay=[color=#8000C0]0[/color];
[color=#0000FF]char [/color]r;
[color=#0000FF]int [/color][color=#FF8000]max[/color][color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color]=[color=#800000]{{[/color][color=#8000C0]7[/color],[color=#8000C0]5[/color],[color=#8000C0]3[/color][color=#800000]}[/color],[color=#800000]{[/color][color=#8000C0]3[/color],[color=#8000C0]2[/color],[color=#8000C0]2[/color][color=#800000]}[/color],[color=#800000]{[/color][color=#8000C0]9[/color],[color=#8000C0]0[/color],[color=#8000C0]2[/color][color=#800000]}}[/color];
[color=#0000FF]int [/color]allo[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color]=[color=#800000]{{[/color][color=#8000C0]0[/color],[color=#8000C0]1[/color],[color=#8000C0]0[/color][color=#800000]}[/color],[color=#800000]{[/color][color=#8000C0]2[/color],[color=#8000C0]0[/color],[color=#8000C0]0[/color][color=#800000]}[/color],[color=#800000]{[/color][color=#8000C0]3[/color],[color=#8000C0]0[/color],[color=#8000C0]2[/color][color=#800000]}}[/color];
[color=#0000FF]int [/color]need[color=#800000][[/color][color=#800080]N[/color][color=#800000]][[/color][color=#800080]M[/color][color=#800000]][/color];
[color=#0000FF]int [/color]avai[color=#800000][[/color][color=#800080]M[/color][color=#800000]][/color]=[color=#800000]{[/color][color=#8000C0]5[/color],[color=#8000C0]5[/color],[color=#8000C0]2[/color][color=#800000]}[/color];
[color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]N[/color];i++)
      [color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]M[/color];j++)
         need[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]=[color=#FF8000]max[/color][color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color]-allo[color=#800000][[/color]i[color=#800000]][[/color]j[color=#800000]][/color];
[color=#008080]printinit[/color]([color=#FF8000]max[/color],allo,need,avai);
[color=#FF0000]printf[/color]([color=#FF00FF]"\nif you want to reset it please input R,or put other key to continue\n"[/color]);
r=[color=#FF0000]getchar[/color]();
[color=#0000FF]if [/color](r==[color=#FF8000]'R'[/color]||r==[color=#FF8000]'r'[/color])
      [color=#008080]init[/color]([color=#FF8000]max[/color],allo,need,avai);
[color=#0000FF]for [/color](;;)
[color=#800000]{
      [/color][color=#008080]printinit[/color]([color=#FF8000]max[/color],allo,need,avai);
      [color=#FF0000]printf[/color]([color=#FF00FF]"\nplese any key to check the now station\n"[/color]);
      [color=#FF0000]getchar[/color]();
      [color=#0000FF]if [/color]([color=#008080]issafe[/color](need,allo,[color=#FF8000]max[/color],avai))
      [color=#800000]{
         [/color][color=#FF0000]printf[/color]([color=#FF00FF]"\nnow the station is safe!\n"[/color]);
         [color=#FF0000]printf[/color]([color=#FF00FF]"\npealse input which pocess(0,1,2......N-1)\n"[/color]);
         [color=#FF0000]scanf[/color]([color=#FF00FF]"%d"[/color],&t);
         [color=#FF0000]printf[/color]([color=#FF00FF]"pealse input the pocess want to apply resource\n"[/color]);
         [color=#0000FF]while [/color](e==[color=#8000C0]1[/color])
         [color=#800000]{
            [/color][color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]M[/color];i++)
                  [color=#FF0000]scanf[/color]([color=#FF00FF]"%d"[/color],&d[color=#800000][[/color]i[color=#800000]][/color]);
            [color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]M[/color];i++)
                  [color=#0000FF]if [/color](d[color=#800000][[/color]i[color=#800000]][/color]>need[color=#800000][[/color]t[color=#800000]][[/color]i[color=#800000]][/color])
                     [color=#800000]{[/color]e=[color=#8000C0]0[/color];[color=#800000]}
            [/color][color=#0000FF]if [/color](e==[color=#8000C0]0[/color])
            [color=#800000]{
                  [/color][color=#FF0000]printf[/color]([color=#FF00FF]"\nerror!\nthe apply is exceed the need!please reset!\n"[/color]);
                  [color=#FF0000]printf[/color]([color=#FF00FF]"the need:"[/color]) ;
                  [color=#0000FF]for [/color](j=[color=#8000C0]0[/color];j<[color=#800080]M[/color];j++)
                     [color=#FF0000]printf[/color]([color=#FF00FF]"%4d"[/color],need[color=#800000][[/color]t[color=#800000]][[/color]j[color=#800000]][/color]) ;
                  [color=#FF0000]printf[/color]([color=#FF00FF]"\nbe sure unexceed the need\npealse input the pocess want to apply resource\n"[/color]);
                  e=[color=#8000C0]1[/color];
            [color=#800000]}
            [/color][color=#0000FF]else
                  [/color]e=[color=#8000C0]0[/color];
         [color=#800000]}
         [/color]e=[color=#8000C0]1[/color];
         [color=#FF0000]printf[/color]([color=#FF00FF]"is checking now....."[/color]);
         [color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]M[/color];i++)
         [color=#800000]{
            [/color]need[color=#800000][[/color]t[color=#800000]][[/color]i[color=#800000]][/color]-=d[color=#800000][[/color]i[color=#800000]][/color];
            allo[color=#800000][[/color]t[color=#800000]][[/color]i[color=#800000]][/color]+=d[color=#800000][[/color]i[color=#800000]][/color];
            avai[color=#800000][[/color]i[color=#800000]][/color]-=d[color=#800000][[/color]i[color=#800000]][/color];
         [color=#800000]}
         [/color][color=#0000FF]if [/color]([color=#008080]issafe[/color](need,allo,[color=#FF8000]max[/color],avai))
         [color=#800000]{
            [/color][color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]M[/color];i++)

                  [color=#0000FF]if [/color](need[color=#800000][[/color]t[color=#800000]][[/color]i[color=#800000]][/color]!=[color=#8000C0]0[/color])
                     [color=#800000]{[/color]repay=[color=#8000C0]1[/color];[color=#0000FF]break[/color];[color=#800000]}

            [/color][color=#0000FF]if [/color](repay==[color=#8000C0]0[/color])
                  [color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]M[/color];i++)
                  [color=#800000]{
                     [/color]avai[color=#800000][[/color]i[color=#800000]][/color]+=[color=#FF8000]max[/color][color=#800000][[/color]t[color=#800000]][[/color]i[color=#800000]][/color];
                     [color=#FF8000]max[/color][color=#800000][[/color]t[color=#800000]][[/color]i[color=#800000]][/color]=[color=#8000C0]0[/color];
                     allo[color=#800000][[/color]t[color=#800000]][[/color]i[color=#800000]][/color]=[color=#8000C0]0[/color];
                  [color=#800000]}

            [/color][color=#FF0000]printf[/color]([color=#FF00FF]"\nsuccess!\n"[/color]);
         [color=#800000]}

         [/color][color=#0000FF]else
         [/color][color=#800000]{
            [/color][color=#FF0000]printf[/color]([color=#FF00FF]"\nfail\n"[/color]);
            [color=#0000FF]for [/color](i=[color=#8000C0]0[/color];i<[color=#800080]M[/color];i++)
            [color=#800000]{
                  [/color]need[color=#800000][[/color]t[color=#800000]][[/color]i[color=#800000]][/color]+=d[color=#800000][[/color]i[color=#800000]][/color];
                  allo[color=#800000][[/color]t[color=#800000]][[/color]i[color=#800000]][/color]-=d[color=#800000][[/color]i[color=#800000]][/color];
                  avai[color=#800000][[/color]i[color=#800000]][/color]+=d[color=#800000][[/color]i[color=#800000]][/color];
            [color=#800000]}
         }
      }
      [/color][color=#0000FF]else
         [/color][color=#FF0000]printf[/color]([color=#FF00FF]"\nnow the station is unsafe!\n"[/color]);

      [color=#FF0000]printf[/color]([color=#FF00FF]"\nIf you want to continue,please input 1\n"[/color]);
      [color=#FF0000]printf[/color]([color=#FF00FF]"If you want to exit,please input 0\ncontinue or not?[1/0]"[/color]);
      [color=#FF0000]scanf[/color]([color=#FF00FF]"%d"[/color],&y);
      [color=#0000FF]if [/color](y==[color=#8000C0]0[/color])
         [color=#0000FF]break[/color];
[color=#800000]}
[/color][color=#0000FF]return [/color][color=#8000C0]0[/color];
[color=#800000]}
[/color][/size][/font][/quote]

编译出N个错误，已经解决了。

yuhailong8828 发表于 2008-6-24 10:44

回复 2# StarWing83 的帖子

么意思？

页: [1]

编程论坛's Archiver

银行家算法

回复 2# StarWing83 的帖子